Nearest-neighbor search on a time budget via max-margin trees

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 1011-1022

  Ram, Parikshit ^a   Lee, Dongryeol ^b   Gray, Alexander G ^b  

^a Georgia Institute of Technology   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; DATA MINING; DATA STRUCTURES; QUERY PROCESSING; TREES (MATHEMATICS);

FAST QUERY; HIGH-DIMENSIONAL; MULTI-DIMENSIONAL TREES; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBORS; STATE OF THE ART; TIME BUDGET; TREE SEARCH;

NEAREST NEIGHBOR SEARCH;

EID: 84880249015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.87     Document Type: Conference Paper

References (30)

1. J. H. Freidman, J. L. Bentley, and R. A. Finkel. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. Math. Softw., 1977.
2. S. M. Omohundro. Five Balltree Construction Al- gorithms. Technical Report TR-89-063, International Computer Science Institute, December 1989.
3. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, 1985.
4. J. M. Hammersley. The Distribution of Distance in a Hypersphere. Annals of Mathematical Statistics, 21, 1950.
5. T. Liu, A. W. Moore, A. G. Gray, and K. Yang. An Investigation of Practical Approximate Nearest Neighbor Algorithms. 2005.
6. L. Cayton. Fast Nearest Neighbor Retrieval for Breg- man Divergences. Proceedings of the 25th international conference on Machine learning, 2008.
7. T. Liu, A. W. Moore, and A. G. Gray. Efficient Exact k-NN and Nonparametric Classification in High Dimensions. 2004.
8. W.B. Johnson and J. Lindenstrauss. Extensions of lipschitz mappings into a hilbert space. Contemporary mathematics, 26(189-206):1-1, 1984.
9. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. pages 518-529, 1999.
10. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimen- sionality. In STOC, pages 604-613, 1998.
11. P. Ram, D. Lee, H. Ouyang, and A. Gray. Rank- Approximate nearest neighbor search: Retaining mean- ing and speed in high dimensions. In Advances in Neu- ral Information Processing Systems 22. 2009.
12. S. Maneewongvatana and D.M. Mount. Analysis of approximate nearest neighbor searching with clustered point sets. Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implemen- Tation challenges: papers related to the DIMACS chal- lenge on dictionaries and priority queues (1995-1996) and the DIMACS challenge on near neighbor searches (1998-1999), 2002.
13. N. Verma, S. Kpotufe, and S. Dasgupta. Which spatial partition trees are adaptive to intrinsic dimension? In Proceedings of the Twenty-Fifth Conference on Uncer- Tainty in Artificial Intelligence, 2009.
14. J. McNames. A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 964- 976, 2001.
15. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. In Proceedings of the 40th annual ACM symposium on Theory of computing, 2008.
16. L. Cayton and S. Dasgupta. A learning framework for nearest neighbor search. Advances in Neural Informa- Tion Processing Systems, 20, 2007.
17. K.L. Clarkson. Nearest neighbor queries in metric spaces. Discrete and Computational Geometry, 1999.
18. C. L. Blake and C. J. Merz. UCI Machine Learning Repository. http://archive.ics.uci.edu/ml/1998.
19. Y. LeCun. MNist dataset, 2000. http://yann.lecun.com/exdb/mnist/.
20. S. Boucheron, O. Bousquet, and G. Lugosi. Theory of classification: A survey of some recent advances. ESAIM Probability and statistics, 9:323-375, 2005.
21. S. Maneewongvatana and D. Mount. The analysis of a probabilistic approach to nearest neighbor searching. Algorithms and Data Structures, 2001.
22. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans. Maximum margin clustering. Advances in neural in- formation processing systems, 17, 2005.
23. H. Valizadegan and R. Jin. Generalized maximum margin clustering and unsupervised kernel learning. Advances in Neural Information Processing Systems, 19, 2007.
24. K. Zhang, I.W. Tsang, and J.T. Kwok. Maximum margin clustering made practical. In Proceedings of the 24th international conference on Machine learning, 2007.
25. B. Zhao, F. Wang, and C. Zhang. Efficient maximum margin clustering via cutting plane algorithm. In The 8th SIAM International Conference on Data Mining, 2008.
26. Y. Hu, J. Wang, N. Yu, and X.S. Hua. Maximum margin clustering with pairwise constraints. In Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on, 2008.
27. Y.F. Li, I.W. Tsang, J.T. Kwok, and Z.H. Zhou. Tighter and convex maximum margin clustering. In Proceeding of the 12th International Conference on Artificial Intelligence and Statistics, Clearwater Beach, FL, 2009.
28. F. Wang, B. Zhao, and C. Zhang. Linear time maximum margin clustering. Neural Networks, IEEE Transactions on, 21(2):319-332, 2010.
29. Y. Freund, S. Dasgupta, M. Kabra, and N. Verma. Learning the structure of manifolds using random pro- jections. Advances in Neural Information Processing Systems, 2007.
30. J. B. Tenenbaum, V. Silva, and J.C. Langford. A Global Geometric Framework for Nonlinear Dimen- sionality Reduction. Science, 2000.