Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating

Selene Hernández-Rodríguez, J. A. Carrasco-Ochoa, J. Fco Martínez-Trinidad

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearch

Abstract

The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is large, the exhaustive k-NN classifier becomes impractical. Therefore, many fast k-NN classifiers have been developed to avoid this problem. Most of these classifiers rely on metric properties, usually the triangle inequality, to reduce the number of prototype comparisons. However, in soft sciences, the prototypes are usually described by qualitative and quantitative features (mixed data), and sometimes the comparison function does not satisfy the triangle inequality. Therefore, in this work, a fast k most similar neighbor (k-MSN) classifier, which uses a Tree structure and an Approximating and Eliminating approach for Mixed Data, not based on metric properties (Tree AEMD), is introduced. The proposed classifier is compared against other fast k-NN classifiers. © 2008 Springer-Verlag Berlin Heidelberg.
Original languageAmerican English
Title of host publicationFast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating
Pages364-371
Number of pages326
ISBN (Electronic)3540859195, 9783540859192
DOIs
StatePublished - 10 Nov 2008
Externally publishedYes
EventLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duration: 1 Jan 2014 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5197 LNCS
ISSN (Print)0302-9743

Conference

ConferenceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Period1/01/14 → …

Fingerprint

Mixed Data
Tree Structure
Classifiers
Classifier
Nearest Neighbor
Triangle inequality
Prototype
Metric
Pattern Recognition
Pattern recognition

Cite this

Hernández-Rodríguez, S., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2008). Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. In Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating (pp. 364-371). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5197 LNCS). https://doi.org/10.1007/978-3-540-85920-8_45
Hernández-Rodríguez, Selene ; Carrasco-Ochoa, J. A. ; Martínez-Trinidad, J. Fco. / Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. 2008. pp. 364-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5efa22f4366f490cbac9ac68787e4d53,
title = "Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating",
abstract = "The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is large, the exhaustive k-NN classifier becomes impractical. Therefore, many fast k-NN classifiers have been developed to avoid this problem. Most of these classifiers rely on metric properties, usually the triangle inequality, to reduce the number of prototype comparisons. However, in soft sciences, the prototypes are usually described by qualitative and quantitative features (mixed data), and sometimes the comparison function does not satisfy the triangle inequality. Therefore, in this work, a fast k most similar neighbor (k-MSN) classifier, which uses a Tree structure and an Approximating and Eliminating approach for Mixed Data, not based on metric properties (Tree AEMD), is introduced. The proposed classifier is compared against other fast k-NN classifiers. {\circledC} 2008 Springer-Verlag Berlin Heidelberg.",
author = "Selene Hern{\'a}ndez-Rodr{\'i}guez and Carrasco-Ochoa, {J. A.} and Mart{\'i}nez-Trinidad, {J. Fco}",
year = "2008",
month = "11",
day = "10",
doi = "10.1007/978-3-540-85920-8_45",
language = "American English",
isbn = "3540859195",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "364--371",
booktitle = "Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating",

}

Hernández-Rodríguez, S, Carrasco-Ochoa, JA & Martínez-Trinidad, JF 2008, Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. in Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5197 LNCS, pp. 364-371, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1/01/14. https://doi.org/10.1007/978-3-540-85920-8_45

Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. / Hernández-Rodríguez, Selene; Carrasco-Ochoa, J. A.; Martínez-Trinidad, J. Fco.

Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. 2008. p. 364-371 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5197 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearch

TY - GEN

T1 - Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating

AU - Hernández-Rodríguez, Selene

AU - Carrasco-Ochoa, J. A.

AU - Martínez-Trinidad, J. Fco

PY - 2008/11/10

Y1 - 2008/11/10

N2 - The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is large, the exhaustive k-NN classifier becomes impractical. Therefore, many fast k-NN classifiers have been developed to avoid this problem. Most of these classifiers rely on metric properties, usually the triangle inequality, to reduce the number of prototype comparisons. However, in soft sciences, the prototypes are usually described by qualitative and quantitative features (mixed data), and sometimes the comparison function does not satisfy the triangle inequality. Therefore, in this work, a fast k most similar neighbor (k-MSN) classifier, which uses a Tree structure and an Approximating and Eliminating approach for Mixed Data, not based on metric properties (Tree AEMD), is introduced. The proposed classifier is compared against other fast k-NN classifiers. © 2008 Springer-Verlag Berlin Heidelberg.

AB - The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is large, the exhaustive k-NN classifier becomes impractical. Therefore, many fast k-NN classifiers have been developed to avoid this problem. Most of these classifiers rely on metric properties, usually the triangle inequality, to reduce the number of prototype comparisons. However, in soft sciences, the prototypes are usually described by qualitative and quantitative features (mixed data), and sometimes the comparison function does not satisfy the triangle inequality. Therefore, in this work, a fast k most similar neighbor (k-MSN) classifier, which uses a Tree structure and an Approximating and Eliminating approach for Mixed Data, not based on metric properties (Tree AEMD), is introduced. The proposed classifier is compared against other fast k-NN classifiers. © 2008 Springer-Verlag Berlin Heidelberg.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=55349132073&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=55349132073&origin=inward

U2 - 10.1007/978-3-540-85920-8_45

DO - 10.1007/978-3-540-85920-8_45

M3 - Conference contribution

SN - 3540859195

SN - 9783540859192

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 364

EP - 371

BT - Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating

ER -

Hernández-Rodríguez S, Carrasco-Ochoa JA, Martínez-Trinidad JF. Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. In Fast k most similar neighbor classifier for mixed data based on a tree structure and approximating-eliminating. 2008. p. 364-371. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-85920-8_45