[en] Probabilistic graphic model is an elegant framework to compactly present complex real-world observations by modeling uncertainty and logical flow (conditionally independent factors). In this paper, we present a probabilistic framework of neighborhood-based recommendation methods (PNBM) in which similarity is regarded as an unobserved factor. Thus, PNBM leads the estimation of user preference to maximizing a posterior over similarity. We further introduce a novel multi-layer similarity descriptor which models and learns the joint influence of various features under PNBM, and name the new framework MPNBM. Empirical results on real-world datasets show that MPNBM allows very accurate estimation of user preferences.
Disciplines :
Computer science
Author, co-author :
Wang, Jun ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Tang, Qiang
External co-authors :
no
Language :
English
Title :
A Probabilistic View of Neighborhood-based Recommendation Methods
Publication date :
12 December 2016
Event name :
ICDM 2016 - IEEE International Conference on Data Mining series (ICDM) workshop CLOUDMINE
Event date :
from 12-12-2016 to 15-12-2016
Audience :
International
Main work title :
ICDM 2016 - IEEE International Conference on Data Mining series (ICDM) workshop CLOUDMINE
Peer reviewed :
Peer reviewed
FnR Project :
FNR5856658 - Boosting Security And Efficiency In Recommender Systems, 2013 (15/04/2014-14/04/2017) - Qiang Tang
Yahoo!: Webscope movie data set (version 1.0), http://research.yahoo.com/.
P. Adamopoulos and A. Tuzhilin. On over-specialization and concentration bias of recommendations: Probabilistic neighborhood selection in collaborative filtering systems. In Proceedings of the 8th ACM Conference on Recommender systems, pages 153-160. ACM, 2014.
R. Bell, Y. Koren, and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 95-104. ACM, 2007.
R. M. Bell and Y. Koren. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on, pages 43-52. IEEE, 2007.
A. Defazio and T. Caetano. A graphical model formulation of collaborative filtering neighbourhood methods with fast maximum entropy training. arXiv preprint arXiv:1206.4622, 2012.
C. Desrosiers and G. Karypis. A comprehensive survey of neighborhoodbased recommendation methods. In Recommender systems handbook, pages 107-144. Springer, 2011.
G. Guo, J. Zhang, and N. Yorke-Smith. A novel Bayesian similarity measure for recommender systems. In Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, pages 2619-2625. AAAI Press, 2013.
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 426-434. ACM, 2008.
Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, (8):30-37, 2009.
Z. Liu, Y.-X. Wang, and A. Smola. Fast differentially private matrix factorization. In Proceedings of the 9th ACM Conference on Recommender Systems, pages 171-178. ACM, 2015.
X. Ning and G. Karypis. Slim: Sparse linear methods for top-n recommender systems. In Data Mining (ICDM), 2011 IEEE 11th International Conference on, pages 497-506. IEEE, 2011.
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence, pages 452-461. AUAI Press, 2009.
P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: an open architecture for collaborative filtering of netnews. In Proceedings of the 1994 ACM conference on Computer supported cooperative work, pages 175-186. ACM, 1994.
X. Su and T. M. Khoshgoftaar. A survey of collaborative filtering techniques. Advances in artificial intelligence, 2009:4, 2009.
A. Toscher, M. Jahrer, and R. Legenstein. Improved neighborhoodbased algorithms for large-scale recommender systems. In Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition, page 4. ACM, 2008.
Y.-X. Wang, S. E. Fienberg, and A. Smola. Privacy for free: Posterior sampling and stochastic gradient monte carlo. arXiv preprint arXiv:1502.07645, 2015.
J. Yang, Z. Sun, A. Bozzon, and J. Zhang. Learning hierarchical feature influence for recommendation by recursive regularization. In Proceedings of 10th ACM Conference on Recommender Systems.(RecSys 2016). ACM, 2016.
K. Yu, A. Schwaighofer, V. Tresp, X. Xu, and H.-P. Kriegel. Probabilistic memory-based collaborative filtering. Knowledge and Data Engineering, IEEE Transactions on, 16(1):56-69, 2004.
Y. Zheng, B. Mobasher, and R. Burke. Incorporating context correlation into context-Aware matrix factorization. In Proceedings of the 2015 International Conference on Constraints and Preferences for Configuration and Recommendation and Intelligent Techniques for Web Personalization-Volume 1440, pages 21-27. CEUR-WS. org, 2015.
