Skip to main navigation Skip to search Skip to main content

Improvements in K-nearest neighbor classification

  • SUNY Buffalo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

Abstract

We have deveioped two novel methods to improve K-nearest neighbor (K-NN) classifications. First, we introduce a new technique to greatly reduce the template size. This significantly improves classification time with no accuracy drop. Secondly, we introduce a preprocessing procedure to preclude a large part of prototype patterns which are unlikely to match the unknown pattern. This again accelerates the classification procedure considerably. The simulation results on the GSC digit recognizer [1] show that the accommodation of two procedures to K-NN search achieves 7 times faster than the original one without any decay in classification accuracy.

Original languageEnglish
Title of host publicationAdvances in Pattern Recognition - 2nd International Conference, ICAPR 2001, Proceedings
EditorsSameer Singh, Nabeel Murshed, Walter Kropatsch
PublisherSpringer Verlag
Pages222-229
Number of pages8
ISBN (Print)3540417672
StatePublished - 2001
Event2nd International Conference on Advances in Pattern Recognition, ICAPR 2001 - Rio de Janeiro, Brazil
Duration: Mar 11 2001 → Mar 14 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2013
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Advances in Pattern Recognition, ICAPR 2001
Country/TerritoryBrazil
CityRio de Janeiro
Period03/11/01 → 03/14/01

Fingerprint

Dive into the research topics of 'Improvements in K-nearest neighbor classification'. Together they form a unique fingerprint.

Cite this