An investigation of practical approximate nearest neighbor algorithms

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages

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

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; IMAGE RETRIEVAL;

APPROXIMATE NEAREST NEIGHBOR; EMPIRICAL EVALUATIONS; HIGH DIMENSIONAL DATASETS; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBORS; PROXIMITY QUERIES; SIMPLER ALGORITHMS; SPATIAL DATA STRUCTURE;

ALGORITHMS;

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

References (30)

1. http://kdd.ics.uci.edu/databases/CorelFeatures/CorelFeatures.data.html.
2. http://www.autonlab.org/autonweb/showsoftware/154/.
3. 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.
4. Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft. When is "nearest neighbor" meaningful? Lecture Notes in Computer Science, 1540:217-235, 1999.
5. 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.
6. K. Clarkson. Nearest Neighbor Searching in Metric Spaces: Experimental Results for sb(S)., 2002.
7. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
8. 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.
9. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc 25th VLDB Conference, 1999.
10. J. Goldstein and R. Ramakrishnan. Constrast Polots and P-Sphere Trees: Speace vs. Time in Nearest Neighbor Searches. In Proc. 26th VLDB conference, 2000.
11. 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.
12. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604-613, 1998.
13. Piotr Indyk. High Dimensional Computational Geometry. PhD. Thesis, 2000.
14. Piotr Indyk. On approximate nearest neighbors under l∞norm. J. Comput. Syst. sci., 63(4), 2001.
15. W. Johnson and J. Lindenstrauss. Extensions of lipschitz maps into a hilbert space. Contemp. Math., 26:189-206, 1984.
16. Norio Katayama and Shin'ichi Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. pages 369-380, 1997.
17. J. Kleinberg. Two Algorithms for Nearest Neighbor Search in High Dimension. In Proceedings of the Twenty-ninth Annual ACM Symposium on the Theory of Computing, pages 599-608, 1997.
18. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient Search for Approximate Nearest Neighbors in High Dimensional Spaces. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998.
19. T. Liu, A. W. Moore, A. Gray, and Ke Yang. An investigation of practical approximate nearest neighbor algorithms (full version). Manuscript in preparation.
20. B. S. Manjunath. Airphoto dataset, http://vivaldi.ece.ucsb.edu/Manjunath/ research.htm.
21. B. S. Manjunath and W. Y. Ma. Texture features for browsing and retrieval of large image data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(8):837-842, 1996.
22. 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.
23. G. Mori, S. Belongie, and J. Malik. Shape contexts enable efficient retrieval of similar shapes. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2001.
24. S. M. Omohundro. Efficient Algorithms with Neural Network Behaviour. Journal of Complex Systems, 1(2):273-347, 1987.
25. 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.
26. F. P. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, 1985.
27. Y. Rubnet, C. Tomasi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000.
28. Gregory Shakhnarovich, Paul Viola, and Trevor Darrell. Fast pose estimation with parameter sensitive hashing. In Proceedings of the International Conference on Computer Vision, 2003.
29. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40:175-179, 1991.
30. P. Yianilos. Excluded middle vantage point forests for nearest neighbor search. In DIMACS Implementation Challenge, 1999.