Abstract
Community detection in social networks is a well-studied problem. A community in social network is commonly defined as a group of people whose interactions within the group are more than outside the group. It is believed that people’s behavior can be linked to the behavior of their social neighborhood. While shared characteristics of communities have been used to validate the communities found, to the best of authors’ knowledge, it is not demonstrated in the literature that communities found using social interaction data are like-minded, i.e., they behave similarly in terms of their interest in items (e.g., movie, products). In this paper, we experimentally demonstrate, on a social networking movie rating dataset, that people who are interested in an item are socially better connected than the overall graph. Motivated by this fact, we propose a method for finding communities wherein like-mindedness is an explicit objective. We find small tight groups with many shared interests using a frequent item set mining approach and use these as building blocks for the core of these like-minded communities. We show that these communities have higher similarity in their interests compared to communities found using only the interaction information. We also compare our method against a baseline where the weight of edges are defined based on similarity in interests between nodes and show that our approach achieves far higher level of like-mindedness amongst the communities compared to this baseline as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)
Ahn, S., Shi, C.: Exploring movie recommendation system using cultural metadata. In: Proc. of the 2008 Intl. Conf. on Cyberworlds, pp. 431–438 (2008)
Amatriain, X., Pujol, J.M., Tintarev, N., Oliver, N.: Rate it again: increasing recommendation accuracy by user re-rating. In: Proc. of the third ACM Conf. on Recommender Systems, pp. 173–180 (2009)
Bonhard, P., Sasse, M.: Knowing me, knowing you using profiles and social networking to improve recommender systems. BT Technol. J. 24(3), 84–98 (2006)
Breese, J.S., Heckerman, D., Kadie, C.M.: Empirical analysis of predictive algorithms for collaborative filtering. In: Uncertainty in Artificial Intelligence, pp. 43–52 (1998)
Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24, 1216–1230 (2012). doi:10.1109/TKDE.2010.271
Chen, W., Liu, Z., Sun, X., Wang, Y.: A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21(2), 224–240 (2010)
Clauset, A., Newman, M.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(066111), 1–6 (2004)
Cohn, D., Hofman, T.: The missing link—a probabilistic model of document content and hypertext connectivity. Adv. Neural Inf. Process. Syst. 21, 430–436 (2001)
Cruz, J.D., Bothorel, C., Poulet, F.: Entropy based community detection in augmented social networks. In: International Conference on Computational Aspects of Social Networks (2011). doi:10.1109/CASON.2011.6085937
Dasgupta, K., Singh, R. Viswanathan, B., Chakraborty, D., Mukherjea, S., Nanavati, A.A., Joshi, A.: Social ties and their relevance to churn in mobile telecom networks. In: EDBT, pp. 668–677 (2008)
Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW, pp. 461–470 (2007)
Falkowski, T., Barth, A., Spiliopoulou, M.: DENGRAPH: A density-based community detection algorithm. In: Web Intelligence, pp. 112–115 (2007). doi:10.1109/WI.2007.43
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010). doi:10.1016/j.physrep.2009.11.002. URL: http://www.sciencedirect.com/science/article/B6TVP-4XPYXF1-1/2/99061fac6435db4343b2374d26e64ac1
Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: HYPERTEXT, pp. 225–234 (1998)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(7821), 7821–7826 (2002)
Golbeck, J., Hendler, J.: Filmtrust: movie recommendations using trust in web-based social networks. In: CCNC, pp. 282–286 (2006)
Guy, I., Werdling, N., Carmel, D., Ronen, I., Uziel, E., Yogev, S., Ofek-Koifman, S.: Personalized recommendation of social software items based on social relations. In: RecSys, pp. 53–60 (2009)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation. Data Min. Knowl. Disc. 8, 53–87 (2004)
Hanneman, R.A., Riddle, M.: Introduction to Social Network Methods. University of California, Riverside, CA (2005)
Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: Proc. of the SIGIR, pp. 230–237. ACM, New York, NY (1999)
Jaho, E., Karaliopoulos, M., Stavrakakis, I.: Iscode: a framework for interest similarity-based community detection in social networks. In: INFOCOM WORKSHOPS, pp. 912–917. IEEE (2011)
Kang, Y., Choi, S.: Common neighborhood sub-graph density as a similarity measure for community detection. In: ICONIP (1), pp. 175–184 (2009)
Modani, N., Dey, K.: Large maximal cliques enumeration in sparse graphs. In: CIKM, pp. 1377–1378 (2008)
Nallapati, R.M., Ahmed, A., Xing, E.P., Cohen, W.W.: Joint latent topic models for text and citations. In: Proc. of the 14th ACM SIGKDD (KDD ’08), pp. 542–550. ACM, New York, NY (2008). doi:10.1145/1401890.1401957
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066, 133 (2004)
Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E 68(3), 036122 (2003)
Ono, C., Kurokawa, M., Motomura, Y., Asoh, H.: A context-aware movie preference model using a bayesian network for recommendation and promotion. In: User Modeling, pp. 247–257 (2007)
Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
Pilászy, I., Tikk, D.: Recommending new movies: even a few ratings are more valuable than metadata. In: Proc. of the third ACM Conf. on Recommender Systems, pp. 93–100 (2009)
Qi, G.J., Aggarwal, C.C., Huang, T.: Community detection with edge content in social media networks. In: International Conference on Data Engineering, pp. 534–545 (2012). doi:10.1109/ICDE.2012.77
Said, A., Luca, E.W.D., Albayrak, S.: How social relationships affect user similarities. In: SRS (2010)
Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW, pp. 285–295 (2001)
Silva, A., Wagner Meira, J., Zaki, M.J.: Structural correlation pattern mining for large graphs. In: 8th Workshop on Mining and Learning with Graphs (with SIGKDD) (2010)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: SIGMOD, pp. 1–12 (1996)
Subramani, K., Velkov, A., Ntoutsi, I., Kroger, P., Kriegel, H.P.: Density-based community detection in social networks. In: International Conference on Internet Multimedia Services Architecture and Applications (2011). doi:10.1109/IMSAA.2011.6156357
Sun, H., Huang, J., Han, J., Deng, H., Sun, Y.: SHRINK: A structural clustering algorithm for detecting hierarchical communities in networks. In: CIKM’10, Toronto, Canada (2010)
Wang, J., Jiawei, H., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: SIGKDD, pp. 236–245 (2003)
Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372–390 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Modani, N., Nagar, S., Shannigrahi, S. et al. Like-minded communities: bringing the familiarity and similarity together. World Wide Web 17, 899–919 (2014). https://doi.org/10.1007/s11280-013-0261-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-013-0261-1