Sciweavers

ESANN
2008

K-nearest neighbours based on mutual information for incomplete data classification

13 years 5 months ago
K-nearest neighbours based on mutual information for incomplete data classification
Incomplete data is a common drawback that machine learning techniques need to deal with when solving real-life classification tasks. One of the most popular procedures for solving this kind of problems is the K-nearest neighbours (KNN) algorithm. In this paper, we present a weighted KNN approach using mutual information to impute and classify incomplete input data. Numerical results on both artificial and real data are given to demonstrate the effectiveness of the proposed method.
Pedro J. García-Laencina, José-Luis
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where ESANN
Authors Pedro J. García-Laencina, José-Luis Sancho-Gómez, Aníbal R. Figueiras-Vidal, Michel Verleysen
Comments (0)