Abstract
Once we subscribe to an e-commerce portal, or to a social media website, we interact with multiple brands and with content from numerous providers. However, a unique user profile is created, containing all our preferences. Suppose that a company wants to understand who are its customers. It wants to treat costumers as a target, and understand what campaigns the company should run on them. On the one hand, an approach that clusters the users and performs group recommendations would be useful, while on the other hand, a generic user profile would not be helpful, since the preferences in it are not specific for a brand. Hence, we have to determine multiple user clusterings (one for each brand). This task makes the problem of producing group recommendation challenging, since little and very sparse information about the users is available, and for each pair of users we have to detect as many similarities as the brands existing in the system. To tackle this problem, in this paper, we introduce a novel and optimal measure to compute the similarity between users, based on Kolmogorov complexity. Further, we test it in the group recommendation scenario. The results show that our similarity measure can provide similar accuracy when compared to classical measures, but with significant performance gains, having a strictly lower time complexity than the state-of-the-art similarity measure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In order to speed up the process furthermore and embrace the concept of fast group recommendation proposed by Ntoutsi et al. [32], we also considered an alternative to the KNN approach, in which the neighbors were only selected inside the cluster of the target user. However, results show that, in our context, the effectiveness decreases. These results are not presented, to improve the readability of the paper.
References
Ardissono, L., Goy, A., Petrone, G., Segnan, M., Torasso, P.: Intrigue: personalized recommendation of tourist attractions for desktop and hand held devices. Appl. Artif. Intell. 17(8–9), 687–714 (2003)
Boratto, L.: Group recommender systems. In: Sen, S., Geyer, W., Freyne, J., Castells, P. (eds.) Proceedings of the 10th ACM Conference on Recommender Systems, Boston, MA, USA, 15–19 September 2016, pp. 427–428. ACM (2016)
Boratto, L.: Group recommender systems: state of the art, emerging aspects and techniques, and research challenges. In: Ferro, N., et al. (eds.) ECIR 2016. LNCS, vol. 9626, pp. 889–892. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30671-1_87
Boratto, L., Carta, S.: State-of-the-art in group recommendation and new approaches for automatic identification of groups. In: Soro, A., Vargiu, E., Armano, G., Paddeu, G. (eds.) Information Retrieval and Mining in Distributed Environments. Studies in Computational Intelligence, vol. 324, pp. 1–20. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-16089-9_1
Boratto, L., Carta, S.: Modeling the preferences of a group of users detected by clustering: a group recommendation case-study. In: Akerkar, R., Bassiliades, N., Davies, J., Ermolayev, V. (eds.) 4th International Conference on Web Intelligence, Mining and Semantics (WIMS 14), WIMS 2014, Thessaloniki, Greece, 2–4 June 2014, pp. 16:1–16:7. ACM (2014)
Boratto, L., Carta, S.: Using collaborative filtering to overcome the curse of dimensionality when clustering users in a group recommender system. In: Hammoudi, S., Maciaszek, L.A., Cordeiro, J. (eds.) ICEIS 2014 - Proceedings of the 16th International Conference on Enterprise Information Systems, Volume 2, Lisbon, Portugal, 27–30 April 2014, pp. 564–572. SciTePress (2014)
Boratto, L., Carta, S.: ART: group recommendation approaches for automatically detected groups. Int. J. Mach. Learn. Cybernet. 6(6), 953–980 (2015). https://doi.org/10.1007/s13042-015-0371-4
Boratto, L., Carta, S.: The rating prediction task in a group recommender system that automatically detects groups: architectures, algorithms, and performance evaluation. J. Intell. Inf. Syst. 45(2), 221–245 (2014). https://doi.org/10.1007/s10844-014-0346-z
Boratto, L., Carta, S., Fenu, G.: Discovery and representation of the preferences of automatically detected groups: exploiting the link between group modeling and clustering. Future Gener. Comput. Syst. 64, 165–174 (2016)
Boratto, L., Carta, S., Fenu, G.: Investigating the role of the rating prediction task in granularity-based group recommender systems and big data scenarios. Inf. Sci. 378, 424–443 (2017)
Boratto, L., Carta, S., Fenu, G., Mulas, F., Pilloni, P.: Influence of rating prediction on group recommendation’s accuracy. IEEE Intell. Syst. 31(6), 22–27 (2016)
Boratto, L., Carta, S., Fenu, G., Mulas, F., Pilloni, P.: Influence of rating prediction on the accuracy of a group recommender system that detects groups. IEEE Intell. Syst., 1 (2017)
Boratto, L., Carta, S., Satta, M.; Groups identification and individual recommendations in group recommendation algorithms. In: Picault, J., Kostadinov, D., Castells, P., Jaimes, A. (eds.) Proceedings of the Workshop on the Practical Use of Recommender Systems, Algorithms and Technologies, PRSAT 2010, Barcelona, Spain, 30 September 2010, vol. 676 of CEUR Workshop Proceedings, pp. 27–34 (2010). CEUR-WS.org
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (2012)
De Pessemier, T., Dhondt, J., Vanhecke, K., Martens, L.: TravelWithFriends: a hybrid group recommender system for travel destinations. In Proceedings of the Workshop on Tourism Recommender Systems, in Conjunction with the 9th ACM Conference on Recommender Systems, pp. 51–60 (2015)
Delic, A., et al.: Observing group decision making processes. In: Proceedings of the 10th ACM Conference on Recommender Systems, RecSys 2016, pp. 147–150. ACM, New York (2016)
Goren-Bar, D., Glinansky, O.: Fit-recommend ing TV programs to family members. Comput. Graph. 28(2), 149–156 (2004)
Hartigan, J.A., Wong, M.A.: Algorithm as 136: a k-means clustering algorithm. J. Roy. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100–108 (1979)
Holmes, M., Gray, A., Isbell, C.: Fast svd for large-scale matrices. In: Workshop on Efficient Machine Learning at NIPS, vol. 58, pp. 249–252 (2007)
Hug, N.: Surprise, a Python library for recommender systems (2017). http://surpriselib.com
Jameson, A., Smyth, B.: Recommendation to groups. In: Brusilovsky, P., Kobsa, A., Nejdl, W. (eds.) The Adaptive Web. LNCS, vol. 4321, pp. 596–627. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72079-9_20
Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 426–434. ACM (2008)
Koren, Y.: Factor in the neighbors: scalable and accurate collaborative filtering. ACM Trans. Knowl. Discovery Data (TKDD) 4(1), 1 (2010)
Lee Rodgers, J., Nicewander, W.A.: Thirteen ways to look at the correlation coefficient. Am. Stat. 42(1), 59–66 (1988)
Li, M., Chen, X., Li, X., Ma, B., Vitányi, P.M.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250–3264 (2004)
MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281–297 (1967)
Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 274–285. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00202-1_24
Masthoff, J.: Group recommender systems: aggregation, satisfaction and group attributes. In: Ricci, F., Rokach, L., Shapira, B. (eds.) Recommender Systems Handbook, pp. 743–776. Springer, Boston, MA (2015). https://doi.org/10.1007/978-1-4899-7637-6_22
McCarthy, J.F., Anagnost, T.D.: MusicFX: an arbiter of group preferences for computer supported collaborative workouts. In: Poltrock, S.E., Grudin, J. (eds.) CSCW 1998, Proceedings of the ACM 1998 Conference on Computer Supported Cooperative Work, Seattle, WA, USA, 14–18 November 1998, pp. 363–372. ACM (1998)
McCarthy, K., Salamó, M., Coyle, L., McGinty, L., Smyth, B., Nixon, P.: Cats: a synchronous approach to collaborative group recommendation. In: Sutcliffe, G., Goebel, R. (eds.) Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference, Melbourne Beach, Florida, USA, 11–13 May 2006, pp. 86–91. AAAI Press (2006)
Mnih, A., Salakhutdinov, R.R.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems, pp. 1257–1264 (2008)
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). https://doi.org/10.1007/978-3-642-34002-4_10
O’Connor, M., Cosley, D., Konstan, J.A., Riedl, J.: PolyLens: a recommender system for groups of users. In: Prinz, W., Jarke, M., Rogers, Y., Schmidt, K., Wulf, V. (eds.) Proceedings of the Seventh European Conference on Computer Supported Cooperative Work, Bonn, Germany, 16–20 September 2001, pp. 199–218. Kluwer (2001)
O’Mahony, M.: Sensory Evaluation of Food: Statistical Methods and Procedures, vol. 16. CRC Press, Boca Raton (1986)
Ramos, G., Boratto, L., Caleiro, C.: On the negative impact of social influence in recommender systems: a study of bribery in collaborative hybrid algorithms. Inf. Process. Manag. 57(2), 102058 (2020)
Recalde, L., Mendieta, J., Boratto, L., Teran, L., Vaca, C., Baquerizo, G.: Who you should not follow: extracting word embeddings from tweets to identify groups of interest and hijackers in demonstrations. IEEE Trans. Emerging Top. Comput., 1 (2017)
Alhajj, R., Rokne, J. (eds.): Encyclopedia of Social Network Analysis and Mining. Springer, New York (2014). https://doi.org/10.1007/978-1-4614-6170-8
Sánchez, L.Q., Díaz-Agudo, B., Recio-García, J.A.: Development of a group recommender application in a social network. Knowl. Based Syst. 71, 72–85 (2014)
Saúde, J., Ramos, G., Caleiro, C., Kar, S.: Reputation-based ranking systems and their resistance to bribery. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 1063–1068. IEEE (2017)
Brusilovsky, P., Kobsa, A., Nejdl, W. (eds.): The Adaptive Web. LNCS, vol. 4321. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72079-9
Williams, R.N.: An extremely fast ziv-lempel data compression algorithm. In: Data Compression Conference, DCC 1991, pp. 362–371. IEEE (1991)
Yu, Z., Zhou, X., Hao, Y., Gu, J.: TV program recommendation for multiple viewers based on user profile merging. User Model. User Adap. Inter. 16(1), 63–82 (2006)
Acknowledgments
G. Ramos is with Department of Electrical and Computer Engineering, Faculty of Engineering, University of Porto, Portugal. This work was supported in part by FCT project POCI-01-0145-FEDER-031411-HARMONY. Further, this work was developed under the scope of R&D Unit 50008, financed by the applicable financial framework (FCT/MEC through national funds and when applicable co-funded by FEDER - PT2020 partnership agreement). The first author acknowledges the support of the DP-PMI and Fundação para a Ciência e a Tecnologia (Portugal), through scholarship SFRH/BD/52242/2013 and the support of Instituto de Telecomunicações through the research grant - BIM/No154 - 16/11/2017 - UID/EEA/50008/2017.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Ramos, G., Caleiro, C. (2020). A Novel Similarity Measure for Group Recommender Systems with Optimal Time Complexity. In: Boratto, L., Faralli, S., Marras, M., Stilo, G. (eds) Bias and Social Aspects in Search and Recommendation. BIAS 2020. Communications in Computer and Information Science, vol 1245. Springer, Cham. https://doi.org/10.1007/978-3-030-52485-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-52485-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-52484-5
Online ISBN: 978-3-030-52485-2
eBook Packages: Computer ScienceComputer Science (R0)