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 (Advances in Neural Information Processing Systems 20, 2008). Experimental evaluation of the introduced extensions show improved performance over the original MMMF formulation.
Article PDF
Similar content being viewed by others
References
Basilico, J., & Hofmann, T. (2004). Unifying collaborative and content-based filtering. In Proceedings of the international conference on machine learning (pp. 65–72). New York: ACM Press.
Chu, W., & Ghahramani, Z. (2005). Gaussian processes for ordinal regression. Journal of Machine Learning Research, 6, 1019–1041.
Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In A. J. Smola, P. L. Bartlett, B. Schölkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp. 115–132). Cambridge: MIT Press.
Hoffman, T. (2004). Latent semantic models for collaborative filtering. ACM Transactions on Information Systems (TOIS), 22(1), 89–115.
Joachims, T. (2006). Training linear SVMs in linear time. In Proceedings of the ACM conference on knowledge discovery and data mining (KDD). New York: ACM.
Rennie, J., & Srebro, N. (2005). Fast maximum margin matrix factoriazation for collaborative prediction. In Proceedings of the international conference on machine learning.
Salakhutdinov, R., & Mnih, A. (2008). Probabilistic matrix factorization. In Advances in neural information processing systems 20. Cambridge: MIT Press.
Smola, A. J., & Kondor, I. R. (2003). Kernels and regularization on graphs. In B. Schölkopf & M. K. Warmuth (Eds.), Lecture notes in computer science Proceedings of the annual conference on computational learning theory (pp. 144–158). Heidelberg: Springer.
Smola, A., Vishwanathan, S., & Le, Q. (2008). Bundle methods for machine learning. In Advances in neural information processing systems 20. Cambridge: MIT Press.
Srebro, N., & Jaakkola, T. (2003). Weighted low-rank approximations. In Proceedings of the 20th international conference on machine learning (ICML 2003) (pp. 720–727). Menlo Park: AAAI Press.
Srebro, N., & Shraibman, A. (2005). Rank, trace-norm and max-norm. In P. Auer & R. Meir (Eds.), Lecture notes in artificial intelligence : Vol. 3559. Proceedings of the annual conference on computational learning theory (pp. 545–560). June 2005. Berlin: Springer.
Srebro, N., Rennie, J., & Jaakkola, T. (2005). Maximum-margin matrix factorization. In L. K. Saul, Y. Weiss, & L. Bottou (Eds.), Advances in neural information processing systems 17. MIT Press: Cambridge.
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2007). Major components of the gravity recommendation system. SIGKDD Explorations Newsletter, 9(2), 80–83.
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altun, Y. (2005). Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6, 1453–1484.
Weimer, M., Karatzoglou, A., Le, Q., & Smola, A. (2008). Cofi rank—maximum margin matrix factorization for collaborative ranking. In Advances in neural information processing systems 20. Cambridge: MIT Press.
Yu, S., Yu, K., Tresp, V., & Kriegel, H. P. (2006). Collaborative ordinal regression. In W. Cohen & A. Moore (Eds.), Proceedings of the international conference on machine learning (pp. 1089–1096). New York: ACM.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editors: Walter Daelemans, Bart Goethals, Katharina Morik.
Rights and permissions
About this article
Cite this article
Weimer, M., Karatzoglou, A. & Smola, A. Improving maximum margin matrix factorization. Mach Learn 72, 263–276 (2008). https://doi.org/10.1007/s10994-008-5073-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10994-008-5073-7