.png){kind=icon}
返回
Converting non-parametric distance-based classification to anytime algorithms
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-007-0098-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For many real world problems we must perform classification under widely varying amounts of computational resources. For example, if asked to classify an instance taken from a bursty stream, we may have anywhere from several milliseconds to several minutes to return a class prediction. For such problems an anytime algorithm may be especially useful. In this work we show how we convert the ubiquitous nearest neighbor classifier into an anytime algorithm that can produce an instant classification, or if given the luxury of additional time, can continue computations to increase classification accuracy. We demonstrate the utility of our approach with a comprehensive set of experiments on data from diverse domains. We further show the utility of our work with two deployed applications, in classifying and counting fish, and in classifying insects.
Keyword:
anytime classification
nearest neighbor applications
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
引用论文
.png){kind=icon}
分享收藏Visual processing and classification of items on a moving conveyor:: a selective perception approach
OAAI
OAAI分享收藏
查看更多内容