.png){kind=icon}
返回
Exploiting the categorical reliability difference for binary classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2017.11.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In binary pattern classification, the reliabilities of statistics obtained from the samples of the two categories are generally different. When the statistics are used for modeling a classifier, such reliability difference could impact the generalization performance. We formulate a disparity index to show the statistical disparity based on the generalized eigenvalue decomposition of the categorical moment matrices. It is shown that this disparity index can effectively indicate the reliability difference between the two categories. The obtained reliability difference is subsequently utilized to adjust the regularization term of a classifier for effective learning generalization. Our experiments based on 10 real-world benchmark data sets validate the effectiveness of the proposed method. (c) 2017 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
A center sliding Bayesian binary classifier adopting orthogonal polynomials.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容