Densifying one permutation hashing via rotation for fast near neighbor search

31st International Conference on Machine Learning, ICML 2014

Volumn 1, Issue , 2014, Pages 846-854

  Shrivastava, Anshumali ^a   Li, Ping ^b  

^a School of Operations Research and Information Engineering   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ENERGY UTILIZATION; HASH FUNCTIONS; QUERY LANGUAGES; QUERY PROCESSING;

ENERGY-CONSUMPTION; EXPERIMENTAL EVALUATION; HASHING TECHNIQUES; LOCALITY SENSITIVE HASHING; NEAR NEIGHBOR SEARCHES; QUERY COMPLEXITY; RETRIEVAL ACCURACY; SIMILARITY SEARCH;

LEARNING SYSTEMS;

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

References (34)

1. Agarwal, Alekh, Chapelle, Olivier, Dudik, Miroslav, and Lang ford, John. A reliable effective terascale linear learning system. Technical report, arXiv:1110.4198, 2011.
2. Andoni, Alexandr and Indyk, Piotr. E21sh: Exact euclidean local ity sensitive hashing. Technical report, 2004.
3. Bayardo, Roberto J., Ma, Yiming, and Srikant, Ramakrishnan. Scaling up all pairs similarity search. In WWW, pp. 131-140, 2007.
4. Bottou, Leon, http://leon.bottou.org/projects/sgd.
5. Broder, Andrei Z. On the resemblance and containment of docu ments. In the Compression and Complexity of Sequences, pp. 21-29, Positano, Italy, 1997.
6. Broder, Andrei Z., Glassman, Steven C, Manasse, Mark S., and Zweig, Geoffrey. Syntactic clustering of the web. In WWW, pp. 1157-1166, Santa Clara, CA, 1997.
7. Broder, Andrei Z., Charikar, Moses, Frieze, Alan M., and Mitzenmacher, Michael. Min-wise independent permutations. In STOC, pp. 327-336, Dallas, TX, 1998.
8. Carter, J. Lawrence and Wegman, Mark N. Universal classes of hash functions. In STOC, pp. 106-112, 1977.
9. Chandra, Tushar, Ie, Eugene, Goldman, Kenneth, Llinares, Tomas Lloret, McFadden, Jim, Pereira, Fernando, Redstone, Joshua, Shaked, Tal, and Singer, Yoram. Sibyl: a system for large scale machine learning.
10. Chapelle, Olivier, Haffner, Patrick, and Vapnik, Vladimir N. Sup port vector machines for histogram-based image classification. IEEE Trans. Neural Networks, 10(5):1055-1064, 1999.
11. Chien, Steve and Immorlica, Nicole. Semantic similarity between search engine queries using temporal correlation. In WWW, pp. 2-11, 2005.
12. Dasgupta, Anirban, Kumar, Ravi, and Sarlos, Tamas. Fast locality-sensitive hashing. In KDD, pp. 1073-1081, 2011.
13. Fan, Rong-En, Chang, Kai-Wei, Hsieh, Cho-Jui, Wang, Xiang-Rui, and Lin, Chih-Jen. Liblinear: A library for large linear classification. Journal of Machine Learning Research, 9:1871-1874, 2008.
14. Fetterly, Dennis, Manasse, Mark, Najork, Marc, and Wiener, Janet L. A large-scale study of the evolution of web pages. In WWW, pp. 669-678, Budapest, Hungary, 2003.
15. Friedman, Jerome H., Baskett, F, and Shustek, L. An algorithm for finding nearest neighbors. IEEE Transactions on Comput ers, 24:1000-1006, 1975.
16. Henzinger, Monika Rauch. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR, pp. 284-291, 2006.
17. Indyk, Piotr and Motwani, Rajeev. Approximate nearest neigh bors: Towards removing the curse of dimensionality. In STOC, pp. 604-613, Dallas, TX, 1998.
18. Joachims, Thorsten. Training linear svms in linear time. In KDD, pp. 217-226, Pittsburgh, PA, 2006.
19. Koudas, Nick and Srivastava, Divesh. Approximate joins: Con cepts and techniques. In VLDB, pp. 1363, 2005.
20. Li, Ping and Church, Kenneth W. A sketch algorithm for estimating two-way and multi-way associations. Computational Lin guistics (Preliminary results appeared in HLT/EMNLP 2005), 33(3):305-354, 2007.
21. Li, Ping and König, Arnd Christian, b-bit minwise hashing. In Proceedings of the 19th International Conference on World Wide Web, pp. 671-680, Raleigh, NC, 2010.
22. Li, Ping, Church, Kenneth W., and Hastie, Trevor J. Conditional random sampling: A sketch-based sampling technique for sparse data. In NIPS, pp. 873-880, Vancouver, BC, Canada, 2006.
23. Li, Ping, König, Arnd Christian, and Gui, Wenhao. b-bit minwise hashing for estimating three-way similarities. In Advances in Neural Information Processing Systems, Vancouver, BC, 2010.
24. Li, Ping, Shrivastava, Anshumali, Moore, Joshua, and König, Arnd Christian. Hashing algorithms for large-scale learning. In NIPS, Granada, Spain, 2011.
25. Li, Ping, Owen, Art B, and Zhang, Cun-Hui. One permutation hashing. In NIPS, Lake Tahoe, NV, 2012.
26. Li, Ping, Shrivastava, Anshumali, and König, Arnd Christian, bbit minwise hashing in practice. In Internetware, Changsha, China, 2013.
27. Manku, Gurmeet Singh, Jain, Arvind, and Sarma, Anish Das. De tecting Near-Duplicates for Web-Crawling. In WWW, Banff, Alberta, Canada, 2007.
28. Mitzenmacher, Michael and Vadhan, Salil. Why simple hash functions work: exploiting the entropy in a data stream. In SODA, 2008.
29. Nisan, Noam. Pseudorandom generators for space-bounded com putations. In Proceedings of the twenty-second annual ACM symposium on Theory of computing, STOC, pp. 204-212, 1990.
30. Shalev-Shwartz, Shai, Singer, Yoram, and Srebro, Nathan. Pegasos: Primal estimated sub-gradient solver for svm. In ICML, pp. 807-814, Corvalis, Oregon, 2007.
31. Shrivastava, Anshumali and Li, Ping. Fast near neighbor search in high-dimensional binary data. In ECML, 2012.
32. Shrivastava, Anshumali and Li, Ping. Beyond pairwise: Provably fast algorithms for approximate k-way similarity search. In NIPS, Lake Tahoe, NY 2013.
33. Tong, Simon. Lessons learned developing a practical large scale machine learning system. http://googleresearch.blogspot.com/2010/04/lessons-learned-developing-practical.html, 2008.
34. Weinberger, Kilian, Dasgupta, Anirban, Langford, John, Smola, Alex, and Attenberg, Josh. Feature hashing for large scale mul titask learning. In ICML, pp. 1113-1120, 2009.