.png){kind=icon}
Return
Improving classifier performance through repeated sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(96)00182-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In traditional pattern recognition, the classification decision is based on a single observation of the input. In this paper, we show that by relaxing this assumption, the performance of the classifier can be improved substantially. We present a detailed analysis of one particular method for achieving this: taking a consensus vote on the classifier's output for repeated samples of the input. We prove that this approach always yields a net improvement in recognition accuracy for common distributions of interest. Upper and lower bounds on the improvement are also discussed. Under certain conditions, it is even possible to ''beat'' the Bayes error bound associated with the classifier. We conclude by presenting results from three sets of experiments examining the effectiveness of the idea. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
Keywords:
Bayes risk
classifier
consensus sequence voting
optical character recognition
repeated sampling
statistical pattern recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
.png){kind=icon}
