Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combining fuzzy information: an overview
ACM SIGMOD Record
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
IEEE Transactions on Knowledge and Data Engineering
PolyLens: a recommender system for groups of users
ECSCW'01 Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work
A group recommendation system with consideration of interactions among group members
Expert Systems with Applications: An International Journal
Case-Based Group Recommendation: Compromising for Success
ICCBR '07 Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
APCHI '08 Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction
Group Recommendation System for Facebook
OTM '08 Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS
Group recommendation: semantics and efficiency
Proceedings of the VLDB Endowment
The adaptive web
A group recommendation system for online communities
International Journal of Information Management: The Journal for Information Professionals
Knowledge-Based Systems
Mobility and social networking: a data management perspective
Proceedings of the VLDB Endowment
RecDB in action: recommendation made easy in relational databases
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Imagine a system that gives you satisfying recommendations when you want to rent a movie with friends or find a restaurant to celebrate a colleague's farewell: at the core of such a system is what we call group recommendation. While computing individual recommendations have received lots of attention (e.g., Netflix prize), group recommendation has been confined to studying users' satisfaction with different aggregation strategies. In this paper (Some results are published in an earlier conference paper (Amer-Yahia et al. in VLDB, 2009). See Sect. "Paper contributions and outline" for details.), we describe the challenges and desiderata of group recommendation and formalize different group consensus semantics that account for both an item's predicted ratings to the group members and the disagreements among them. We focus on the design and implementation of efficient group recommendation algorithms that intelligently prune and merge per-user predicted rating lists and pairwise disagreement lists of items. We further explore the impact of space constraints on maintaining per-user and pairwise item lists and develop two complementary solutions that leverage shared user behavior to maintain the efficiency of our recommendation algorithms within a space budget. The first solution, behavior factoring, factors out user agreements from disagreement lists, while the second solution, partial materialization, selectively materializes a subset of disagreement lists. Finally, we demonstrate the usefulness of our group recommendations and the efficiency and scalability of our algorithms using an extensive set of experiments on the 10 M ratings MovieLens data set.