We use cookies to improve your experience with our site.
辛欣, 林钦佑, 魏骁驰, 黄河燕. 分解遇见异构潜在主题:一个可解释的跨网站推荐模型[J]. 计算机科学技术学报, 2015, 30(4): 917-932. DOI: 10.1007/s11390-015-1570-x
引用本文: 辛欣, 林钦佑, 魏骁驰, 黄河燕. 分解遇见异构潜在主题:一个可解释的跨网站推荐模型[J]. 计算机科学技术学报, 2015, 30(4): 917-932. DOI: 10.1007/s11390-015-1570-x
Xin Xin, Chin-Yew Lin, Xiao-Chi Wei, He-Yan Huang. When Factorization Meets Heterogeneous Latent Topics: An Interpretable Cross-Site Recommendation Framework[J]. Journal of Computer Science and Technology, 2015, 30(4): 917-932. DOI: 10.1007/s11390-015-1570-x
Citation: Xin Xin, Chin-Yew Lin, Xiao-Chi Wei, He-Yan Huang. When Factorization Meets Heterogeneous Latent Topics: An Interpretable Cross-Site Recommendation Framework[J]. Journal of Computer Science and Technology, 2015, 30(4): 917-932. DOI: 10.1007/s11390-015-1570-x

分解遇见异构潜在主题:一个可解释的跨网站推荐模型

When Factorization Meets Heterogeneous Latent Topics: An Interpretable Cross-Site Recommendation Framework

  • 摘要: 数据稀疏是社会推荐系统应用的典型挑战。过去缓解该问题的主要方法是利用该社交网站内的相关信息。在本文中,我们将通过探索跨网站信息来解决该挑战。具体研究目标包括:(1)如何利用跨网站的评分信息和内容特征信息提高推荐算法的精度和效率?(2)如何利用内容特征信息解释推荐结果?为此,本文提出矩阵分解与主题分析的联合模型,作为推荐算法框架。该框架下,异构内容特征会被描述为不同种类的主题,并以此实现数据准确降维,提升预测精度。另外,融合主题模型令矩阵分解的潜在特征向量具有可解释性。因此,上述两问题通过该联合模型同时解决。通过包含用户在三个社交网站的真实数据进行验证,所提出方法能够有效提高推荐精度,并具有解释性。通过复杂度分析,该算法的计算复杂度随数据的增加线性增长,因此该算法可用于大规模数据。

     

    Abstract: Data sparsity is a well-known challenge in applications of recommender systems. Previous work alleviate this problem by incorporating the information within the corresponding social media site. In this paper, we are going to solve this challenge by exploring the cross-site information. Specifically, we target at: 1) How to effectively and efficiently utilize cross-site ratings and content features to improve the recommendation performance? and 2) How to make the recommendation interpretable by utilizing the content features? We propose a joint model of matrix factorization and latent topic analysis as the recommendation framework. In this model, heterogeneous content features can be modeled by multiple kinds of latent topics, by which the feature dimensionality reduction is accurately conducted for improving recommendation performance. In addition, the combination of matrix factorization and latent topics makes the recommendation result interpretable from many aspects. Therefore, the above two issues are simultaneously solved. Through a real world dataset, where user behaviors in three social media sites are collected, we demonstrate that the proposed model is effective in improving the recommendation performance and interpreting the rationale of ratings.

     

/

返回文章
返回