You are here: Symbol Reference > Classifier Namespace > Classes > TKNearestNeighbors Class
Data Miner
ContentsIndex
PreviousUpNext
TKNearestNeighbors Class

Implementation of the K-NN (K Nearest Neighbors) classification algorithm.

Pascal
TKNearestNeighbors = class(TClassifier);

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)).

Copyright (c) 1999-2017 by Dew Research. All rights reserved.
What do you think about this topic? Send feedback!