.png){kind=icon}
返回
Improving classifier performance through repeated sampling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(96)00182-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Bayes risk
classifier
consensus sequence voting
optical character recognition
repeated sampling
statistical pattern recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
.png){kind=icon}
