SAGA: A submodular greedy algorithm for group recommendation

Shameem A. Puthiya Parambath, Nishant Vijayakumar, Sanjay Chawla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publication32nd AAAI Conference on Artificial Intelligence, AAAI 2018
PublisherAAAI press
Pages3900-3908
Number of pages9
ISBN (Electronic)9781577358008
Publication statusPublished - 1 Jan 2018
Event32nd AAAI Conference on Artificial Intelligence, AAAI 2018 - New Orleans, United States
Duration: 2 Feb 20187 Feb 2018

Other

Other32nd AAAI Conference on Artificial Intelligence, AAAI 2018
CountryUnited States
CityNew Orleans
Period2/2/187/2/18

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Puthiya Parambath, S. A., Vijayakumar, N., & Chawla, S. (2018). SAGA: A submodular greedy algorithm for group recommendation. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 3900-3908). AAAI press.