Abstract
Memory-based collaborative filtering aims at predicting the utility of a certain item for a particular user based on the previous ratings from similar users and similar items. Previous studies in finding similar users and items are based on user-defined similarity metrics such as Pearson Correlation Coefficient or Vector Space Similarity which are not adaptive and optimized for different applications and datasets. Moreover, previous studies have treated the similarity function calculation between users and items separately. In this paper, we propose a novel adaptive bidirectional similarity metric for collaborative filtering. We automatically learn similarities between users and items simultaneously through matrix factorization. We show that our model naturally extends the memory based approaches. Theoretical analysis shows our model to be a novel generalization of the SVD model. We evaluate our method using three benchmark datasets, including MovieLens, EachMovie and Netflix, through which we show that our methods outperform many previous baselines.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE TKDE 17(6), 734–749 (2005)
Almeida, L.B., Langlois, T., Amaral, J.D., Plakhov, A.: Parameter adaptation in stochastic optimization. On-line learning in neural networks, 111–134 (1998)
Brand, M.: Fast online svd revisions for lightweight recommender systems. In: Proc. of SIAM ICDM (2003)
Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proc. of the 14th Conf. on UAI, pp. 43–52 (1998)
Canny, J.: Collaborative filtering with privacy via factor analysis. In: Proc. of the 25th SIGIR, pp. 238–245. ACM, New York (2002)
Delgado, J.: Memory-based weightedmajority prediction for recommender systems. In: ACM SIGIR 1999 Workshop on Recommender Systems (1999)
Deshpande, M., Karypis, G.: Item-based top-n recommendation algorithms. ACM TOIS 22(1), 143–177 (2004)
Funk, S.: Netflix update: Try this at home (December 2006), http://sifter.org/~simon/journal/20061211.html
Herlocker, J., Konstan, J.A., Riedl, J.: An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf. Retr. 5(4), 287–310 (2002)
Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proc. of the 22nd SIGIR, pp. 230–237. ACM, New York (1999)
Hofmann, T.: Latent semantic models for collaborative filtering. ACM TOIS 22(1), 89–115 (2004)
Jin, R., Chai, J.Y., Si, L.: An automatic weighting scheme for collaborative filtering. In: Proc. of the 27th Annual International ACM SIGIR
Kirsch, A.: An introduction to the mathematical theory of inverse problems. Springer, New York (1996)
Ma, H., King, I., Lyu, M.R.: Effective missing data prediction for collaborative filtering. In: Proc. of the 30th SIGIR, pp. 39–46. ACM, New York (2007)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical recipes in C, 2nd edn. The art of scientific computing. Cambridge University Press, Cambridge (1992)
Resnick, P., Iacovou, N., Suchak, M., Bergstorm, P., Riedl, J.: GroupLens: An Open Architecture for Collaborative Filtering of Netnews. In: Proc. of ACM 1994 Conf. on CSCW (1994)
Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: Proc. of the 10th international Conf. on WWW, pp. 285–295 (2001)
Schraudolph, N.N.: Local gain adaptation in stochastic gradient descent. Technical Report IDSIA-09-99, 8 (1999)
Si, L., Jin, R.: A flexible mixture model for collaborative filtering. In: Proc. of the Twentieth ICML (2003)
Vozalis, M.G., Margaritis, K.G.: Using SVD and demographic data for the enhancement of generalized collaborative filtering. Inf. Sci 177(15) (2007)
Wang, J., de Vries, A.P., Reinders, M.J.T.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: Proc. of the 29th SIGIR, pp. 501–508. ACM, New York (2006)
Wu, M.: Collaborative filtering via ensembles of matrix factorizations. In: Proc. of KDD Cup and Workshop (2007)
Xu, W., Gong, Y.: Document clustering by concept factorization. In: Proc. of the 27th SIGIR, pp. 202–209. ACM, New York (2004)
Xue, G.-R., Lin, C., Yang, Q., Xi, W., Zeng, H.-J., Yu, Y., Chen, Z.: Scalable collaborative filtering using cluster-based smoothing. In: Proc. of the 28th SIGIR, pp. 114–121. ACM, New York (2005)
Zhang, S., Wang, W., Ford, J., Makedon, F., Pearlman, J.: Using singular value decomposition approximation for collaborative filtering. In: Proc. of the Seventh IEEE CEC, pp. 257–264 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, B., Sun, JT., Wu, J., Yang, Q., Chen, Z. (2008). Learning Bidirectional Similarity for Collaborative Filtering. In: Daelemans, W., Goethals, B., Morik, K. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2008. Lecture Notes in Computer Science(), vol 5211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87479-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-87479-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87478-2
Online ISBN: 978-3-540-87479-9
eBook Packages: Computer ScienceComputer Science (R0)