Integrating Individual and Aggregate Diversity in Top- N Recommendation

Ethem Çanakoğlu (), İbrahim Muter () and Tevfik Aytekin ()
Additional contact information
Ethem Çanakoğlu: Department of Industrial Engineering, Bahçeşehir University, 34353 Istanbul, Turkey;
İbrahim Muter: School of Management, University of Bath, Bath BA2 7AY, United Kingdom;
Tevfik Aytekin: Department of Computer Engineering, Bahçeşehir University, 34353 Istanbul, Turkey

INFORMS Journal on Computing, 2021, vol. 33, issue 1, 300-318

Abstract: Recommender systems have become one of the main components of web technologies that help people to cope with information overload. Based on the analysis of past user behavior, these systems filter items according to users’ likes and interests. Two of the most important metrics used to analyze the performance of these systems are the accuracy and diversity of the recommendation lists. Whereas all the efforts exerted in the prediction of the user interests aim at maximizing the former, the latter emerges in various forms, such as diversity in the lists across all user recommendation lists, referred to as aggregate diversity , and diversity in the lists of individuals, known as individual diversity . In this paper, we tackle the combination of these three objectives and justify this approach by showing through experiments that handling these objectives in pairs does not yield satisfactory results in the third one. To that end, we develop a mathematical model that is formulated using multiobjective optimization approaches. To cope with the intractability of this nonlinear integer programming model, its special structure is exploited by a decomposition technique. For the solution of the resulting formulation, we propose an iterative framework that is composed of a clique-generating genetic algorithm, a constructive heuristic, and an improvement heuristic. The former is designed to incorporate all objective functions into the generated cliques and specifically impose a certain level of individual diversity, whereas the latter chooses one clique for each user such that the desired aggregate diversity level is fulfilled. We conduct experiments on three data sets and show that the proposed modeling approach successfully handles all objectives according to the needs of the system and that the proposed methodology is capable of yielding good upper bounds.

Keywords: recommender systems; individual diversity; aggregate diversity; multiobjective optimization; genetic algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1287/ijoc.2019.0952 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:33:y:2021:i:1:p:300-318

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().