K-D decision tree: An accelerated and memory efficient nearest neighbor classifier

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 641-644

  Shibata, Tomoyuki ^a   Kato, Takekazu ^a   Wada, Toshikazu ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 10044297591     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. B.K.B T.M. Cover and P.E. Hart: Nearest neighbor pattern classification, IEEE Transactions on Information Theory, Vol. IT-13, No.1, pp.21-27, (1967)
2. P.E. Hart: The condensed nearest-neighbor rule, IEEE Transactions on Information Theory, Vol. IT-4, No. 5, pp.515-516, (1968)
3. G. W. Gates: The Reduced Nearest Neighbor Rule, IEEE Trans. on Information Theory, Vol. IT-18, No. 3, pp.431-433, 1972
4. G. L. Ritter, H. B. Woodruff, S. R. Lowry, and T. L. Isenhour: An algorithm for a selective nearest neighbor decision rule, IEEE Trans. on Information Theory, Vol. 21, pp. 665-669, 1975
5. I. Tomek: A generalization of the k-nn rule, IEEE Trans. on Systems, Man and Cybernetics, Vol. 6, pp. 121-126, 1976
6. th IJCAI, pp.794-799, 1989
7. D. W. Aha, D. Kibler and M. Albert: Instance-Based Learning Algorithms, Machine Learning, Vol.6, pp. 37-66, 1991
8. Bhattacharya, R. S. Poulsen,, G. T. Toussaint: Application of Proximity Graphs to Editing Nearest Neighbor Decision Rule, International Symposium on Information Theory, Santa Monica, (1981)
9. B.V. Dasarathy: Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design, IEEE Transactions on Systems, Man and Cybernetics, Vol. 24, No. 3, pp.511-517, (1994)
10. B.V. Dasarathy, J. S. Sanchez and S. Townsend: Nearest Neighbour Editing and Condensing Tools-Synergy Exploitation, Pattern Analysis & Applications, Vol. 3, pp.19-30, 2000
11. V. N. Vapnik: The Nature of Statistical Learning Theory, Splinger, 1995
12. Y. Freund and R. E. Schapire: A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, Vol. 55, No. 1, pp. 119-139, 1997
13. J. L. Bentley: Multidimensional binary search trees used for associative searching, Communications of the ACM, Vol.18, No.9, 1975
14. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, "An optimal algorithm for approximate nearest neighbor searching," Journal of the ACM, Vol.45, pp. 891-923, 1998
15. ANN: Library for Approximate Nearest Neighbor Searching (http://www.cs.umd.edu/~mount/ANN/)