Exploiting group recommendation functions for flexible preferences

Senjuti Basu Roy, Saravanan Thirumuruganathan, Sihem Amer-Yahia, Gautam Das, Cong Yu

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

19 Citations (Scopus)

Abstract

We examine the problem of enabling the flexibility of updating one's preferences in group recommendation. In our setting, any group member can provide a vector of preferences that, in addition to past preferences and other group members' preferences, will be accounted for in computing group recommendation. This functionality is essential in many group recommendation applications, such as travel planning, online games, book clubs, or strategic voting, as it has been previously shown that user preferences may vary depending on mood, context, and company (i.e., other people in the group). Preferences are enforced in an feedback box that replaces preferences provided by the users by a potentially different feedback vector that is better suited for maximizing the individual satisfaction when computing the group recommendation. The feedback box interacts with a traditional recommendation box that implements a group consensus semantics in the form of Aggregated Voting or Least Misery, two popular aggregation functions for group recommendation. We develop efficient algorithms to compute robust group recommendations that are appropriate in situations where users have changing preferences. Our extensive empirical study on real world data-sets validates our findings.

Original languageEnglish
Title of host publication2014 IEEE 30th International Conference on Data Engineering, ICDE 2014
PublisherIEEE Computer Society
Pages412-423
Number of pages12
ISBN (Print)9781479925544
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event30th IEEE International Conference on Data Engineering, ICDE 2014 - Chicago, IL, United States
Duration: 31 Mar 20144 Apr 2014

Other

Other30th IEEE International Conference on Data Engineering, ICDE 2014
CountryUnited States
CityChicago, IL
Period31/3/144/4/14

Fingerprint

Feedback
Agglomeration
Semantics
Planning
Industry

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Basu Roy, S., Thirumuruganathan, S., Amer-Yahia, S., Das, G., & Yu, C. (2014). Exploiting group recommendation functions for flexible preferences. In 2014 IEEE 30th International Conference on Data Engineering, ICDE 2014 (pp. 412-423). [6816669] IEEE Computer Society. https://doi.org/10.1109/ICDE.2014.6816669

Exploiting group recommendation functions for flexible preferences. / Basu Roy, Senjuti; Thirumuruganathan, Saravanan; Amer-Yahia, Sihem; Das, Gautam; Yu, Cong.

2014 IEEE 30th International Conference on Data Engineering, ICDE 2014. IEEE Computer Society, 2014. p. 412-423 6816669.

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

Basu Roy, S, Thirumuruganathan, S, Amer-Yahia, S, Das, G & Yu, C 2014, Exploiting group recommendation functions for flexible preferences. in 2014 IEEE 30th International Conference on Data Engineering, ICDE 2014., 6816669, IEEE Computer Society, pp. 412-423, 30th IEEE International Conference on Data Engineering, ICDE 2014, Chicago, IL, United States, 31/3/14. https://doi.org/10.1109/ICDE.2014.6816669
Basu Roy S, Thirumuruganathan S, Amer-Yahia S, Das G, Yu C. Exploiting group recommendation functions for flexible preferences. In 2014 IEEE 30th International Conference on Data Engineering, ICDE 2014. IEEE Computer Society. 2014. p. 412-423. 6816669 https://doi.org/10.1109/ICDE.2014.6816669
Basu Roy, Senjuti ; Thirumuruganathan, Saravanan ; Amer-Yahia, Sihem ; Das, Gautam ; Yu, Cong. / Exploiting group recommendation functions for flexible preferences. 2014 IEEE 30th International Conference on Data Engineering, ICDE 2014. IEEE Computer Society, 2014. pp. 412-423
@inproceedings{1bb4c05dbd094270b82a9ba5717dfb9d,
title = "Exploiting group recommendation functions for flexible preferences",
abstract = "We examine the problem of enabling the flexibility of updating one's preferences in group recommendation. In our setting, any group member can provide a vector of preferences that, in addition to past preferences and other group members' preferences, will be accounted for in computing group recommendation. This functionality is essential in many group recommendation applications, such as travel planning, online games, book clubs, or strategic voting, as it has been previously shown that user preferences may vary depending on mood, context, and company (i.e., other people in the group). Preferences are enforced in an feedback box that replaces preferences provided by the users by a potentially different feedback vector that is better suited for maximizing the individual satisfaction when computing the group recommendation. The feedback box interacts with a traditional recommendation box that implements a group consensus semantics in the form of Aggregated Voting or Least Misery, two popular aggregation functions for group recommendation. We develop efficient algorithms to compute robust group recommendations that are appropriate in situations where users have changing preferences. Our extensive empirical study on real world data-sets validates our findings.",
author = "{Basu Roy}, Senjuti and Saravanan Thirumuruganathan and Sihem Amer-Yahia and Gautam Das and Cong Yu",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ICDE.2014.6816669",
language = "English",
isbn = "9781479925544",
pages = "412--423",
booktitle = "2014 IEEE 30th International Conference on Data Engineering, ICDE 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Exploiting group recommendation functions for flexible preferences

AU - Basu Roy, Senjuti

AU - Thirumuruganathan, Saravanan

AU - Amer-Yahia, Sihem

AU - Das, Gautam

AU - Yu, Cong

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We examine the problem of enabling the flexibility of updating one's preferences in group recommendation. In our setting, any group member can provide a vector of preferences that, in addition to past preferences and other group members' preferences, will be accounted for in computing group recommendation. This functionality is essential in many group recommendation applications, such as travel planning, online games, book clubs, or strategic voting, as it has been previously shown that user preferences may vary depending on mood, context, and company (i.e., other people in the group). Preferences are enforced in an feedback box that replaces preferences provided by the users by a potentially different feedback vector that is better suited for maximizing the individual satisfaction when computing the group recommendation. The feedback box interacts with a traditional recommendation box that implements a group consensus semantics in the form of Aggregated Voting or Least Misery, two popular aggregation functions for group recommendation. We develop efficient algorithms to compute robust group recommendations that are appropriate in situations where users have changing preferences. Our extensive empirical study on real world data-sets validates our findings.

AB - We examine the problem of enabling the flexibility of updating one's preferences in group recommendation. In our setting, any group member can provide a vector of preferences that, in addition to past preferences and other group members' preferences, will be accounted for in computing group recommendation. This functionality is essential in many group recommendation applications, such as travel planning, online games, book clubs, or strategic voting, as it has been previously shown that user preferences may vary depending on mood, context, and company (i.e., other people in the group). Preferences are enforced in an feedback box that replaces preferences provided by the users by a potentially different feedback vector that is better suited for maximizing the individual satisfaction when computing the group recommendation. The feedback box interacts with a traditional recommendation box that implements a group consensus semantics in the form of Aggregated Voting or Least Misery, two popular aggregation functions for group recommendation. We develop efficient algorithms to compute robust group recommendations that are appropriate in situations where users have changing preferences. Our extensive empirical study on real world data-sets validates our findings.

UR - http://www.scopus.com/inward/record.url?scp=84901756996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901756996&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2014.6816669

DO - 10.1109/ICDE.2014.6816669

M3 - Conference contribution

SN - 9781479925544

SP - 412

EP - 423

BT - 2014 IEEE 30th International Conference on Data Engineering, ICDE 2014

PB - IEEE Computer Society

ER -