Advertisement

Coordinating Disagreement and Satisfaction in Group Formation for Recommendation

  • Lin XiaoEmail author
  • Gu Zhaoquan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10570)

Abstract

Group recommendation has attracted significant research efforts for its importance in benefiting a group of users. There are two steps involved in this process, which are group formation and making recommendations. The studies on making recommendations to a given group has been studied extensively, however seldom investigation has been put into the essential problem of how the groups should be formed. As pointed in existing studies on group recommendation, both satisfaction and disagreement are important factors in terms of recommendation quality. Satisfaction reflects the degree to which the item is preferred by the members; while disagreement reflects the level at which members disagree with each other. As it is difficult to solve group formation problem, none of existing studies ever considered both factors in group formation.

This paper investigates the satisfaction and disagreement aware group formation problem in group recommendation. In this work, we present a formulation of the satisfaction and disagreement aware group formation problem. We design an efficient optimization algorithm based on Projected Gradient Descent and further propose a swapping alike algorithm that accommodates to large datasets. We conduct extensive experiments on real-world datasets and the results verify that the performance of our algorithm is close to optimal. More importantly, our work reveals that proper group formation can lead to better performances of group recommendation in different scenarios. To our knowledge, we are the first to study the group formation problem with satisfaction and disagreement awareness for group recommendation.

Keywords

Group recommendation Group formation Satisfaction and disagreement Projected Gradient Descent 

Notes

Acknowledgement

This work is supported in part by China Grant U1636215, 61572492, and the Hong Kong Scholars Program.

References

  1. 1.
    Amer-Yahia, S., Roy, S.B., Chawlat, A., Das, G., Yu, C.: Group recommendation: Semantics and efficiency. Proc. VLDB Endow. 2(1), 754–765 (2009)CrossRefGoogle Scholar
  2. 2.
    Banerjee, A., Dhillon, I., Ghosh, J., Merugu, S., Modha, D.S.: A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. J. Mach. Learn. Res. 8, 1919–1986 (2007)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)CrossRefGoogle Scholar
  4. 4.
    Cheng, J., Yuan, T., Wang, J., Lu, H.: Group latent factor model for recommendation with multiple user behaviors. In: SIGIR 2014. ACM, New York (2014)Google Scholar
  5. 5.
    Crossen, A., Budzik, J., Hammond, K.J.: Flytrap: Intelligent group music recommendation. In: IUI 2002. ACM, New York (2002)Google Scholar
  6. 6.
    Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: KDD 2001. ACM, New York (2001)Google Scholar
  7. 7.
    Liao, Y., Lam, W., Jameel, S., Schockaert, S., Xie, X.: Who wants to join me? Companion recommendation in location based social networks. In: ICTIR 2016. ACM, New York (2016)Google Scholar
  8. 8.
    Ntoutsi, E., Stefanidis, K., Nørvåg, K., Kriegel, H.-P.: Fast group recommendations by applying user clustering. In: Atzeni, P., Cheung, D., Ram, S. (eds.) ER 2012. LNCS, vol. 7532, pp. 126–140. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-34002-4_10CrossRefGoogle Scholar
  9. 9.
    O’Connor, M., Cosley, D., Konstan, J.A., Riedl, J.: PolyLens: A Recommender System for Groups of Users, pp. 199–218. Springer Netherlands, Dordrecht (2001)Google Scholar
  10. 10.
    Piotr Skowron, P.F., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. CoRR abs/1402.3044 (2014)Google Scholar
  11. 11.
    Quintarelli, E., Rabosio, E., Tanca, L.: Recommending new items to ephemeral groups using contextual user influence. In: RecSys 2016. ACM, New York (2016)Google Scholar
  12. 12.
    Raju, B., Bhatt, R.P.: Real-time bid optimization for group-buying ads. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 1707–1711, CIKM 2012. ACM, New York (2012)Google Scholar
  13. 13.
    Ricci, F., Rokach, L., Shapira, B.: Introduction to Recommender Systems Handbook. Springer, Boston (2011)CrossRefGoogle Scholar
  14. 14.
    Ronen, I., Guy, I., Kravi, E., Barnea, M.: Recommending social media content to community owners. In: SIGIR 2014. ACM, New York (2014)Google Scholar
  15. 15.
    Salakhutdinov, R., Mnih, A.: Bayesian probabilistic matrix factorization using markov chain monte carlo. In: ICML 2008. ACM, New York (2008)Google Scholar
  16. 16.
    Salehi-Abari, A., Boutilier, C.: Preference-oriented social networks: group recommendation and inference. In: RecSys 2015. ACM, New York (2015)Google Scholar
  17. 17.
    Senjuti Basu Roy, L.V.L., Liu, R.: From group recommendations to group formation. In: SIGMOD 2015. ACM, New York (2015)Google Scholar
  18. 18.
    Shan, H., Banerjee, A.: Bayesian co-clustering. In: ICDM 2008. IEEE Computer Society, Washington, DC (2008)Google Scholar
  19. 19.
    Shlomo, B., Jill, F.: Group-based recipe recommendations: analysis of data aggregation strategies. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 111–118, RecSys 2010. ACM, New York (2010)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute of Interdisciplinary Information SciencesTsinghua UniversityBeijingChina
  2. 2.Department of Computer ScienceGuangZhou Univeristy and The University of Hong KongHong KongChina

Personalised recommendations