Based on the missing not at random assumption and central limit theorem, this paper presents a novel way to accelerate the iteration speed in the collaborative filtering models called Gaussian iteration. In the proposed model, adding the Gaussian distribution to the estimation error makes the falling direction more credible, which significantly reduces the running time with the ideal accuracy. For evaluation, we compare the performance of the proposed model with three existing collaborative filtering models on two kinds of Movielens datasets. The results indicate that the novel method outperforms the existing models and it is easy to implement and faster. Moreover, the proposed model is scalable to the analogous objective function in other models.
CITATION STYLE
Li, X., Li, F., Guo, Y., & Huang, J. (2016). Gaussian iteration: A novel way to collaborative filtering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9773, pp. 260–270). Springer Verlag. https://doi.org/10.1007/978-3-319-42297-8_25
Mendeley helps you to discover research relevant for your work.