Cross-Space Affinity Learning with Its Application to Movie Recommendation

被引:16
作者
Tang, Jinhui [1 ]
Qi, Guo-Jun [2 ,3 ]
Zhang, Liyan [4 ]
Xu, Changsheng [5 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Technol, Nanjing 210094, Jiangsu, Peoples R China
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[3] Univ Illinois, Beckman Inst, Urbana, IL 61801 USA
[4] Univ Calif Irvine, Dept Informat & Comp Sci, Irvine, CA 92697 USA
[5] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100190, Peoples R China
基金
高等学校博士学科点专项科研基金;
关键词
Cross-space affinity learning; heterogeneous spaces; movie recommendation;
D O I
10.1109/TKDE.2012.87
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel cross-space affinity learning algorithm over different spaces with heterogeneous structures. Unlike most of affinity learning algorithms on the homogeneous space, we construct a cross-space tensor model to learn the affinity measures on heterogeneous spaces subject to a set of order constraints from the training pool. We further enhance the model with a factorization form which greatly reduces the number of parameters of the model with a controlled complexity. Moreover, from the practical perspective, we show the proposed factorized cross-space tensor model can be efficiently optimized by a series of simple quadratic optimization problems in an iterative manner. The proposed cross-space affinity learning algorithm can be applied to many real-world problems, which involve multiple heterogeneous data objects defined over different spaces. In this paper, we apply it into the recommendation system to measure the affinity between users and the product items, where a higher affinity means a higher rating of the user on the product. For an empirical evaluation, a widely used benchmark movie recommendation data set-MovieLens-is used to compare the proposed algorithm with other state-of-the-art recommendation algorithms and we show that very competitive results can be obtained.
引用
收藏
页码:1510 / 1519
页数:10
相关论文
共 35 条
[1]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[2]  
[Anonymous], 1994, P 1994 ACM C COMP SU
[3]  
[Anonymous], INTRO SUPPORT VECTOR
[4]  
[Anonymous], 1997, MACHINE LEARNING, MCGRAW-HILL SCIENCE/ENGINEERING/MATH
[5]   Fab: Content-based, collaborative recommendation [J].
Balabanovic, M ;
Shoham, Y .
COMMUNICATIONS OF THE ACM, 1997, 40 (03) :66-72
[6]  
Becker H., 2010, P ACM INT C WEB SEAR
[7]  
Bell R., 2007, P ACM SIGKDD INT C K
[8]  
Breese J. S., 1998, P C UNC ART INT UAI
[9]  
Bronstein M.M., 2010, P IEEE C COMP VIS PA
[10]  
Chen J., 2008, P ACM SIGKDD INT C K