Sparse Linear Methods with Side Information for top-N recommendations

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion

Volumn , Issue , 2012, Pages 581-582

  Ning, Xia ^a   Karypis, George ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Recommender systems; Side Information; Sparse Linear Methods

Indexed keywords

COEFFICIENT MATRIX; EFFECTIVE ALGORITHMS; LINEAR METHODS; OPTIMIZATION PROCESS; PERFORMANCE IMPROVEMENTS; SIDE INFORMATION;

RECOMMENDER SYSTEMS; WORLD WIDE WEB;

MATRIX ALGEBRA;

EID: 84861032095     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187980.2188137     Document Type: Conference Paper

References (5)

1. D. Agarwal and B.-C. Chen. Regression-based latent factor models. In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining, pages 19-28, 2009.
2. M. Deshpande and G. Karypis. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems, 22:143-177, January 2004.
3. Z. Gantner, L. Drumond, C. Freudenthaler, S. Rendle, and L. Schmidt-Thieme. Learning attribute-to-feature mappings for cold-start recommendations. IEEE International Conference on Data Mining, pages 176-185, 2010.
4. X. Ning and G. Karypis. Slim: Sparse linear methods for top-n recommender systems. In Proceedings of 11th IEEE International Conference on Data Mining, pages 497-506, 2011.
5. A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In Proceeding of the 14th ACM International Conference on Knowledge Discovery and Data Mining, pages 650-658, 2008.