A K-nearest neighbours method based on imprecise probabilities

作者：Destercke Sebastien^*

来源：Soft Computing, 2012, 16(5): 833-844.

DOI：10.1007/s00500-011-0773-5

• Classification
• Lower prevision
• Nearest neighbours
• Uncertain data

K-nearest neighbours algorithms are among the most popular existing classification methods, due to their simplicity and good performances. Over the years, several extensions of the initial method have been proposed. In this paper, we propose a K-nearest neighbours approach that uses the theory of imprecise probabilities, and more specifically lower previsions. We show that the proposed approach has several assets: it can handle uncertain data in a very generic way, and decision rules developed within this theory allow us to deal with conflicting information between neighbours or with the absence of close neighbour to the instance to classify. We show that results of the basic k-NN and weighted k-NN methods can be retrieved by the proposed approach. We end with some experiments on the classical data sets.

• 出版日期2012-5