Mohammad Khoshneshin
ABSTRACT
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. One of the most accurate and scalable collaborative filtering algorithms is matrix factorization, which is based on a latent factor model. We propose a novel Euclidean embedding method as an alternative latent factor model to implement collaborative filtering. In this method, users and items are embedded in a unified Euclidean space where the distance between a user and an item is inversely proportional to the rating. This model is comparable to matrix factorization in terms of both scalability and accuracy while providing several advantages. First, the result of Euclidean embedding is more intuitively understandable for humans, allowing useful visualizations. Second, the neighborhood structure of the unified Euclidean space allows very efficient recommendation queries. Finally, the method facilitates online implementation requirements such as mapping new users or items in an existing model. Our experimental results confirm these advantages and show that collaborative filtering via Euclidean embedding is a promising approach for online recommender systems.
Supplemental Material
- }}W. Basalaj. Incremental multidimensional scaling method for database visualization. In Proc. Visual Data Exploration and Analysis VI, SPIE, volume 3643, pages 149--158, 1999.Google Scholar
Cross Ref
- }}J. Bennett and S. Lanning. The Netflix Prize. In KDD 2007, Netflix Competition Workshop, 2007.Google Scholar
- }}I. Borg and P. Groenen. Modern multidimensional scaling. Springer New York, 1997.Google ScholarCross Ref
- }}M. Brand. Fast online SVD revisions for lightweight recommender systems. In SIAM International Conference on Data Mining, pages 37--46, 2003.Google ScholarCross Ref
- }}L. Candillier, F. Meyer, and M. Boulle. Comparing state-of-the-art collaborative filtering systems. Lectures Notes in Computer Science, 4571:548, 2007. Google ScholarDigital Library
- }}M. Chalmers. A linear iteration time layout algorithm for visualising high-dimensional data. In VIS '96: Proceedings of the 7th conference on Visualization '96, pages 127--ff., Los Alamitos, CA, USA, 1996. IEEE Computer Society Press. Google ScholarDigital Library
- }}T. Cox and M. Cox. Multidimensional Scaling. CRC Press, 2001.Google Scholar
- }}A. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: Scalable online collaborative filtering. In Proceedings of the 16th International Conference on World Wide Web, pages 271--280. ACM New York, NY, USA, 2007. Google ScholarDigital Library
- }}W. DeSarbo, D. Howard, and K. Jedidi. Multiclus: A new method for simultaneously performing multidimensional scaling and cluster analysis. Psychometrika, 56(1):121--136, 1991.Google ScholarCross Ref
- }}D. Fisher, K. Hildrum, J. Hong, M. Newman, M. Thomas, and R. Vuduc. Swami: A framework for collaborative filtering algorithm development and evaluation. In SIGIR 2000. Citeseer, 2000. Google ScholarDigital Library
- }}I. Fodor. A survey of dimension reduction techniques. https://computation.llnl.gov/casc/sapphire/pubs/148494.pdf, 2002.Google Scholar
- }}T. George and S. Merugu. A scalable collaborative filtering framework based on co-clustering. In Proceedings of the IEEE Conference on Data Mining, pages 625--628, 2005. Google ScholarDigital Library
- }}A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47--57, New York, NY, USA, 1984. ACM. Google ScholarDigital Library
- }}F. Igo Jr, M. Brand, K. Wittenburg, D. Wong, and S. Azuma. Multidimensional visualization for collaborative filtering recommender systems. Technical Report TR20003-39, Mitsubishi Electric Research Laboratories, 2002.Google Scholar
- }}A. Jameson and B. Smyth. Recommendation to groups. Lecture Notes in Computer Science, 4321:596--627, 2007. Google ScholarDigital Library
- }}Y. Koren. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In KDD '08: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pages 426--434, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- }}J. Kruskal. Nonmetric multidimensional scaling: A numerical method. Psychometrika, 29(2):115--129, 1964.Google ScholarCross Ref
- }}M. Kurucz, A. Benczúr, and K. Csalogány. Methods for large scale SVD with missing values. In KDD 2007: Netflix Competition Workshop.Google Scholar
- }}A. Morrison, G. Ross, and M. Chalmers. Fast multidimensional scaling through sampling, springs and interpolation. Information Visualization, 2(1):68--77, 2003. Google ScholarDigital Library
- }}A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In KDD 2007: Netflix Competition Workshop.Google Scholar
- }}D. Pennock, E. Horvitz, S. Lawrence, and C. Giles. Collaborative filtering by personality diagnosis: A hybrid memory-and model-based approach. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, pages 473--480. Stanford, California, 2000. Google ScholarDigital Library
- }}A. Rashid, S. Lam, G. Karypis, and J. Riedl. ClustKNN: A highly scalable hybrid model & memory-based CF algorithm. In Procedings of WebKDD 2006 - Knowledge Discovery on the Web.Google Scholar
- }}B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Incremental singular value decomposition algorithms for highly scalable recommender systems. In Fifth International Conference on Computer and Information Science, pages 27--28, 2002.Google Scholar
- }}G. Takacs, I. Pilaszy, B. Nemeth, and D. Tikk. On the Gravity recommendation system. In KDD 2007: Netflix Competition Workshop.Google Scholar
- }}M. W. Trosset, C. E. Priebe, Y. Park, and M. I. Miller. Semisupervised learning from dissimilarity data. Computational Statistics and Data Analysis, 52(10):4643--4657, 2008. Google ScholarDigital Library
Index Terms
- Collaborative filtering via euclidean embedding
Recommendations
Collaborative filtering via temporal euclidean embedding
APWeb'12: Proceedings of the 14th Asia-Pacific international conference on Web Technologies and ApplicationsRecommender systems are considered as a promising approach to solve the problem of information overload. In collaborative filtering recommender systems, one of the most accurate and scalable algorithms is matrix factorization. As an alternative to this ...
Trust-based collaborative filtering: tackling the cold start problem using regular equivalence
RecSys '18: Proceedings of the 12th ACM Conference on Recommender SystemsUser-based Collaborative Filtering (CF) is one of the most popular approaches to create recommender systems. This approach is based on finding the most relevant k users from whose rating history we can extract items to recommend. CF, however, suffers ...
Typicality-Based Collaborative Filtering Recommendation
Collaborative filtering (CF) is an important and popular technology for recommender systems. However, current CF methods suffer from such problems as data sparsity, recommendation inaccuracy, and big-error in predictions. In this paper, we borrow ideas ...
Comments