.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W
Organization
View more organizations