Learning binary codes for collaborative filtering

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

Volumn , Issue , 2012, Pages 498-506

  Zhou, Ke ^a   Zha, Hongyuan ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

collaborative filtering; discrete optimization; learning binary codes; recommender systems; relaxed solutions

Indexed keywords

COLLABORATIVE FILTERING; DATA SETS; DISCRETE OPTIMIZATION; DISCRETE OPTIMIZATION PROBLEMS; LOSS FUNCTIONS; OPTIMIZATION PROBLEMS; PUBLIC DOMAINS; TIME COMPLEXITY;

DATA MINING; HAMMING DISTANCE; OPTIMIZATION; RECOMMENDER SYSTEMS;

BINARY CODES;

EID: 84866013626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339611     Document Type: Conference Paper

References (25)

1. G. Adomavicius and a. Tuzhilin. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering, 17(6):734-749, June 2005.
2. D. Agarwal, B. Chen, and P. Elango. Fast online learning through offline initialization for time-sensitive recommendation. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 703-712. ACM, 2010.
3. Y. Bachrach and R. Herbrich. Fingerprinting Ratings For Collaborative Filtering Theoretical and Empirical Analysis. String Processing and Information Retrieval, pages 25-36, 2010.
4. Y. Bachrach, E. Porat, and J. Rosenschein. Sketching techniques for collaborative filtering. In Proceedings of the 21st international joint conference on Artifical intelligence, pages 2016-2021. Morgan Kaufmann Publishers Inc., 2009.
5. A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of the 16th international conference on World Wide Web - WWW '07, page 271, New York, New York, USA, 2007. ACM Press.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry - SCG '04, page 253, New York, New York, USA, 2004. ACM Press.
7. J. He and W. Liu. Scalable similarity search with optimized kernel hashing. Proceedings of the 16th ACM SIGKDD, pages 1129-1138, 2010.
8. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, pages 604-613, New York, New York, USA, 1998. ACM Press.
9. H. Jégou, T. Furon, and J.-J. Fuchs. Anti-sparse coding for approximate nearest neighbor search. Arxiv preprint arXiv:1110.3767, (October):577-580, Oct. 2011.
10. J. Kekäläinen. Binary and graded relevance in IR evaluations - Comparison of the effects on ranking of IR systems. Information Processing and Management, 41:1019-1033, 2005.
11. Y. Koren. Factor in the neighbors: Scalable and accurate collaborative filtering. ACM Transactions on Knowledge Discovery from Data (TKDD), 4(1):1-24, 2010.
12. B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. Proceedings of Advances in Neural Information Processing Systems, 2009.
13. W. Liu, J. Wang, S. Kumar, and S. Chang. Hashing with Graphs. In Proceedings of the 28th International Conference on Machine Learning, 2011.
14. M. Norouzi and D. Fleet. Minimal Loss Hashing for Compact Binary Codes. In Proceedings of the 28th International Conference on Machine Learning, volume 1, 2011.
15. A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In Proceedings of KDD Cup and Workshop, volume 2007, pages 5-8. Citeseer, 2007.
16. S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme. Factorizing personalized Markov chains for next-basket recommendation. Proceedings of the 19th international conference on World wide web - WWW '10, page 811, 2010.
17. R. Salakhutdinov and G. Hinton. Semantic hashing. International Journal of Approximate Reasoning, 50(7):969-978, July 2009.
18. G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In Proceedings Ninth IEEE International Conference on Computer Vision, pages 750-757 vol.2. IEEE, 2003.
19. X. Su and T. M. Khoshgoftaar. A Survey of Collaborative Filtering Techniques. Advances in Artificial Intelligence, 2009(Section 3):1-20, 2009.
20. J. Wang and S. Kumar. Sequential projection learning for hashing with compact codes. International Conference on Machine Learning, 2010.
21. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Neural Information Processing Systems, number 1, pages 1-8, 2008.
22. S. X. Yu and J. Shi. Multiclass spectral clustering. In Proceedings Ninth IEEE International Conference on Computer Vision, number 0, pages 313-319 vol.1, Washington, DC, USA, 2003. IEEE.
23. D. Zhang, J. Wang, D. Cai, and J. Lu. Laplacian co-hashing of terms and documents. Advances in Information Retrieval, pages 577-580, 2010.
24. D. Zhang, J. Wang, D. Cai, and J. Lu. Self-taught hashing for fast similarity search. In Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval, pages 18-25. ACM, 2010.
25. C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Transactions on Mathematical Software, 23(4):550-560, Dec. 1997.