Maximum inner-product search using cone trees

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 931-939

  Ram, Parikshit ^a   Gray, Alexander G ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

cone trees; dual tree branch and bound; metric trees

Indexed keywords

BEST MATCH; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; COSINE SIMILARITY; DATA SETS; DUAL-TREE ALGORITHMS; EUCLIDEAN DISTANCE; INNER PRODUCT; METRIC TREES; MULTIPLE QUERIES; ORDERS OF MAGNITUDE; QUERY TIME; SEARCH TECHNIQUE; TREE DATA STRUCTURES;

BRANCH AND BOUND METHOD; DATA MINING; DATA STRUCTURES;

ALGORITHMS;

EID: 84866036468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339677     Document Type: Conference Paper

References (32)

1. R. Bayardo, Y. Ma, and R. Srikant. Scaling Up All Pairs Similarity Search. In Proceedings of the 16th Intl. Conf. on World Wide Web, 2007.
2. R. M. Bell and Y. Koren. Lessons from the Netflix Prize Challenge. SIGKDD Explor. Newsl., 2007.
3. J. Bennett and S. Lanning. The Netflix Prize. In Proc. KDD Cup and Workshop, 2007.
4. A. Beygelzimer, S. Kakade, and J. Langford. Cover Trees for Nearest Neighbor. Proceedings of the 23rd Intl. Conf. on Machine Learning, 2006.
5. C. L. Blake and C. J. Merz. UCI Machine Learning Repository. http://archive.ics.uci.edu/ml/, 1998.
6. L. Cayton and S. Dasgupta. A Learning Framework for Nearest Neighbor Search. Advances in Neural Info. Proc. Systems 20, 2007.
7. M. S. Charikar. Similarity Estimation Techniques from Rounding Algorithms. In Proceedings of the 34th annual ACM Symp. on Theory of Comp., 2002.
8. P. Ciaccia and M. Patella. PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-dimensional and Metric spaces. Proceedings of 16th Intl. Conf. on Data Engineering, 2000.
9. K. Clarkson. Nearest-neighbor Searching and Metric Space Dimensions. Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, 2006.
10. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. In Proceedings of the 40th annual ACM Symp. on Theory of Comp., 2008.
11. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by Latent Semantic Analysis. Journal of the American Society of Info. Science, 1990.
12. G. Dror, N. Koenigstein, Y. Koren, and M. Weimer. The Yahoo! Music Dataset and KDD-Cup'11. Journal Of Machine Learning Research, 2011.
13. 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.
14. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. Proceedings of the 25th Intl. Conf. on Very Large Data Bases, 1999.
15. A. G. Gray and A. W. Moore. 'N-Body' Problems in Statistical Learning. In Advances in Neural Info. Proc. Systems 13, 2000.
16. A. G. Gray and A. W. Moore. Nonparametric Density Estimation: Toward Computational Tractability. In SIAM Data Mining, 2003.
17. GroupLens. MovieLens dataset.
18. P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the 30th annual ACM Symp. on Theory of Comp., 1998.
19. S. Kim, F. Li, G. Lebanon, and I. Essa. Beyond Sentiment: The Manifold of Human Emotions. Arxiv preprint arXiv:1202.1568, 2011.
20. M. Klaas, D. Lang, and N. de Freitas. Fast Maximum-a-posteriori Inference in Monte Carlo State Spaces. In Artificial Intelligence and Statistics, 2005.
21. Y. Koren. The BellKor solution to the Netflix Grand Prize. 2009.
22. Y. Koren, R. M. Bell, and C. Volinsky. Matrix Factorization Techniques for Recommender Systems. IEEE Computer, 2009.
23. B. Kulis and K. Grauman. Kernelized Locality-sensitive Hashing for Scalable Image Search. In IEEE 12th Intl. Conf. on Computer Vision, 2009.
24. Y. LeCun. MNist dataset, 2000. http://yann.lecun.com/exdb/mnist/.
25. Z. Li, H. Ning, L. Cao, T. Zhang, Y. Gong, and T. S. Huang. Learning to Search Efficiently in High Dimensions. In Advances in Neural Info. Proc. Systems 24. 2011.
26. T. Liu, A. W. Moore, A. G. Gray, and K. Yang. An Investigation of Practical Approximate Nearest Neighbor Algorithms. In Advances in Neural Info. Proc. Systems 17, 2005.
27. R. Lupton, J. Gunn, Z. Ivezic, G. Knapp, S. Kent, and N. Yasuda. The SDSS Imaging Pipelines. Arxiv preprint astro-ph/0101420, 2001.
28. S. M. Omohundro. Five Balltree Construction Algorithms. Technical report, International Computer Science Institute, December 1989.
29. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, 1985.
30. A. Rahimi and B. Recht. Random Features for Large-scale Kernel Machines. Advances in Neural Info. Proc. Systems 20, 2007.
31. P. Ram, D. Lee, W. March, and A. Gray. Linear-time Algorithms for Pairwise Statistical Problems. In Advances in Neural Info. Proc. Systems 22. 2009.
32. P. Ram, D. Lee, H. Ouyang, and A. G. Gray. Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions. In Advances in Neural Info. Proc. Systems 22. 2009.