Fast exact max-kernel search

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 1-9

  Curtin, Ryan R ^a   Ram, Parikshit ^a   Gray, Alexander G ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT OBJECT; FEATURE REPRESENTATION; METRIC SPACES; ORDERS OF MAGNITUDE; SEARCH PROBLEM; SIMILARITY SEARCH;

DATA MINING; PROBLEM SOLVING;

DATA MINING;

EID: 84937874334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.1     Document Type: Conference Paper

References (36)

1. C. Leslie, E. Eskin, and W. S. Noble. The Spectrum Kernel: A String Kernel for SVM Protein Classification. In Proc. of the Pacific Symp. on Biocomputing, 2002.
2. K. M. Borgwardt, C. S. Ong, S. Schönauer, S. V. N. Vishwanathan, A. J. Smola, and H. P. Kriegel. Protein Function Prediction via Graph Kernels. Bioinformatics, 2005.
3. K. Müller, A. Smola, G. Rätsch, B. Schölkopf, J. Kohlmorgen, and V. Vapnik. Predicting Time Series with Support Vector Machines. In Proc. of the International Conference on Artificial Neural Networks, 1997.
4. K. L. Clarkson. Nearest-neighbor Searching and Metric Space Dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, 2006.
5. M. Klaas, D. Lang, and N. de Freitas. Fast Maximumaposteriori Inference in Monte Carlo State Spaces. In Proc. of Artificial Intelligence and Statistics, 2005.
6. Y. Koren, R. M. Bell, and C. Volinsky. Matrix Factorization Techniques for Recommender Systems. In IEEE Computer, 2009.
7. G. Dror, N. Koenigstein, Y. Koren, and M. Weimer. The Yahoo! Music Dataset and KDD-Cup'11. In Journal Of Machine Learning Research, 2011.
8. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, D. J. Lipman, et al. Basic Local Alignment Search Tool. In Journal of Molecular Biology, 1990.
9. T. F. Smith and M. S. Waterman. Identification of Common Molecular Subsequences. In Journal of Molecular Biology, 1981.
10. A. Rahimi and B. Recht. Random Features for Largescale Kernel Machines. In Advances in Neural Information Processing Systems 20, 2007.
11. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc. of the 25th International Conf. on Very Large Data Bases, 1999.
12. M. S. Charikar. Similarity Estimation Techniques from Rounding Algorithms. In Proc. of the 34th annual ACM Symposium on Theory of Computing, 2002.
13. B. Kulis and K. Grauman. Kernelized Localitysensitive Hashing for Scalable Image Search. In IEEE 12th International Conf. on Computer Vision, 2009.
14. P. Ram and A. G. Gray. Maximum Inner-Product Search Using Cone Trees. In SIGKDD International Conf. on Knowledge Discovery and Data Mining, 2012.
15. D. R. Karger and M. Ruhl. Finding Nearest Neighbors in Growth-Restricted Metrics. In Proc. of ACM Symposium on Theory of Computing, 2002.
16. A. Beygelzimer, S. Kakade, and J. C. Langford. Cover Trees for Nearest Neighbor. In Proc. of the International Conf. on Machine Learning, 2006.
17. S. Dasgupta and Y. Freund. Random Projection Trees and Low Dimensional Manifolds. In Proc. of ACM Symposium on Theory of Computing, 2008.
18. P. Ciaccia and M. Patella. PAC Nearest Neighbor Queries: Approximate and Controlled Search in Highdimensional and Metric spaces. In Proc. of 16th International Conf. on Data Engineering, 2000.
19. 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. Processing Systems 22, 2009.
20. P. Ram, D. Lee, and A. G. Gray. Nearest-neighbor Search on a Time Budget via Max-Margin Trees. In SIAM International Conf. on Data Mining, 2012.
21. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. in Math. Software, 1977.
22. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer, 1985.
23. J. McNames. A Fast Nearest-Neighbor Algorithm based on a Principal Axis Search Tree. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2001.
24. A. W. Moore. The Anchors Hierarchy: Using the triangle inequality to survive high dimensional data. In Proc. of Uncertainty in Artificial Intelligence, 2000.
25. P. Ram, D. Lee, W. B. March, and A. G. Gray. Lineartime Algorithms for Pairwise Statistical Problems. In Advances in Neural Info. Processing Systems 22, 2009.
26. A. Beygelzimer, S. Kakade, and J. C. Langford. Cover Trees for Nearest Neighbor. (paper URL).
27. R. R. Curtin, J. R. Cline, N. P. Slagle, M. L. Amidon, and A. G. Gray. MLPACK: A Scalable C++ Machine Learning Library. In BigLearning: Algorithms, Systems, and Tools for Learning at Scale, 2011.
28. Y. LeCun. MNist dataset, 2000. http://yann.lecun.com/exdb/mnist/.
29. C. L. Blake and C. J. Merz. UCI Machine Learning Repository, 1998. http://archive.ics.uci.edu/ml/.
30. J. Bennett and S. Lanning. The Netflix Prize. In Proc. KDD Cup and Workshop, 2007.
31. R. Lupton, J. E. Gunn, Z. Ivezic, G. R. Knapp, S. Kent, and N. Yasuda. The SDSS Imaging Pipelines. Arxiv preprint astro-ph/0101420, 2001.
32. S. Kim, F. Li, G. Lebanon, and I. Essa. Beyond Sentiment: The Manifold of Human Emotions. Arxiv preprint arXiv:1202.1568, 2011.
33. A. Torralba, R. Fergus, and W. T. Freeman. 80 Million Tiny Images: A large data set for nonparametric object and scene recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2008.
34. L. Cayton. Accelerating nearest neighbor search on manycore systems. In IEEE International Parallel & Distributed Processing Symposium, 2012.
35. D. Lee, R. Vuduc, and A. G. Gray. A distributed kernel summation framework for general-dimension machine learning. In SIAM Intl. Conf. on Data Mining, 2012.
36. R. R. Curtin, P. Ram, and A. G. Gray. Fast Exact Max-Kernel Search: Supplementary Material. http://www.cc.gatech.edu/~pram/pubs/fmks-apx.pdf.