A K-nearest neighbours method based on imprecise probabilities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Soft Computing Année : 2012

A K-nearest neighbours method based on imprecise probabilities

Résumé

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.
Fichier principal
Vignette du fichier
Destercke2011-A_K-nearest_neighbours_method_based_on_imprecise_probabilities.pdf (442.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00692149 , version 1 (28-04-2012)

Identifiants

Citer

Sébastien Destercke. A K-nearest neighbours method based on imprecise probabilities. Soft Computing, 2012, 16 (5), pp.833-844. ⟨10.1007/s00500-011-0773-5⟩. ⟨hal-00692149⟩
94 Consultations
425 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More