The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2004 vol.26)
pp: 525-528
Bin Zhang , IEEE
ABSTRACT
<p><b>Abstract</b>—Most fast <tmath>k{\hbox{-}}{\rm{nearest}}</tmath> neighbor (<tmath>k{\hbox{-}}{\rm{NN}}</tmath>) algorithms exploit metric properties of distance measures for reducing computation cost and a few can work effectively on both metric and nonmetric measures. We propose a cluster-based tree algorithm to accelerate <tmath>k{\hbox{-}}{\rm{NN}}</tmath> classification without any presuppositions about the metric form and properties of a dissimilarity measure. A mechanism of early decision making and minimal side-operations for choosing searching paths largely contribute to the efficiency of the algorithm. The algorithm is evaluated through extensive experiments over standard NIST and MNIST databases.</p>
INDEX TERMS
Nearest neighbor classification, nonmetrics, metrics, cluster tree.
CITATION
Bin Zhang, Sargur N. Srihari, "Fast k-Nearest Neighbor Classification Using Cluster-Based Trees", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.26, no. 4, pp. 525-528, April 2004, doi:10.1109/TPAMI.2004.1265868
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool