Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces

RecSys 2014 - Proceedings of the 8th ACM Conference on Recommender Systems

Volumn , Issue , 2014, Pages 257-264

  Bachrach, Yoram ^a   Finkelstein, Yehuda ^a   Gilad Bachrach, Ran ^a   Katzir, Liran ^b   Koenigstein, Noam ^a   Nice, Nir ^a   Paquet, Ulrich ^a  

^a MICROSOFT RESEARCH   (United States)

^b Engineering   (United States)

Author keywords

Fast retrieval; Inner product search; Matrix factorization; Recommender systems

Indexed keywords

COLLABORATIVE FILTERING; DATA STRUCTURES; DIMENSIONALITY REDUCTION; FACTORIZATION; HAMMING DISTANCE; LARGE DATASET; MATRIX ALGEBRA; METADATA; ONLINE SYSTEMS; REAL TIME SYSTEMS; RECOMMENDER SYSTEMS; TREES (MATHEMATICS);

EUCLIDEAN TRANSFORMATIONS; FAST RETRIEVALS; INNER PRODUCT; MATRIX FACTORIZATIONS; ONLINE RECOMMENDER SYSTEMS; ORDER-PRESERVING TRANSFORMATION; RESPONSE-TIME CONSTRAINT; TREE DATA STRUCTURES;

NEAREST NEIGHBOR SEARCH;

EID: 84908888240     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2645710.2645741     Document Type: Conference Paper

References (21)

1. Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, pages 459-468, 2006.
2. Robert M. Bell and Yehuda Koren. Lessons from the netflix prize challenge. SIGKDD Explor. Newsl., 2007.
3. Jon Louis Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, September 1975.
4. Andrei Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences 1997, pages 21-29, 1997.
5. Moses S. Charikar. Similarity estimation techniques from rounding algorithms. In Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, pages 380-388, 2002.
6. Sanjoy Dasgupta and Yoav Freund. Random projection trees and low dimensional manifolds. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pages 537-546, 2008.
7. Gideon Dror, Noam Koenigstein, and Yehuda Koren. Yahoo! music recommendations: Modeling music ratings with temporal dynamics and item taxonomy. In Proc. 5th ACM Conference on Recommender Systems, 2011.
8. Gideon Dror, Noam Koenigstein, Yehuda Koren, and Markus Weimer. The Yahoo! music dataset and KDD-Cup'11. Journal Of Machine Learning Research, 17:1-12, 2011.
9. Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 604-613, 1998.
10. Mohammad Khoshneshin and W. Nick Street. Collaborative filtering via euclidean embedding. In Proceedings of the fourth ACM conference on Recommender systems, 2010.
11. Noam Koenigstein and Yehuda Koren. Towards scalable and accurate item-oriented recommendations. In Proc. 7th ACM Conference on Recommender Systems, 2013.
12. Noam Koenigstein and Ulrich Paquet. Xbox movies recommendations: Variational Bayes matrix factorization with embedded feature selection. In Proc. 7th ACM Conference on Recommender Systems, 2013.
13. Noam Koenigstein, Parikshit Ram, and Yuval Shavitt. Efficient retrieval of recommendations in a matrix factorization framework. In CIKM, 2012.
14. Yehuda Koren, Robert M. Bell, and Chris Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 2009.
15. James McNames. A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans. Pattern Anal. Mach. Intell., 23(9):964-976, September 2001.
16. Ulrich Paquet and Noam Koenigstein. One-class collaborative filtering with random graphs. In Proceedings of the 22nd international conference on World Wide Web, WWW '13, pages 999-1008, 2013.
17. Franco P. Preparata and Michael I. Shamos. Computational Geometry: An Introduction. Springer, 1985.
18. Parikshit Ram and Alexander Gray. Maximum inner-product search using cone trees. In SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2012.
19. Parikshit Ram and Alexander G. Gray. Which space partitioning tree to use for search? In Christopher J. C. Burges, Léon Bottou, Zoubin Ghahramani, and Kilian Q. Weinberger, editors, NIPS, pages 656-664, 2013.
20. Parikshit Ram, Dongryeol Lee, and Alexander G. Gray. Nearest-neighbor search on a time budget via max-margin trees. In SDM, pages 1011-1022. SIAM/Omnipress, 2012.
21. Robert F. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6(4):579-589, 1991.