Revision as of 16:56, 22 October 2010 by Mboutin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

K Nearest Neighbors

The classifiers do not use any model to fit the data and only based on memory. The KNN uses neighborhood classification as the predication value of the new query. It has advantages - nonparametric architecture, simple and powerful, requires no traning time, but it also has disadvantage - memory intensive, classification and estimation are slow. Please refer to KNN tutorial website.

  1. KNN Tutorial : Contents are below
    • How K-Nearest Neighbor (KNN) Algorithm works?
    • Numerical Example (hand computation)
    • KNN for Smoothing and Prediction
    • How do we use the spreadsheet for KNN?
    • Strength and Weakness of K-Nearest Neighbor Algorithm
    • Resources for K Nearest Neighbors Algorithm
  2. KNN
  3. Class Prediction using KNN
  4. WIKIPEDIA

Back to "Decision Theory Glossary

Back to ECE662 Spring 2008 Prof. Boutin

Alumni Liaison

BSEE 2004, current Ph.D. student researching signal and image processing.

Landis Huffman