Please use this identifier to cite or link to this item:
|Title:||Stability of matrix factorization for collaborative filtering|
|Citation:||Wang, Y.-X.,Xu, H. (2012). Stability of matrix factorization for collaborative filtering. Proceedings of the 29th International Conference on Machine Learning, ICML 2012 1 : 417-424. ScholarBank@NUS Repository.|
|Abstract:||We study the stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion. In particular, our results include: (I) we bound the gap between the solution matrix of the factorization method and the ground truth in terms of root mean square error; (II) we treat the matrix factorization as a subspace fitting problem and analyze the difference between the solution subspace and the ground truth; (III) we analyze the prediction error of individual users based on the subspace stability. We apply these results to the problem of collaborative filtering under manipulator attack, which leads to useful insights and guidelines for collaborative filtering system design. Copyright 2012 by the author(s)/owner(s).|
|Source Title:||Proceedings of the 29th International Conference on Machine Learning, ICML 2012|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.