Improving maximum margin matrix factorization

Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful learning approach to this task and has been recently extended to structured ranking losses. In this paper we discuss a number of extensions to MMMF by introducing offset terms, item dependent regularization and a graph kernel on the recommender graph. We show equivalence between graph kernels and the recent MMMF extensions by Mnih and Salakhutdinov [1]. Experimental evaluation of the introduced extensions show improved performance over the original MMMF formulation.

• Type: Journal
• Year: 2008
• Where: ML
• Authors: Markus Weimer, Alexandros Karatzoglou, Alex J. Smola
• Keywords: Graph Kernels, Machine Learning, Margin Matrix Factorization, ML 2008, Popular Method