Back to Search Start Over

Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree Structure.

Authors :
Hutchison, David
Kanade, Takeo
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Pandu Rangan, C.
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Rueda, Luis
Mery, Domingo
Kittler, Josef
Hernández-Rodríguez, Selene
Martínez-Trinidad, J. Francisco
Carrasco-Ochoa, J. Ariel
Source :
Progress in Pattern Recognition, Image Analysis & Applications (978-3-540-76724-4); 2008, p407-416, 10p
Publication Year :
2008

Abstract

In this work, a fast k most similar neighbor (k-MSN) classifier for mixed data is presented. The k nearest neighbor (k-NN) classifier has been a widely used nonparametric technique in Pattern Recognition. Many fast k-NN classifiers have been developed to be applied on numerical object descriptions, most of them based on metric properties to avoid object comparisons. However, in some sciences as Medicine, Geology, Sociology, etc., objects are usually described by numerical and non numerical features (mixed data). In this case, we can not assume the comparison function satisfies metric properties. Therefore, our classifier is based on search algorithms suitable for mixed data and non-metric comparison functions. Some experiments and a comparison against other two fast k-NN methods, using standard databases, are presented. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540767244
Database :
Complementary Index
Journal :
Progress in Pattern Recognition, Image Analysis & Applications (978-3-540-76724-4)
Publication Type :
Book
Accession number :
34019527
Full Text :
https://doi.org/10.1007/978-3-540-76725-1_43