I'm studying Matrix Factorization (to use in Recommender Systems as link predictor) and i want to know if there is any similarity with PCA? The latent features can be compared to the eigenvectors?
Thank you
I'm studying Matrix Factorization (to use in Recommender Systems as link predictor) and i want to know if there is any similarity with PCA? The latent features can be compared to the eigenvectors?
Thank you
In a sense, PCA is a kind of matrix factorization, since it decomposes a matrix $\bf{X}$ into $\bf{W{\Sigma}V^T}$. However, matrix factorization is a very general term.
Also, see this answer on math.stackexchange.
PCA, as far as I can tell, is just looking at and doing stuff with the output of factorisation through the Singular Value Decomposition. $\bf{X=U \Sigma V^T}$.
Just in case the question was about factorisation generally. Factorisation would be any breaking up / decomposing of a matrix into a product of other matrices. A different factorisation is the LU, $\bf{X=LU}$, which helps solve systems of equations through elimination.
There are indeed many Matrix Factorization techniques. You might be interested in this page: https://sites.google.com/site/igorcarron2/matrixfactorizations and thyen let us know which matrix factorization you want to compare with PCA.