Exploiting rich user information for one-class collaborative filtering

被引:23
作者
Li, Yanen [1 ]
Zhai, ChengXiang [1 ]
Chen, Ye [2 ]
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
[2] Microsoft Corp, Mountain View, CA USA
基金
美国国家科学基金会;
关键词
Recommender systems; One-class collaborative filtering; Rich user information; Ensemble;
D O I
10.1007/s10115-012-0583-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One-class collaborative filtering (OCCF) is an emerging setup in collaborative filtering in which only positive examples or implicit feedback can be observed. Compared with the traditional collaborative filtering setting where the data have ratings, OCCF is more realistic in many scenarios when no ratings are available. In this paper, we propose to improve OCCF accuracy by exploiting the rich user information that is often naturally available in community-based interactive information systems, including a user's search query history, and purchasing and browsing activities. We propose two major strategies to incorporate such user information into the OCCF models: One is to linearly combine scores from different sources, and the other is to embed user information into collaborative filtering. Furthermore, we employ the MapReduce framework for similarity computation over millions of users and items. Experimental results on two large-scale retail datasets from a major e-commerce company show that the proposed methods are effective and can improve the performance of the OCCF over baseline methods through leveraging rich user information.
引用
收藏
页码:277 / 301
页数:25
相关论文
共 29 条
  • [1] Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions
    Adomavicius, G
    Tuzhilin, A
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) : 734 - 749
  • [2] Agichtein E., 2006, Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P19, DOI 10.1145/1148170.1148177
  • [3] [Anonymous], 2003, P 20 INT C MACH LEAR
  • [4] [Anonymous], 2011, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
  • [5] [Anonymous], 2001, Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI'01)
  • [6] [Anonymous], 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), DOI [10.1145/1150402.1150493, DOI 10.1145/1150402.1150493]
  • [7] [Anonymous], 2002, P ACM SIGKDD KDD 200, DOI 10.1145/775047.775067
  • [8] [Anonymous], 1977, Solution of illposed problems
  • [9] [Anonymous], 2008, P 14 ACM SIGKDD INT
  • [10] Fab: Content-based, collaborative recommendation
    Balabanovic, M
    Shoham, Y
    [J]. COMMUNICATIONS OF THE ACM, 1997, 40 (03) : 66 - 72