Advertisement

Matrix Factorization

  • Charu C. Aggarwal
Chapter
  • 332 Downloads

Abstract

Just as multiplication can be generalized from scalars to matrices, the notion of factorization can also be generalized from scalars to matrices. Exact matrix factorizations need to satisfy the size and rank constraints that are imposed on matrix multiplication. For example, when an n × d matrix A is factorized into two matrices B and C (i.e., A = BC), the matrices B and C must be of sizes n × k and k × d for some constant k. For exact factorization to occur, the value of k must be equal to at least the rank of A. This is because the rank of A is at most equal to the minimum of the ranks of B and C. In practice, it is common to perform approximate factorization with much smaller values of k than the rank of A.

References

  1. 2.
    C. Aggarwal. Machine learning for text. Springer, 2018.CrossRefGoogle Scholar
  2. 3.
    C. Aggarwal. Recommender systems: The textbook. Springer, 2016.CrossRefGoogle Scholar
  3. 11.
    I. Bayer. Fastfm: a library for factorization machines. arXiv preprint arXiv:1505.00641, 2015. https://arxiv.org/pdf/1505.00641v2.pdf
  4. 35.
    C. Ding, T. Li, and W. Peng. On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing. Computational Statistics and Data Analysis, 52(8), pp. 3913–3927, 2008.MathSciNetCrossRefGoogle Scholar
  5. 47.
    C. Freudenthaler, L. Schmidt-Thieme, and S. Rendle. Factorization machines: Factorized polynomial regression models. GPSDAA, 2011.Google Scholar
  6. 50.
    E. Gaussier and C. Goutte. Relation between PLSA and NMF and implications. ACM SIGIR Conference, pp. 601–602, 2005.Google Scholar
  7. 55.
    A. Grover and J. Leskovec. node2vec: Scalable feature learning for networks. ACM KDD Conference, pp. 855–864, 2016.Google Scholar
  8. 63.
    T. Hofmann. Probabilistic latent semantic indexing. ACM SIGIR Conference, pp. 50–57, 1999.Google Scholar
  9. 65.
    Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. IEEE ICDM, pp. 263–272, 2008.Google Scholar
  10. 69.
    P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. ACM Symposium on Theory of Computing, pp. 665–674, 2013.Google Scholar
  11. 70.
    C. Johnson. Logistic matrix factorization for implicit feedback data. NIPS Conference, 2014.Google Scholar
  12. 75.
    Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 8, pp. 30–37, 2009.CrossRefGoogle Scholar
  13. 76.
    A. Langville, C. Meyer, R. Albright, J. Cox, and D. Duling. Initializations for the nonnegative matrix factorization. ACM KDD Conference, pp. 23–26, 2006.Google Scholar
  14. 77.
    D. Lay, S. Lay, and J. McDonald. Linear Algebra and its applications, Pearson, 2012.Google Scholar
  15. 79.
    D. Lee and H. Seung. Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, pp. 556–562, 2001.Google Scholar
  16. 90.
    P. McCullagh. Regression models for ordinal data. Journal of the royal statistical society. Series B (Methodological), pp. 109–142, 1980.Google Scholar
  17. 91.
    T. Mikolov, K. Chen, G. Corrado, and J. Dean. Efficient estimation of word representations in vector space. arXiv:1301.3781, 2013. https://arxiv.org/abs/1301.3781
  18. 92.
    T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. NIPS Conference, pp. 3111–3119, 2013.Google Scholar
  19. 101.
    J. Pennington, R. Socher, and C. Manning. Glove: Global Vectors for Word Representation. EMNLP, pp. 1532–1543, 2014.Google Scholar
  20. 103.
    B. Perozzi, R. Al-Rfou, and S. Skiena. Deepwalk: Online learning of social representations. ACM KDD Conference, pp. 701–710, 2014.Google Scholar
  21. 107.
    S. Rendle. Factorization machines. IEEE ICDM Conference, pp. 995–100, 2010.Google Scholar
  22. 108.
    S. Rendle. Factorization machines with libfm. ACM Transactions on Intelligent Systems and Technology, 3(3), 57, 2012.Google Scholar
  23. 117.
    A. Singh and G. Gordon. A unified view of matrix factorization models. Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 358–373, 2008.Google Scholar
  24. 120.
    N. Srebro, J. Rennie, and T. Jaakkola. Maximum-margin matrix factorization. Advances in neural information processing systems, pp. 1329–1336, 2004.Google Scholar
  25. 122.
    G. Strang. An introduction to linear algebra, Fifth Edition. Wellseley-Cambridge Press, 2016.zbMATHGoogle Scholar
  26. 123.
    G. Strang. Linear algebra and its applications, Fourth Edition. Brooks Cole, 2011.Google Scholar
  27. 128.
    M. Udell, C. Horn, R. Zadeh, and S. Boyd. Generalized low rank models. Foundations and Trends in Machine Learning, 9(1), pp. 1–118, 2016. https://github.com/madeleineudell/LowRankModels.jl CrossRefGoogle Scholar
  28. 130.
    H. Wendland. Numerical linear algebra: An introduction. Cambridge University Press, 2018.zbMATHGoogle Scholar
  29. 137.
    H. Yu, C. Hsieh, S. Si, and I. S. Dhillon. Scalable coordinate descent approaches to parallel matrix factorization for recommender systems. IEEE ICDM, pp. 765–774, 2012.Google Scholar
  30. 141.
    Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan. Large-scale parallel collaborative filtering for the Netflix prize. Algorithmic Aspects in Information and Management, pp. 337–348, 2008.Google Scholar
  31. 144.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Charu C. Aggarwal
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations