Skip to main content
SpringerLink
Log in

Bounded matrix factorization for recommender system

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Matrix factorization has been widely utilized as a latent factor model for solving the recommender system problem using collaborative filtering. For a recommender system, all the ratings in the rating matrix are bounded within a pre-determined range. In this paper, we propose a new improved matrix factorization approach for such a rating matrix, called Bounded Matrix Factorization (BMF), which imposes a lower and an upper bound on every estimated missing element of the rating matrix. We present an efficient algorithm to solve BMF based on the block coordinate descent method. We show that our algorithm is scalable for large matrices with missing elements on multicore systems with low memory. We present substantial experimental results illustrating that the proposed method outperforms the state of the art algorithms for recommender system such as stochastic gradient descent, alternating least squares with regularization, SVD++ and Bias-SVD on real-world datasets such as Jester, Movielens, Book crossing, Online dating and Netflix.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. Throughout this paper, we might use rows and users, columns and items, reduced rank and hidden latent features, values and ratings, low-rank factors and user/item-feature matrix, interchangeably and appropriately chosen for better understanding of the idea.

  2. In our notation, if the inequality is between a vector/matrix and a scalar, every element in the vector/matrix should satisfy the inequality against the scalar.

References

  1. Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont

    MATH  Google Scholar 

  2. Brozovsky L, Petricek V (2007) Recommender system for online dating service. In: Proceedings of conference Znalosti 2007, Ostrava, VSB

  3. Cichocki A, Anh-Huy P (2009) Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans Fundam Electron Commun Comput Sci E92-A:708–721

  4. Cichocki A, Zdunek R, Amari S (2007) Hierarchical als algorithms for nonnegative matrix and 3d tensor factorization. Lect Notes Comput Sci 4666:169–176

    Google Scholar 

  5. Deerwester S, Dumais ST, Furnas GW, Landauer TK, Harshman R (1990) Indexing by latent semantic analysis. J Am Soc Inf Sci 41:391–407

    Article  Google Scholar 

  6. Funk S (2006) Stochastic gradient descent. http://sifter.org/simon/journal/20061211.html [online; accessed 6-June-2012]

  7. Goldberg K (2003) Jester collaborative filtering dataset. http://goldberg.berkeley.edu/jester-data/, [Online; accessed 6-June-2012]

  8. Golub GH, Van Loan CF (1996) Matrix computations, 3rd edition. The Johns Hopkins University Press, Baltimore

  9. Grippo L, Sciandrone M (2000) On the convergence of the block nonlinear gauss-seidel method under convex constraints. Oper Res Lett 26(3):127–136

    MATH  MathSciNet  Google Scholar 

  10. Ho ND, Van Dooren P, Blondel VD (2008) Descent methods for nonnegative matrix factorization. CoRR, abs/0801.3199

  11. Kim H, Park H (2007) Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12):1495–1502

    Article  Google Scholar 

  12. Kim H, Park H (2008) Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J Matrix Anal Appl 30(2):713–730

    Article  MATH  MathSciNet  Google Scholar 

  13. Kim J, Park H (2011) Fast nonnegative matrix factorization: an active-set-like method and comparisons. SIAM J Sci Comput 33(6):3261–3281

    Article  MATH  MathSciNet  Google Scholar 

  14. Kim J, He Y, Park H (2013) Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J Glob Optim, pp 1–35

  15. Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining-KDD ’08, pp 426–434

  16. Koren Y (2009) Collaborative filtering with temporal dynamics. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining—KDD ’09, pp 447

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

    Article  Google Scholar 

  18. Kuang D, Park H, Ding CHQ (2012) Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of SIAM international conference on data mining—SDM’12, pp 106–117

  19. Lin CJ (2007) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19(10):2756–2779

    Article  MATH  MathSciNet  Google Scholar 

  20. Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2010) Graphlab: a new parallel framework for machine learning. In: Conference on uncertainty in artificial intelligence (UAI)

  21. Mackey LW, Weiss D, Jordan MI (2010) Mixed membership matrix factorization. In: Proceedings of the 27th international conference on machine learning (ICML-10), pp 711–718

  22. Markovsky I (2011) Algorithms and literate programs for weighted low-rank approximation with missing data. In: Levesley J, Iske A, Georgoulis E (eds) Approximation algorithms for complex systems, chapter: 12. Springer, Berlin, pp 255–273

  23. Movielens dataset. http://movielens.umn.edu, 1999 [online: accessed 6-June-2012]

  24. Paterek A (2007) Improving regularized singular value decomposition for collaborative filtering. In: Proceedings of 13th ACM international conference on knowledge discovery and data mining-KDD’07, pp 39–42

  25. Salakhutdinov R, Mnih A (2008) Bayesian probabilistic matrix factorization using markov chain monte carlo. In: ICML, pp 880–887

  26. Xiong L, Chen X, Huang TK, Schneider JG, Carbonell JG (2010) Temporal collaborative filtering with bayesian probabilistic tensor factorization. In: Proceedings of the SIAM international conference on data mining-SDM’10, pp 211–222

  27. Yu HF, Hsieh CJ, Si S, Dhillon IS (2012) Scalable coordinate descent approaches to parallel matrix factorization for recommender systems. In: Proceedings of the IEEE international conference on data mining-ICDM’12, pp 765–774

  28. Zhou Y, Wilkinson D, Schreiber R, Pan R (2008) Large-scale parallel collaborative filtering for the netflix prize. Algorithmic Aspects Inf Manag 5034:337–348

    Article  Google Scholar 

  29. Ziegler CN, McNee SM, Konstan JA, Lausen G (2005) Improving recommendation lists through topic diversification. In: Proceedings of the 14th international conference on world wide web-WWW’05, pp 22–32

Download references

Acknowledgments

This work is supported in part by the National Science Foundation (NSF) Grants CCF-0808863, Defense Advanced Research Projects Agency (DARPA) XDATA program Grant FA8750-12-2-0309 and ERC Grant 258581 (under FP7/2007-2013) “Structured low-rank approximation”; the Research Foundation Flanders (FWO-Vlaanderen); the Flemish Government (Methusalem Fund, METH1); the Belgian Federal Government (IAP VII / DYSCO). Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundations and DARPA. Part of this research was carried out while the second author was with Georgia Institute of Technology.

Author information

Authors and Affiliations

  1. School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, GA, 30338, USA

    Ramakrishnan Kannan & Haesun Park

  2. Department ELEC, Vrije Universiteit Brussel, Brussels, Belgium

    Mariya Ishteva

Authors
  1. Ramakrishnan Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariya Ishteva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haesun Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ramakrishnan Kannan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kannan, R., Ishteva, M. & Park, H. Bounded matrix factorization for recommender system. Knowl Inf Syst 39, 491–511 (2014). https://doi.org/10.1007/s10115-013-0710-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-013-0710-2

Keywords

Search

Navigation