A K-nearest neighbours method based on imprecise probabilities

Abstract : K-nearest neighbours algorithms are among the most popular existing classification methods, due to their simplicity and their 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 classical data sets.
Complete list of metadatas

Cited literature [44 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00692149
Contributor : Sébastien Destercke <>
Submitted on : Saturday, April 28, 2012 - 3:42:12 PM
Last modification on : Tuesday, July 24, 2018 - 4:40:02 PM
Long-term archiving on : Thursday, December 15, 2016 - 3:37:28 AM

File

Destercke2011-A_K-nearest_neig...
Files produced by the author(s)

Identifiers

Collections

Citation

Sébastien Destercke. A K-nearest neighbours method based on imprecise probabilities. Soft Computing, Springer Verlag, 2012, 16, pp.833-844. ⟨10.1007/s00500-011-0773-5⟩. ⟨hal-00692149⟩

Share

Metrics

Record views

181

Files downloads

286