Implementation of the K-NN (K Nearest Neighbors) classification algorithm.Unit
Classifier
Declaration
TKNearestNeighbors = class(TClassifier)
Hierarchy
TComponent <--TClassifier <--TKNearestNeighbors
Subclasses
None
Description
K-NN searches for K nearest neighbors, to the example that we want to classify, and then classifies to the majority class of the nearest neighbors. The algorithm works very well especially for real valued attributes. (real domains). The algorithm gives very good results, but its main disadvantage is slow performance (computational complexity O(n2)).
|
Help for MtxVec v2.1. (c) 2006 Dew Research.
|
http://www.dewresearch.com
TKNearestNeighbors Component
