Skip to main content

Markov Random Walk vs. Higher-Order Factorization Machines: A Comparison of State-of-the-Art Recommender Algorithms

  • Conference paper
  • First Online:
Innovations for Community Services (I4CS 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 717))

Included in the following conference series:

Abstract

World-wide research on recommender systems has resulted in great, highly effective algorithms based on a large variety of different concepts. Two of these promising recommender approaches are the Markov Random Walk and (higher-order) Factorization Machines. Unfortunately, due to the substantial effort for optimizing hyperparameters, most articles that describe new recommender approaches do not compare the obtained results with other state-of-the-art approaches in the recommender domain.

This paper demonstrates how different state-of-the-art recommender algorithms can be compared in a consistent manner. Furthermore, we investigate under which circumstances Factorization Machines should be preferred and in which situations Markov Random Walk is the most striking algorithm. In addition, we include the restart concept into a Markov Random Walk with an optimized walk length and show how the number of factors of each order in a higher-order Factorization Machine can be optimized.

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 EPUB and 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

References

  1. Aggarwal, C.C.: Recommender Systems. Springer, Cham (2016)

    Book  Google Scholar 

  2. Alhamid, M.F.: Towards context-aware personalized recommendations in an ambient intelligence environment. Ph.D. thesis, University of Ottawa (2015)

    Google Scholar 

  3. Blondel, M., Fujino, A., Ueda, N., Ishihata, M.: Higher-order factorization machines. In: Proceedings of the Conference Neural Information Processing Systems 2016 (2016)

    Google Scholar 

  4. Clements, M., Vries, A.P.D., Reinders, M.J.T.: Optimizing single term queries using a personalized Markov random walk over the social graph. In: Workshop on Exploiting Semantic Annotations in Information Retrieval (2008)

    Google Scholar 

  5. Clements, M., Vries, A.P.D., Reinders, M.J.T.: The task-dependent effect of tags and ratings on social media access. ACM Trans. Inf. Syst. (TOIS) 28, 1–42 (2010)

    Article  Google Scholar 

  6. Fouss, F., Saerens, M., Shimbo, M.: Algorithms and models for network data and link analysis. Cambridge University Press, Cambridge (2016)

    Book  Google Scholar 

  7. Grottke, M., Knoll, J., Groß, R.: How the distribution of the number of items rated per user influences the quality of recommendations. In: Proceedings of the 15th International Conference on Innovations for Community Services, pp. 1–8 (2015)

    Google Scholar 

  8. Hotho, A., Jäschke, R., Schmitz, C., Stumme, G.: Information retrieval in folksonomies: search and ranking. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 411–426. Springer, Heidelberg (2006). doi:10.1007/11762256_31

    Chapter  Google Scholar 

  9. Ibe, O.: Markov Processes for Stochastic Modeling, 2 edn. Newnes (2013)

    Google Scholar 

  10. Knoll, J.: Recommending with higher-order factorization machines. In: Bramer, M., Petridis, M. (eds.) Research and Development in Intelligent Systems XXXIII. Springer, Cham (2016)

    Google Scholar 

  11. Konstas, I., Stathopoulos, V., Jose, J.M.: On social networks and collaborative recommendation. In: Proceedings of the 32th International ACM SIGIR Conference on Research and Development in Information Retrieval (2009)

    Google Scholar 

  12. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. In: Proceedings of the 7th International World Wide Web Conference, pp. 161–172 (1998)

    Google Scholar 

  13. Rendle, S.: Factorization machines. In: Proceedings of the 10th International Conference on Data Mining, pp. 995–1000 (2010)

    Google Scholar 

  14. Rendle, S.: Factorization machines with libFM. ACM Trans. Intell. Syst. Technol. 3, 1–22 (2012)

    Article  Google Scholar 

  15. Rendle, S., Schmidt-Thieme, L.: Pairwise interaction tensor factorization for personalized tag recommendation. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, pp. 81–90 (2010)

    Google Scholar 

  16. Shi, Y., Larson, M., Hanjalic, A.: Collaborative filtering beyond the user-item matrix: a survey of the state of the art and future challenges. ACM Comput. Surv. 47, 1–45 (2014)

    Article  Google Scholar 

  17. Su, X., Khoshgoftaar, T.: A survey of collaborative filtering. Adv. Artif. Intell. 10, 1–19 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Julian Knoll .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Knoll, J., Köckritz, D., Groß, R. (2017). Markov Random Walk vs. Higher-Order Factorization Machines: A Comparison of State-of-the-Art Recommender Algorithms. In: Eichler, G., Erfurth, C., Fahrnberger, G. (eds) Innovations for Community Services. I4CS 2017. Communications in Computer and Information Science, vol 717. Springer, Cham. https://doi.org/10.1007/978-3-319-60447-3_7

Download citation

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

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60446-6

  • Online ISBN: 978-3-319-60447-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics