Abstract
Community detection is typically viewed as a graph clustering problem with early detection algorithms focused on detecting non-overlapping communities and formulating various measures and optimization methods to evaluate the quality of clustering. In recent years, overlapping community detection especially in real-world social networks, has become an important and challenging research area since it introduces the possibility of membership of a vertex in more that one community. Overlapping community detection by its definition implies soft clustering and leads to an ideal application of granular computing methods. In this paper, a hybrid computational geometry approach with Voronoi diagrams and tolerance-based neighborhoods (VTNM) is used to detect overlapping communities in social networks. Voronoi partitioning results in a crisp partition of an Euclidean space and a tolerance relation makes it possible to obtain soft partitions. A Voronoi diagram is a method to partition a plane into regions based on nearness to points in a specific set of sites (seeds). In the VTNM approach, these seeds are used as cores for determining tolerance neighborhoods via a non-transitive binary relation. The intersection of these neighborhoods are used to discover overlapping communities. Our proposed VTNM algorithm was tested with 7 small real-world networks and compared with 11 well-known algorithms. VTNM algorithm shows promising results in terms of the Extended Modularity measure, Average F1-score and Normalized Mutual Information (NMI) measure.
Similar content being viewed by others
References
Atanassov K, Gargov G (1989) Interval valued intuitionistic fuzzy sets. Fuzzy Sets Syst 31(3):343–349
Aurenhammer F (1991) Voronoi diagramsa survey of a fundamental geometric data structure. ACM Comput Surveys (CSUR) 23(3):345–405
Barabási AL (2012) Network science: luck or reason. Nature 489(7417):507–508
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10,008
Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177
Cai Q, Ma L, Gong M, Tian D (2016) A survey on network community detection based on evolutionary computation. Int J Bio-Inspired Comput 8(2):84–98
Cao X, Wang X, Jin D, Cao Y, He D (2013) Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization. Sci Rep 3:2993
Chen Q, Wu TT, Fang M (2013) Detecting local community structures in complex networks based on local degree central nodes. Phys A Stat Mech Appl 392(3):529–537
Chen SM, Lee LW, Liu HC, Yang SW (2012a) Multiattribute decision making based on interval-valued intuitionistic fuzzy values. Expert Syst Appl 39(12):10,343–10,351
Chen SM, Yang MW, Yang SW, Sheu TW, Liau CJ (2012b) Multicriteria fuzzy decision making based on interval-valued intuitionistic fuzzy sets. Expert Syst Appl 39(15):12,085–12,091
Chin JH, Ratnavelu K (2017) A semi-synchronous label propagation algorithm with constraints for community detection in complex networks. Sci Rep 7https://doi.org/10.1038/srep45836
Cui Y, Wang X, Eustace J (2014a) Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks. Phys A Stat Mech Appl 416 https://doi.org/10.1016/j.physa.2014.08.050
Cui Y, Wang X, Li J (2014) Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Phys A Stat Mech Appl 405:85–91. https://doi.org/10.1016/j.physa.2014.03.027
Deritei D, Lázár ZI, Papp I, Járai-Szabó F, Sumi R, Varga L, Regan ER, Ercsey-Ravasz M (2014) Community detection by graph voronoi diagrams. New J Phys 16(6):063,007
Dubois D, Prade H (1990) Rough fuzzy sets and fuzzy rough sets*. Int J Gen Syst 17(2–3):191–209
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75–174
Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1–44
Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826
Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6(04):565–573
Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103,018
Hajiabadi M, Zare H, Bobarshad H (2017) IEDC: an integrated approach for overlapping and non-overlapping community detection. Knowl-Based Syst 123:188–199 (Elsevier)
Kardan V, Ramanna S (2018) Tolerance methods in graph clustering: Application to community detection in social networks. In: International joint conference on rough sets, Springer, New York, pp 73–87
Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing. AcM Press, New York
Kundu S, Pal SK (2015a) FGSN: fuzzy granular social networks model and applications. Inf Sci 314:100–117
Kundu S, Pal SK (2015b) Fuzzy-rough community in social networks. Pattern Recognit Lett 67:145–152
Lancichinetti A, Fortunato S, Kertész J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033,015
Li J, Wang X, Cui Y (2014) Uncovering the overlapping community structure of complex networks by maximal cliques. Phys A Stat Mech Appl 415:398–406. https://doi.org/10.1016/j.physa.2014.08.025
Li Q, Zhong J, Li Q, Wang C, Cao Z (2019) A community merger of optimization algorithm to extract overlapping communities in networks. IEEE Access 7:3994–4005
Li S, Chen Y, Du H, Feldman MW (2010) A genetic algorithm with local search strategy for improved detection of community structure. Complexity 15(4):53–60
Li Y, He K, Kloster K, Bindel D, Hopcroft J (2018) Local spectral clustering for overlapping community detection. ACM Trans Knowl Discov Data 12(2):17:1–17:27
Liu L, Qiu T, Bai X, Lin Z (2015) A community detecting algorithm based on granular computing. In: et al (Eds): DM (ed) Proceedings, rough sets and knowledge technology: 10th international conference, RSKT 2014. Springer International Publishing, Cham, pp 272–284
Liu Q, Liu Q, Yang L, Wang G (2018) A multi-granularity collective behavior analysis approach for online social networks. Granul Comput 3:333–343
Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond B Biol Sci 270(Suppl 2):S186–S188
Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066,133
Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582
Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech Theory Exp 03:P03,024
Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818
Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341–356
Pedrycz W, Chen SM (2014) Social Networks: A Framework of Computational Intelligence. Springer Int. Pub. AG, Cham, Switzerland, https://https://doi.org/10.1007/978-3-319-02993-1
Peters J, Ramanna S (2016) Proximal three-way decisions: Theory and applications in social networks. Knowl-Based Syst 91:4–15 (Elsevier)
Peters JF (2007) Near sets. General theory about nearness of objects. Appl Math Sci 1(53):2609–2629
Peters JF (2007) Near sets. Special theory about nearness of objects. Fundam Inf 75(1–4):407–433
Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036,106
Rossetti G, Pappalardo L, Rinzivillo S (2016) A novel approach to evaluate community detection algorithms on ground truth. In: Complex networks VII, Springer, New York, pp 133–144
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123
Schroeder M, Wright M (1992) Tolerance and weak tolerance relations. J Comb Math Comb Comput 11:123–160
Skowron A, Stepaniuk J (1996) Tolerance approximation spaces. Fundam Inform 27(2,3):245–253
Stepaniuk J (1998) Approximation spaces, reducts and representatives. In: Polkowski L., Skowron A. (eds) Rough sets in knowledge discovery 2. Studies in fuzziness and soft computing, vol. 19, Physica, Heidelberg, pp 109–126
Surendran S, Chithraprasad D, Kaimal MR (2016) A scalable geometric algorithm for community detection from social networks with incremental update. Soci Netw Anal Min 6(1):90
Trivedi K, Ramanna S (2018) Detecting overlapping communities in social networks with Voronoi and tolerance rough sets. International conference on industrial. Springer, Engineering and other applications of applied intelligent systems, pp 670–676
Wang CY, Chen SM (2017) Multiple attribute decision making based on interval-valued intuitionistic fuzzy sets, linear programming methodology, and the extended topsis method. Inf Sci 397–398:155–167
Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25,258–25,269
Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’networks. Nature 393(6684):440–442
Wen X, Chen W, Lin Y, Gu T, Zhang H, Li Y, Yin Y, Zhang J (2017) A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Trans Evol Comput 21(3):363–377
Whang JJ, Gleich DF, Dhillon IS (2013) Overlapping community detection using seed set expansion. In: Proceedings of the 22nd ACM international conference on conference on information & knowledge management, ACM, New York, pp 2099–2108
Wolski M (2010) Perception and classification. a note on near sets and rough sets. Fundam Inf 101:143–155
Wolski M (2013) Granular computing: topological and categorical aspects of near and rough set approaches to granulation of knowledge. In: Transactions on rough sets XVI, Springer, New York, pp 34–52
Wu H, Gao L, Dong J, Yang X (2014) Detecting overlapping protein complexes by rough-fuzzy clustering in protein-protein interaction networks. PloS One 9(3):e91,856
Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv 45(4):43:1–43:35
Yang S (2013) Networks: an Introduction by M. E. J. Newman. J Math Sociol 37:250–251
Zadeh L (1997) Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets Syst 177(19):111–127
Zhang S, Wang RS, Zhang XS (2007) Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys A Stat Mech Appl 374(1):483–490
Zhang Z, Zhang N, Zhong C, Duan L (2015) Detecting overlapping communities with triangle-based rough local expansion method. In: Ciucci D, Wang G, Mitra S, Wu WZ (eds) Proceedings, rough sets and knowledge technology: 10th international conference, RSKT 2015. Springer International Publishing, Cham, pp 446–456
Zhi-Xiao W, Ze-Chao L, Xiao-Fang D, Jin-hui T (2016) Overlapping community detection based on node location analysis. KnowBased Syst 105(C):225–235. https://doi.org/10.1016/j.knosys.2016.05.024
Acknowledgements
This research is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) discovery grant # 194376 and is supported by the Queen Elizabeth II Diamond Jubilee scholarship.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research has been supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grant 194376 and Queen Elizabeth II Diamond Jubilee Scholarship.
Rights and permissions
About this article
Cite this article
Trivedi, K., Ramanna, S. Overlapping community detection in social networks with Voronoi and tolerance neighborhood-based method. Granul. Comput. 6, 95–106 (2021). https://doi.org/10.1007/s41066-019-00207-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41066-019-00207-0