Skip to main navigation Skip to search Skip to main content

Learning to Recommend Accurate and Diverse Items

  • Peizhe Cheng
  • , Shuaiqiang Wang
  • , Jun Ma
  • , Jiankai Sun
  • , Hui Xiong
  • Shandong University
  • Ohio State University
  • Rutgers University

Research output: Contribution to conference › Paper › peer-review

Abstract

In this study, we investigate diversified recommendation problem by supervised learning, seeking significant improvement in diversity while maintaining accuracy. In particular, we regard each user as a training instance, and heuristically choose a subset of accurate and diverse items as ground- truth for each user. We then represent each user or item as a vector resulted from the factorization of the user-item rating matrix. In our paper, we try to discover a factorization for matching the following supervised learning task. In doing this, we define two coupled optimization problems, parameterized matrix factorization and structural learning, to formulate our task. And we propose a diversified collaborative filtering algorithm (DCF) to solve the coupled problems. We also introduce a new pairwise accuracy metric and a normalized topic coverage diversity metric to measure the performance of accuracy and diversity respectively. Extensive experiments on benchmark datasets show the performance gains of DCF in comparison with the state-of-the-art algorithms.
Original languageEnglish
Pages183-192
Number of pages10
DOIs
Publication statusPublished - 3 Apr 2017
Event26th International World Wide Web Conference - Perth, Australia
Duration: 3 Apr 2017 → 7 Apr 2017
http://www2017.com.au

Conference

Conference26th International World Wide Web Conference
Abbreviated titleWWW
Country/TerritoryAustralia
CityPerth
Period3/04/17 → 7/04/17
Internet address

Keywords

  • diversity
  • collaborative filtering
  • recommender systems
  • structural SVM

Fingerprint

Dive into the research topics of 'Learning to Recommend Accurate and Diverse Items'. Together they form a unique fingerprint.

Cite this