skip to main content
10.1145/3289430.3289454acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbdiotConference Proceedingsconference-collections
research-article

IncRMF: An Incremental Recommendation Algorithm Based on Regularized Matrix Factorization

Authors Info & Claims
Published:24 October 2018Publication History

ABSTRACT

The rating prediction algorithm based on matrix factorization is one of the research hotspots. When the training data is increased, all data needs to be retrained to improve recommendation results with new changes. When the data is large, the cost of calculation and time will be higher. This paper proposed an incremental recommendation algorithm based on regularized matrix factorization (IncRMF), the algorithm deals with new users and items ratings incrementally, get the updated data of training and ratings prediction by optimizing the previous result, and significantly reduce the amount of calculation in the process of training. Theoretical analysis and experimental results show that this method can guarantee the accuracy of prediction results (the difference of prediction error between IncRMF and normal regularized matrix factorization method not more than 1.36%), while the amount of calculation is significantly reduced.

References

  1. Bokde, D., Girase, S., Mukhopadhyay, D. 2015. Matrix Factorization Model in Collaborative Filtering Algorithms: A Survey {J}. Procedia Computer Science, 49(1):136--146.Google ScholarGoogle ScholarCross RefCross Ref
  2. Koren, Y., Bell, R., Volinsky, C. 2009. Matrix Factorization Techniques for Recommender Systems{J}. Computer, 42(8):30--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Papagelis, M., Rousidis, I., Plexousakis, D. et al. 2005:5. Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms{C}// International Symposium on Methodologies for Intelligent Systems. Springer Berlin Heidelberg. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Yang, X., Zhang, Z., Wang, K. 2012. Scalable collaborative filtering using incremental update and local link prediction{C}// ACM, 2371--2374. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Sarwar, B., Konstan, J., Riedl, J. 2002. Incremental singular value decomposition algorithms for highly scalable recommender systems{C}. In Fifth International Conference on Computer and Information Science, pages 27--28. Citeseer.Google ScholarGoogle Scholar
  6. Takács, G., Pilászy, I., Németh, B., and Tikk, D. 2009. Scalable collaborative filtering approaches for large recommender systems{J}. The Journal of Machine Learning Research, 10:623--656. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Rendle, S., Schmidt-Thieme, L. 2008. Online-updating regularized kernel matrix factorization models for large-scale recommender systems{C}// ACM Conference on Recommender Systems. ACM, 251--258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Luo, X., Zhou, M. C., Leung, H. et al. 2016. An Incremental-and-Static-Combined Scheme for Matrix-Factorization-Based Collaborative Filtering{J}. IEEE Transactions on Automation Science & Engineering, 13(1):333--343.Google ScholarGoogle ScholarCross RefCross Ref
  9. Song, Q., Cheng, J., Lu, H. 2015. Incremental Matrix Factorization via Feature Space Re-learning for Recommender System{C}// The, ACM Conference.277--280. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. IncRMF: An Incremental Recommendation Algorithm Based on Regularized Matrix Factorization

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      BDIOT '18: Proceedings of the 2018 2nd International Conference on Big Data and Internet of Things
      October 2018
      217 pages
      ISBN:9781450365192
      DOI:10.1145/3289430

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 October 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate75of136submissions,55%
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader