Skip to main content

AdaMF:Adaptive Boosting Matrix Factorization for Recommender System

  • Conference paper
Book cover Web-Age Information Management (WAIM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8485))

Included in the following conference series:

Abstract

Matrix Factorization (MF) is one of the most popular approaches for recommender systems. Existing MF-based recommendation approaches mainly focus on the prediction of the users’ ratings on unknown items. The performance is usually evaluated by the metric Root Mean Square Error (RMSE). However, achieving good performances in terms of RMSE does not guarantee a good performance in the top-N recommendation. Therefore, we advocate that treating the recommendation as a ranking problem. In this study, we present a ranking-oriented recommender algorithm AdaMF, which combines the MF model with AdaRank. Specifically, we propose an algorithm by adaptively combining component MF recommenders with boosting methods. The combination shows superiority in both ranking accuracy and model generalization. Normalized Discounted Cumulative Gain (NDCG) is chosen as the parameter of the coefficient function for each MF recommenders. In addition, we compare the proposed approach with the traditional MF approach and the state-of-the-art recommendation algorithms. The experimental results confirm that our proposed approach outperforms the state-of-the-art approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)

    Article  Google Scholar 

  2. Cremonesi, P., Koren, Y., Turrin, R.: Performance of recommender algorithms on top-n recommendation tasks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys 2010, pp. 39–46. ACM, New York (2010)

    Chapter  Google Scholar 

  3. Liu, T.Y.: Learning to rank for information retrieval. Found. Trends Inf. Retr. 3(3), 225–331 (2009)

    Article  Google Scholar 

  4. Balakrishnan, S., Chopra, S.: Collaborative ranking. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM 2012, pp. 143–152. ACM, New York (2012)

    Google Scholar 

  5. Shi, Y., Larson, M., Hanjalic, A.: List-wise learning to rank with matrix factorization for collaborative filtering. In: Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys 2010, pp. 269–272. ACM, New York (2010)

    Chapter  Google Scholar 

  6. Xu, J., Li, H.: Adarank: a boosting algorithm for information retrieval. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2007, pp. 391–398. ACM, New York (2007)

    Google Scholar 

  7. Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, pp. 426–434. ACM, New York (2008)

    Google Scholar 

  8. Koren, Y.: Collaborative filtering with temporal dynamics. Commun. ACM 53(4), 89–97 (2010)

    Article  Google Scholar 

  9. Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: NIPS (2007)

    Google Scholar 

  10. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)

    MATH  Google Scholar 

  11. Agarwal, D., Chen, B.C.: flda: matrix factorization through latent dirichlet allocation. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, WSDM 2010, pp. 91–100. ACM, New York (2010)

    Google Scholar 

  12. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. MIT Press, Cambridge (2000)

    Google Scholar 

  13. Chapelle, O., Wu, M.: Gradient descent optimization of smoothed information retrieval metrics. Inf. Retr. 13(3), 216–235 (2010)

    Article  Google Scholar 

  14. Järvelin, K., Kekäläinen, J.: Ir evaluation methods for retrieving highly relevant documents. In: Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2000, pp. 41–48. ACM, New York (2000)

    Chapter  Google Scholar 

  15. Li, X., Wang, L., Sung, E.: AdaBoost with SVM-based component classifiers. Engineering Applications of Artificial Intelligence 21(5) (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, Y., Sun, H., Zhang, R. (2014). AdaMF:Adaptive Boosting Matrix Factorization for Recommender System. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08010-9_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08009-3

  • Online ISBN: 978-3-319-08010-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics