.png){kind=icon}
返回
A probabilistic nearest neighbour method for statistical pattern recognition
.png){kind=icon}
OA
AI
DOI：10.1111/1467-9868.00338.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nearest neighbour algorithms are among the most popular methods used in statistical pattern recognition. The models are conceptually simple and empirical studies have shown that their performance is highly competitive against other techniques. However, the lack of a formal framework for choosing the size of the neighbourhood k is problematic. Furthermore, the method can only make discrete predictions by reporting the relative frequency of the classes in the neighbourhood of the prediction point. We present a probabilistic framework for the k-nearest-neighbour method that largely overcomes these difficulties. Uncertainty is accommodated via a prior distribution on k as well as in the strength of the interaction between neighbours. These prior distributions propagate uncertainty through to proper probabilistic predictions that have continuous support on (0, 1). The method makes no assumptions about the distribution of the predictor variables. The method is also fully automatic with no user-set parameters and empirically it proves to be highly accurate on many bench-mark data sets.
Keyword:
Bayesian k nearest neighbour
nonparametric classification
probabilistic nearest neighbour
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.6
论文数:
1.5K
被引数:
3.2W
机构
暂无机构信息
引用论文
Taste and textural characters of mixtures of caftaric acid and Grape Reaction Product in model wineOAAI
.png){kind=icon}
OAAI分享收藏Following a moving target - Monte Carlo inference for dynamic Bayesian models跟踪移动目标-动态贝叶斯模型的蒙特卡洛推理OAAI
OAAI分享收藏
没有更多内容
没有更多内容