Optimization-based approaches for maximizing aggregate recommendation diversity

Gediminas Adomavicius, Youngok Kwon

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

Recommender systems are being used to help users find relevant items from a large set of alternatives in many online applications. Most existing recommendation techniques have focused on improving recommendation accuracy; however, diversity of recommendations has also been increasingly recognized in research literature as an important aspect of recommendation quality. This paper proposes several optimization-based approaches for improving aggregate diversity of top-N recommendations, including a greedy maximization heuristic, a graphtheoretic approach based on maximum flow or maximum bipartite matching computations, and an integer programming approach. The proposed approaches are evaluated using real-world movie rating data sets and demonstrate substantial improvements in both diversity and accuracy as compared to the recommendation reranking approaches, which have been introduced in prior literature for the purposes of diversity improvement and were used for baseline comparisons in our study. The paper also discusses the computational complexity and the scalability of the proposed approaches, as well as the potential directions for future work.

Original languageEnglish (US)
Pages (from-to)351-369
Number of pages19
JournalINFORMS Journal on Computing
Volume26
Issue number2
DOIs
StatePublished - Jan 1 2014

Keywords

  • Collaborative filtering
  • Optimization techniques
  • Recommendation accuracy
  • Recommendation diversity
  • Recommender systems

Fingerprint Dive into the research topics of 'Optimization-based approaches for maximizing aggregate recommendation diversity'. Together they form a unique fingerprint.

Cite this