Efficient exact k-NN and nonparametric classification in high dimensions

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Liu, Ting ^a   Moore, Andrew W ^a   Gray, Alexander ^a  

^a Computer Science Dept Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH DIMENSIONS; HIGH-DIMENSIONAL; K-NEAREST NEIGHBOR CLASSIFIER; K-NN CLASSIFICATIONS; NONPARAMETRIC CLASSIFICATION; REAL-WORLD DATASETS; SUPPORT VECTOR MACHINE CLASSIFIERS; TREE ALGORITHMS;

SUPPORT VECTOR MACHINES;

EID: 84898942146     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM, 45(6):891-923, 1998.
2. S. D. Bay. UCI KDD Archive [http://kdd.ics.uci.edu]. Irvine, CA: University of California, Dept of Information and Computer Science, 1999.
3. C. Burges. A tutorial on Support Vector Machines for Pattern Recognition. Data Mining and Knowledge Discovery, 2(2):955-974, 1998.
4. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of the 23rd VLDB International Conference, September 1997.
5. K. Deng and A. W. Moore. Multiresolution Instance-based Learning. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 1233-1239, San Francisco, 1995. Morgan Kaufmann.
6. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, September 1977.
7. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc 25th VLDB Conference, 1999.
8. A. Gray and A. W. Moore. N-Body Problems in Statistical Learning. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13 (December 2000). MIT Press, 2001.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Assn for Computing Machinery, April 1984.
10. J. M. Hammersley. The Distribution of Distances in a Hypersphere. Annals of Mathematical Statistics, 21:447-452, 1950.
11. CMU informedia digital video library project. The trec-2001 video trackorganized by nist shot boundary task, 2001.
12. T. Joachims. Making large-scale support vector machine learning practical. In A. Smola B. Scḧolkopf, C. Burges, editor, Advances in Kernel Methods: Support Vector Machines. MIT Press, Cambridge, MA, 1998.
13. A. W. Moore. The Anchors Hierarchy: Using the Triangle Inequality to Survive High- Dimensional Data. In Twelfth Conference on Uncertainty in Artificial Intelligence. AAAI Press, 2000.
14. S. M. Omohundro. Efficient Algorithms with Neural Network Behaviour. Journal of Complex Systems, 1(2):273-347, 1987.
15. S. M. Omohundro. Bumptrees for Efficient Function, Constraint, and Classification Learning. In R. P. Lippmann, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3. Morgan Kaufmann, 1991.
16. D. Pelleg and A. W. Moore. Accelerating Exact k-means Algorithms with Geometric Reasoning. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining. ACM, 1999.
17. F. P. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, 1985.
18. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175-179, 1991.
19. W. Zheng and A. Tropsha. A Novel Variable Selection QSAR Approach based on the K-Nearest Neighbor Principle. J. Chem. Inf.Comput. Sci., 40(1):185-194, 2000.