skip to main content
research-article

Group recommendation: semantics and efficiency

Published:01 August 2009Publication History
Skip Abstract Section

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.

References

  1. G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng., 17(6), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Amer-Yahia, M. Benedikt, L. Lakshmanan, and J. Stoyanovich. Efficient Network-Aware Search in Collaborative Tagging Sites. In VLDB, 2008.Google ScholarGoogle Scholar
  3. S. Amer-Yahia, L. Lakshmanan, and C. Yu. SocialScope: Enabling Information Discovery on Social Content Sites. In CIDR, 2009.Google ScholarGoogle Scholar
  4. M. J. Carey and D. Kossmann. On saying "enough already!" in sql. In SIGMOD, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Fagin. Combining fuzzy information: an overview. SIGMOD Record, 32(2):109--118, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. Fagin and et. al. Optimal Aggregation Algorithms for Middleware. In PODS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. GroupLens at University of Minnesota. http://www.grouplens.org/node/73.Google ScholarGoogle Scholar
  9. A. Jameson and B. Smyth. The Adaptive Web, volume 4321 of LNCS, chapter Recommendation to Groups, page 596. Springer-Verlag, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. K. Jarvelin and K. Kekalainen. Cumulated gain-based evaluation of ir techniques. ACM TOIS, 20(4), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. A. Konstan. Introduction to recommender systems. In SIGIR, 2007.Google ScholarGoogle Scholar
  12. A. Marian, S. Amer-Yahia, N. Koudas, and D. Srivastava. Adaptive processing of top-k queries in xml. In ICDE, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. O'Connor, D. Cosley, J. A. Konstan, and J. Riedl. Polylens: A recommender system for groups of user. In ECSCW, pages 199--218, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Stoyanovich, S. Amer-Yahia, C. Marlow, and C. Yu. A Study of the Benefit of Leveraging Tagging Behavior to Model UsersÍnterests in del.icio.us. In AAAI Spring Symposium on Social Information Processing, 2008.Google ScholarGoogle Scholar

Index Terms

  1. Group recommendation: semantics and efficiency

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader