The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Group recommendation: semantics and efficiency
Abstract
We study the problem of group recommendation. Recommendation is an important information exploration paradigm that retrieves interesting items for users based on their profiles and past activities. Single user recommendation has received significant attention in the past due to its extensive use in Amazon and Netflix. How to recommend to a group of users who may or may not share similar tastes, however, is still an open problem. The need for group recommendation arises in many scenarios: a movie for friends to watch together, a travel destination for a family to spend a holiday break, and a good restaurant for colleagues to have a working lunch. Intuitively, items that are ideal for recommendation to a group may be quite different from those for individual members. In this paper, we analyze the desiderata of group recommendation and propose a formal semantics that accounts for both item relevance to a group and disagreements among group members. We design and implement algorithms for efficiently computing group recommendations. We evaluate our group recommendation method through a comprehensive user study conducted on Amazon Mechanical Turk and demonstrate that incorporating disagreements is critical to the effectiveness of group recommendation. We further evaluate the efficiency and scalability of our algorithms on the MovieLens data set with 10M ratings.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841
Optimal aggregation algorithms for middleware
Fagin, R., Lotem, A., & Naor, M. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375567 · Cited by 1,086
The Adaptive Web: Methods and Strategies of Web Personalization
(2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9 · Cited by 710
PolyLens: A Recommender System for Groups of Users
O’Connor, M., Cosley, D., Konstan, J. A., & Riedl, J. (2005) · ECSCW 2001 · doi:10.1007/0-306-48019-0_11 · Cited by 496
Jameson, A., & Smyth, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_20 · Cited by 392
Efficient network aware search in collaborative tagging sites
Amer-Yahia, S., Benedikt, M., Lakshmanan, L. V. S., & Stoyanovich, J. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453934 · Cited by 120
Self-citation
Cited by
Shi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
Fairness in package-to-group recommendations
Serbos, D., Qi, S., Mamoulis, N., Pitoura, E., & Tsaparas, P. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052612 · Cited by 107
Metadata
- Authors
- Amer-Yahia, S., Roy, S. B., Chawlat, A., Das, G., & Yu, C.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 1
- Pages
- 754-765
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2172118809
- Cited by
- 398
- References
- 7
- FWCI
- 26.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.