SAGA: A Submodular Greedy Algorithm for Group Recommendation

Authors

  • Shameem Puthiya Parambath Qatar Computing Research Institute
  • Nishant Vijayakumar Apptopia Inc.
  • Sanjay Chawla Qatar Computing Research Institute

Keywords:

group recommendation, submodular function optimization, budgeted social choice

Abstract

In this paper, we propose a unified framework and an algorithm for the problem of group recommendation where a fixed number of items or alternatives can be recommended to a group of users. The problem of group recommendation arises naturally in many real world contexts, and is closely related to the budgeted social choice problem studied in economics. We frame the group recommendation problem as choosing a subgraph with the largest group consensus score in a completely connected graph defined over the item affinity matrix. We propose a fast greedy algorithm with strong theoretical guarantees, and show that the proposed algorithm compares favorably to the state-of-the-art group recommendation algorithms according to commonly used relevance and coverage performance measures on benchmark dataset.

Downloads

Published

2018-04-29

How to Cite

Puthiya Parambath, S., Vijayakumar, N., & Chawla, S. (2018). SAGA: A Submodular Greedy Algorithm for Group Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11650