Performing SVD on Matrices and Its Extensions

  • Panagiotis SymeonidisEmail author
  • Andreas Zioupos
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


In this chapter, we describe singular value decomposition (SVD), which is applied on recommender systems. We discuss in detail the method’s mathematical background and present (step by step) the SVD method using a toy example of a recommender system. We also describe in detail UV decomposition. This method is an instance of SVD, as we mathematically prove. We minimize an objective function, which captures the error between the predicted and real value of a user’s rating. We also provide a step-by-step implementation of UV decomposition using a toy example, which is followed by a short representation of the algorithm in pseudocode form. Finally, an additional constraint of friendship is added to the objective function to leverage the quality of recommendations.


Singular value decomposition UV decomposition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berry, M., Dumais, S., O’Brien, G.: Using linear algebra for intelligent information retrieval. SIAM Rev. 37(4), 573–595 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bhargava, P., Phan, T., Zhou, J., Lee, J.: Who, what, when, and where: multi-dimensional collaborative recommendations using tensor factorization on sparse user-generated data. In: Proceedings of the 24th International Conference on World Wide Web, WWW’15, Republic and Canton of Geneva, Switzerland, pp. 130–140. International World Wide Web Conferences Steering Committee (2015)Google Scholar
  3. 3.
    Forsati, R., Mahdavi, M., Shamsfard, M., Sarwat, M.: Matrix factorization with explicit trust and distrust side information for improved social recommendation. ACM Trans. Inf. Syst. 32(4), 17:1–17:38 (2014)Google Scholar
  4. 4.
    Furnas, G., Deerwester, S., Dumais, S., et al.: Information retrieval using a singular value decomposition model of latent semantic structure. In: Proceedings of ACM SIGIR Conference, pp. 465–480 (1988)Google Scholar
  5. 5.
    Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Application of dimensionality reduction in recommender system-a case study. In: ACM WebKDD Workshop (2000)Google Scholar
  6. 6.
    Yuan, Q., Chen, L., Zhao, S.: Factorization vs. regularization: fusing heterogeneous social relationships in top-n recommendation (2011)Google Scholar

Copyright information

© The Author(s) 2016

Authors and Affiliations

  1. 1.Faculty of Computer ScienceFree University of Bozen-BolzanoBozen-BolzanoItaly
  2. 2.ThessalonikiGreece

Personalised recommendations