skip to main content
research-article
Open Access

Ensemble Detection and Analysis of Communities in Complex Networks

Published:12 March 2020Publication History
Skip Abstract Section

Abstract

Though much work has been done on ensemble clustering in data mining, the application of ensemble methods to community detection in networks is in its infancy. In this article, we propose MeDOF, an ensemble method which performs disjoint, overlapping, and fuzzy community detection and represents one of the first ever ensemble methods for fuzzy and overlapping community detection. We run extensive experiments on both synthetic and several real-world datasets for which community structures are known. We show that MeDOF beats the best-known existing stand-alone community detection algorithms. We further show that MeDOF can help explore core-periphery structure of network communities, identify stable communities in dynamic networks, and help solve the “degeneracy of solutions” problem, generating robust results.

References

  1. Prerna Agarwal, Richa Verma, Ayush Agarwal, and Tanmoy Chakraborty. 2018. DyPerm: Maximizing permanence for dynamic community detection. In Proceedings of the 22nd Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD’18), Part I. 437--449. DOI:https://doi.org/10.1007/978-3-319-93034-3_35Google ScholarGoogle Scholar
  2. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. 2010. Link communities reveal multiscale complexity in networks. Nature 466 (2010), 761--764.Google ScholarGoogle ScholarCross RefCross Ref
  3. David A. Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner (Eds.). 2013. In Proceedings of the 10th DIMACS Implementation Challenge Workshop on Graph Partitioning and Graph Clustering. Contemporary Mathematics, Vol. 588. American Mathematical Society.Google ScholarGoogle Scholar
  4. Jeffrey Baumes, Mark Goldberg, and Malik Magdon-Ismail. 2005. Efficient identification of overlapping communities. In Proceedings of the 2005 IEEE International Conference on Intelligence and Security Informatics (ISI’05). Springer-Verlag, Berlin, 27--36.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Jeffrey Baumes, Mark K. Goldberg, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail, and Nathan Preston. 2005. Finding communities by clustering a graph into overlapping subgraphs. In IADIS AC. IADIS, 97--104.Google ScholarGoogle Scholar
  6. Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. J. Stat. Mech (2008), P10008.Google ScholarGoogle Scholar
  7. Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir. 2007. From the cover: A model of internet topology using k-shell decomposition. Proc. Natl. Acad. Sci. U.S.A. 104, 27 (2007), 11150--11154. DOI:https://doi.org/10.1073/pnas.0701175104 arXiv:http://www.pnas.org/cgi/reprint/104/27/11150.pdf.Google ScholarGoogle ScholarCross RefCross Ref
  8. Tanmoy Chakraborty. 2015. Leveraging disjoint communities for detecting overlapping community structure. J. Stat. Mech.: Theory Exp. 2015, 5 (2015), P05017. http://stacks.iop.org/1742-5468/2015/i=5/a=P05017Google ScholarGoogle ScholarCross RefCross Ref
  9. Tanmoy Chakraborty. 2017. On the discovery of invariant groups in complex networks. J. Complex Networks 5, 5 (2017), 734--749. DOI:https://doi.org/10.1093/comnet/cnx004Google ScholarGoogle Scholar
  10. Tanmoy Chakraborty, Ayushi Dalmia, Animesh Mukherjee, and Niloy Ganguly. 2017. Metrics for community analysis: A survey. ACM Comput. Surv. 50, 4 (Aug. 2017), Article 54, 37 pages. DOI:https://doi.org/10.1145/3091106Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Tanmoy Chakraborty, Saptarshi Ghosh, and Noseong Park. 2019. Ensemble-based overlapping community detection using disjoint community structures. Knowl.-Based Syst. 163 (2019), 241--251. DOI:https://doi.org/10.1016/j.knosys.2018.08.033Google ScholarGoogle ScholarCross RefCross Ref
  12. Tanmoy Chakraborty, Natawar Modani, Ramasuri Narayanam, and Seema Nagar. 2015. DiSCern: A diversified citation recommendation system for scientific queries. In Proceedings of the 2015 IEEE 31st International Conference on Data Engineering. 555--566. DOI:https://doi.org/10.1109/ICDE.2015.7113314Google ScholarGoogle Scholar
  13. Tanmoy Chakraborty, Noseong Park, and V. S. Subrahmanian. 2016. Ensemble-based algorithms to detect disjoint and overlapping communities in networks. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM’16). 73--80. DOI:https://doi.org/10.1109/ASONAM.2016.7752216Google ScholarGoogle Scholar
  14. Tanmoy Chakraborty, Sandipan Sikdar, Vihar Tammana, Niloy Ganguly, and Animesh Mukherjee. 2013. Computer science fields as ground-truth communities: Their impact, rise and fall. In ASONAM. ACM, 426--433.Google ScholarGoogle Scholar
  15. Tanmoy Chakraborty, Sriram Srinivasan, Niloy Ganguly, Sanjukta Bhowmick, and Animesh Mukherjee. 2013. Constant communities in complex networks. Sci. Rep. 3 (May 2013).Google ScholarGoogle Scholar
  16. Tanmoy Chakraborty, Sriram Srinivasan, Niloy Ganguly, Animesh Mukherjee, and Sanjukta Bhowmick. 2014. On the permanence of vertices in network communities. In SIGKDD. New York, 1396--1405.Google ScholarGoogle Scholar
  17. Tanmoy Chakraborty, Sriram Srinivasan, Niloy Ganguly, Animesh Mukherjee, and Sanjukta Bhowmick. 2016. Permanence and community structure in complex networks. ACM Trans. Knowl. Discov. Data 11, 2 (Nov. 2016), Article 14, 34 pages. DOI:https://doi.org/10.1145/2953883Google ScholarGoogle Scholar
  18. Duanbing Chen, Mingsheng Shang, Zehua Lv, and Yan Fu. 2010. Detecting overlapping communities of weighted networks via a local algorithm. Physica A 389, 19 (2010), 4177--4187.Google ScholarGoogle ScholarCross RefCross Ref
  19. Wei Chen, Zhenming Liu, Xiaorui Sun, and Yajun Wang. 2010. A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21, 2 (Sept. 2010), 224--240.Google ScholarGoogle Scholar
  20. Cheng Chao Long Ke-zhen Yang De-pin Chen Xiao-qiang, and Zhou Li-hua. 2015. Detecting stable communities in dynamic networks. J. Chinese Comput. Syst. 36, 9 (2015), Article 1977, 4 pages. http://xwxt.sict.ac.cn/EN/abstract/article_3050.shtml.Google ScholarGoogle Scholar
  21. Aaron Clauset, M. E. J. Newman, and Cristopher Moore. 2004. Finding community structure in very large networks. Phys. Rev. E 70, 6 (2004), 066111.Google ScholarGoogle ScholarCross RefCross Ref
  22. L. M. Collins and C. W. Dent. 1988. Omega: A general formulation of the rand index of cluster recovery suitable for non-disjoint solutions. Multivar. Behav. Res. 23, 2 (1988), 231--242.Google ScholarGoogle ScholarCross RefCross Ref
  23. Johan Dahlin and Pontus Svenson. 2013. Ensemble approaches for improving community detection methods. CoRR abs/1309.0242 (2013).Google ScholarGoogle Scholar
  24. L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas. 2005. Comparing community structure identification. J. Stat. Mech. 9 (2005), P09008.Google ScholarGoogle ScholarCross RefCross Ref
  25. George B. Davis and Kathleen M. Carley. 2008. Clearing the FOG: Fuzzy, overlapping groups for social networks. Soc. Netw. 30, 3 (2008), 201--212. http://dblp.uni-trier.de/db/journals/socnet/socnet30.html#DavisC08.Google ScholarGoogle ScholarCross RefCross Ref
  26. Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, and Alessandro Provetti. 2013. Enhancing community detection using a network weighting strategy. J. Inf. Sci. 222 (Feb. 2013), 648--668.Google ScholarGoogle Scholar
  27. F. Ding, Z. Luo, J. Shi, and X. Fang. 2010. Overlapping community detection by kernel-based fuzzy affinity propagation. In ISA. 1--4.Google ScholarGoogle Scholar
  28. Nan Du, Bai Wang, and Bin Wu. 2008. Overlapping community structure detection in networks. In CIKM. ACM, New York, 1371--1372.Google ScholarGoogle Scholar
  29. N. Eagle, A. Pentland, and D. Lazer. 2007. Inferring social network structure using mobile phone data. Proc. Natl. Acad. Sci. U.S.A. (2007).Google ScholarGoogle Scholar
  30. Illés Farkas, Dániel Ábel, Gergely Palla, and Tamás Vicsek. 2007. Weighted network modules. New J. Phys. 9, 6 (2007), 180.Google ScholarGoogle ScholarCross RefCross Ref
  31. Xiaoli Zhang Fern and Carla E. Brodley. 2003. Random projection for high dimensional data clustering: A cluster ensemble approach. In ICML, Tom Fawcett and Nina Mishra (Eds.). AAAI Press, 186--193. http://dblp.uni-trier.de/db/conf/icml/icml2003.html#FernB03a.Google ScholarGoogle Scholar
  32. Xiaoli Z. Fern and Wei Lin. 2008. Cluster ensemble selection. Stat. Anal. Data Mining 1, 3 (2008), 128--141. DOI:https://doi.org/10.1002/sam.10008Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Xiaoli Z. Fern and Wei Lin. 2008. Cluster ensemble selection. In SDM (2008-06-11). SIAM, 787--797. http://dblp.uni-trier.de/db/conf/sdm/sdm2008.html#FernL08.Google ScholarGoogle Scholar
  34. Santo Fortunato. 2010. Community detection in graphs. Phys. Rep. 486, 3--5 (2010), 75--174. DOI:10.1016/j.physrep.2009.11.002Google ScholarGoogle ScholarCross RefCross Ref
  35. Santo Fortunato and Andrea Lancichinetti. 2009. Community detection algorithms: A comparative analysis: Invited presentation, extended abstract. In Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools. ICST, 27:1--27:2.Google ScholarGoogle Scholar
  36. Yoav Freund. 1995. Boosting a weak learning algorithm by majority. Inf. Comput. 121, 2 (Sept. 1995), 256--285. DOI:https://doi.org/10.1006/inco.1995.1136Google ScholarGoogle Scholar
  37. M. Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99, 12 (2002), 7821--7826.Google ScholarGoogle Scholar
  38. B. H. Good, Y. A. De Montjoye, and A. Clauset. 2010. Performance of modularity maximization in practical contexts. Phys. Rev. E 81, 4 (2010), 046106.Google ScholarGoogle ScholarCross RefCross Ref
  39. Steve Gregory. 2007. An algorithm to find overlapping community structure in networks. In PKDD. Springer-Verlag, Berlin, 91--102.Google ScholarGoogle Scholar
  40. Steve Gregory. 2010. Finding overlapping communities in networks by label propagation. New J. Phys. 12, 10 (2010), 103018.Google ScholarGoogle ScholarCross RefCross Ref
  41. Steve Gregory. 2011. Fuzzy overlapping communities in networks. J. Stat. Mech.: Theory Exp. 2011, 2 (2011), P02017. http://stacks.iop.org/1742-5468/2011/i=02/a=P02017Google ScholarGoogle ScholarCross RefCross Ref
  42. Roger Guimera and Luis A. Nunes Amaral. 2005. Functional cartography of complex metabolic networks. Nature 433, 7028 (Feb. 2005), 895--900.Google ScholarGoogle ScholarCross RefCross Ref
  43. K. Cai, H. Shen, X. Cheng, and M. B. Hu. 2009. Detect overlapping and hierarchical community structure in networks. Phys. A 388, 8 (2009), 1706--1712.Google ScholarGoogle Scholar
  44. Stefan T. Hadjitodorov, Ludmila I. Kuncheva, and Ludmila P. Todorova. 2006. Moderate diversity for better cluster ensembles. Inf. Fusion 7, 3 (Sept. 2006), 264--275. DOI:https://doi.org/10.1016/j.inffus.2005.01.008Google ScholarGoogle Scholar
  45. Frank Havemann, Michael Heinz, Alexander Struck, and Jochen Gläser. 2011. Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels. J. Stat. Mech.: Theory Exp. 2011, 1 (2011), P01023.Google ScholarGoogle ScholarCross RefCross Ref
  46. L. Hubert and P. Arabie. 1985. Comparing partitions. J. Class. 2, 1 (1985), 193--218.Google ScholarGoogle ScholarCross RefCross Ref
  47. Eyke Hüllermeier, Maria Rifqi, Sascha Henzgen, and Robin Senge. 2012. Comparing fuzzy partitions: A generalization of the Rand index and related measures. IEEE Trans. Fuzzy Syst. 20, 3 (2012), 546--556. http://dblp.uni-trier.de/db/journals/tfs/tfs20.html#HullermeierRHS12.Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Lorenzo Isella, Juliette Stehlé, Alain Barrat, Ciro Cattuto, Jean-François Pinton, and Wouter Van den Broeck. 2011. What’s in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271, 1 (2011), 166--180.Google ScholarGoogle Scholar
  49. A. István, Robin Palotai, Máté S. Szalay, and Peter Kovács Csermely. 2010. Community landscapes: An integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics. PLoS One 5, 9 (9 2010), e12528.Google ScholarGoogle Scholar
  50. Lucas G. S. Jeub, Prakash Balachandran, Mason A. Porter, Peter J. Mucha, and Michael W. Mahoney. 2015. Think locally, act locally: Detection of small, medium-sized, and large communities in large networks. Phys. Rev. E 91, 1 (2015), 012821.Google ScholarGoogle ScholarCross RefCross Ref
  51. Rushed Kanawati. 2014. YASCA: A collective intelligence approach for community detection in complex networks. CoRR abs/1401.4472 (2014).Google ScholarGoogle Scholar
  52. Rushed Kanawati. 2014. YASCA: An ensemble-based approach for community detection in complex networks. In COCOON. Springer, Cham, 657--666.Google ScholarGoogle Scholar
  53. Rushed Kanawati. 2015. Ensemble selection for community detection in complex networks. In SCSM. Springer, CA, 138--147.Google ScholarGoogle Scholar
  54. Vikas Kawadia and Sameet Sreenivasan. 2012. Sequential detection of temporal communities by estrangement confinement. Sci. Rep. 2 (Nov. 2012).Google ScholarGoogle Scholar
  55. Kyle Kloster and David F. Gleich. 2015. Personalized pagerank solution paths. CoRR abs/1503.00322 (2015). http://arxiv.org/abs/1503.00322Google ScholarGoogle Scholar
  56. L. I. Kuncheva and S. T. Hadjitodorov. 2004. Using diversity in cluster ensembles. In IEEE International Conference on Systems, Man and Cybernetics, Vol. 2. 1214--1219. DOI:https://doi.org/10.1109/ICSMC.2004.1399790Google ScholarGoogle Scholar
  57. Andrea Lancichinetti and Santo Fortunato. 2009. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phy. Rev. E 80 (2009), 016118.Google ScholarGoogle Scholar
  58. Andrea Lancichinetti and Santo Fortunato. 2012. Consensus clustering in complex networks. Sci. Rep. 2 (2012).Google ScholarGoogle Scholar
  59. Andrea Lancichinetti, Santo Fortunato, and János Kertész. 2009. Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11, 3 (2009), 033015.Google ScholarGoogle ScholarCross RefCross Ref
  60. A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato. 2011. Finding statistically significant communities in networks. PLoS One 6, 4 (2011), e18961.Google ScholarGoogle ScholarCross RefCross Ref
  61. C. Lee, F. Reid, A. McDaid, and N. Hurley. 2010. Detecting highly-overlapping community structure by greedy clique expansion. In ACM KDD-SNA. 33--42.Google ScholarGoogle Scholar
  62. Jian Li, Ke Yi, and Qin Zhang. 2010. Clustering with Diversity. Springer, Berlin, 188--200.Google ScholarGoogle Scholar
  63. David Lusseau, Karsten Schneider, Oliver J Boisseau, Patti Haase, Elisabeth Slooten, and Steve M. Dawson. 2003. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54, 4 (2003), 396--405.Google ScholarGoogle ScholarCross RefCross Ref
  64. Rossana Mastrandrea, Julie Fournet, and Alain Barrat. 2015. Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS One 10, 9 (2015), e0136497.Google ScholarGoogle ScholarCross RefCross Ref
  65. Aaron McDaid and Neil Hurley. 2010. Detecting highly overlapping communities with model-based overlapping seed expansion. In ASONAM. Washington, DC, 112--119.Google ScholarGoogle Scholar
  66. Aaron F. McDaid, Derek Greene, and Neil J. Hurley. 2011. Normalized mutual information to evaluate overlapping community finding algorithms. CoRR abs/1110.2515 (2011).Google ScholarGoogle Scholar
  67. Qiaozhu Mei, Jian Guo, and Dragomir Radev. 2010. DivRank: The interplay of prestige and diversity in information networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’10). ACM, New York, 1009--1018. DOI:https://doi.org/10.1145/1835804.1835931Google ScholarGoogle ScholarDigital LibraryDigital Library
  68. Bivas Mitra, Lionel Tabourier, and Camille Roth. 2011. Intrinsically dynamic network communities. CoRR abs/1111.2018 (2011).Google ScholarGoogle Scholar
  69. Gabriel Murray, Giuseppe Carenini, and Raymond Ng. 2012. Using the omega index for evaluating abstractive community detection. In Proceedings of the Workshop on Evaluation Metrics and System Comparison for Automatic Summarization. Association for Computational Linguistics, Stroudsburg, PA, 10--18. http://dl.acm.org/citation.cfm?id=2391258.2391260Google ScholarGoogle ScholarDigital LibraryDigital Library
  70. Tamás Nepusz, Andrea Petróczi, László Négyessy, and Fülöp Bazsó. 2008. Fuzzy communities and the concept of bridgeness in complex networks. Phys. Rev. E 77, 1 (Jan. 2008), 016107. https://doi.org/10.1103/PhysRevE.77.016107Google ScholarGoogle ScholarCross RefCross Ref
  71. M. E. Newman. 2006. Modularity and community structure in networks. Proc. Natl. Acad. Sci. U.S.A. 103, 23 (2006), 8577--8582.Google ScholarGoogle ScholarCross RefCross Ref
  72. M. E. J. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 6 (June 2004), 066133.Google ScholarGoogle Scholar
  73. M. E. J. Newman. 2013. Community detection and graph partitioning. CoRR abs/1305.4974 (2013).Google ScholarGoogle Scholar
  74. M. E. J. Newman and E. A. Leicht. 2007. Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. U.S.A. 104, 23 (2007), 9564--9569.Google ScholarGoogle ScholarCross RefCross Ref
  75. K. Nowicki and T. A. B. Snijders. 2001. Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 96, 455 (Sept. 2001), 1077--1087.Google ScholarGoogle Scholar
  76. Günce Keziban Orman, Vincent Labatut, and Hocine Cherifi. 2012. Comparative evaluation of community detection algorithms: A topological approach. J. Stat. Mech.: Theory Exp. 2012, 8 (2012), P08001. http://stacks.iop.org/1742-5468/2012/i=08/a=P08001.Google ScholarGoogle ScholarCross RefCross Ref
  77. Michael Ovelgönne and Andreas Geyer-Schulz. 2012. An ensemble learning strategy for graph clustering. In Graph Partitioning and Graph Clustering (Contemporary Mathematics), Vol. 588. American Mathematical Society, 187--206.Google ScholarGoogle Scholar
  78. Gergely Palla, Imré Derényi, Illés Farkas, and Tamás Vicsek. 2005. Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 7043 (June 2005), 814--818.Google ScholarGoogle ScholarCross RefCross Ref
  79. Gergely Palla, Illés J. Farkas, Péter Pollner, Imre Derényi, and Tamás Vicsek. 2008. Fundamental statistical features and self-similar properties of tagged networks. New J. Phys. 10, 12 (2008), 123026.Google ScholarGoogle ScholarCross RefCross Ref
  80. Lance Parsons, Ehtesham Haque, and Huan Liu. 2004. Subspace clustering for high dimensional data: A review. SIGKDD Explor. Newsl. 6, 1 (June 2004), 90--105. DOI:https://doi.org/10.1145/1007730.1007731Google ScholarGoogle ScholarDigital LibraryDigital Library
  81. Pascal Pons and Matthieu Latapy. 2006. Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10, 2 (2006), 191--218.Google ScholarGoogle ScholarCross RefCross Ref
  82. Ioannis Psorakis, Stephen Roberts, and Ben Sheldon. 2010. Efficient Bayesian community detection using non-negative matrix factorisation. (2010). arXiv:arXiv/1009.2646Google ScholarGoogle Scholar
  83. Usha N. Raghavan, Réka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 3 (Sept. 2007), 036106.Google ScholarGoogle ScholarCross RefCross Ref
  84. Wei Ren, Guiying Yan, Xiaoping Liao, and Lan Xiao. 2009. Simple probabilistic algorithm for detecting community structure. Phys. Rev. E 79, 3 (2009), 036111.Google ScholarGoogle ScholarCross RefCross Ref
  85. Thomas Richardson, Peter J. Mucha, and Mason A. Porter. 2009. Spectral tripartitioning of networks. Phys. Rev. E 40 (2009), 027104.Google ScholarGoogle Scholar
  86. Jason Riedy, David A. Bader, Karl Jiang, Pushkar Pande, and Richa Sharma. 2011. Detecting Communities from Given Seeds in Social Networks. Technical Report GT-CSE-11-01. Georgia Institute of Technology.Google ScholarGoogle Scholar
  87. M. Rosvall and C. T. Bergstrom. 2007. An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. U.S.A. 104, 18 (2007), 7327.Google ScholarGoogle ScholarCross RefCross Ref
  88. Martin Rosvall and Carl T. Bergstrom. 2008. Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. U.S.A. 105, 4 (2008), 1118--1123.Google ScholarGoogle ScholarCross RefCross Ref
  89. Robert E. Schapire. 1990. The strength of weak learnability. Mach. Learn. 5, 2 (July 1990), 197--227. DOI:https://doi.org/10.1023/A:1022648800760Google ScholarGoogle Scholar
  90. Alexander Strehl and Joydeep Ghosh. 2003. Cluster ensembles—A knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3 (March 2003), 583--617. DOI:https://doi.org/10.1162/153244303321897735Google ScholarGoogle Scholar
  91. J. Su and T. C. Havens. 2014. Fuzzy community detection in social networks using a genetic algortihm. In Proceedings of the 2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE’14). 2039--2046.Google ScholarGoogle Scholar
  92. Peng-Gang Sun, Lin Gao, and Shan Shan Han. 2011. Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks. Inf. Sci. 181, 6 (2011), 1060--1071.Google ScholarGoogle ScholarDigital LibraryDigital Library
  93. Kamal Taha. 2018. Disjoint community detection in networks based on the relative association of members. IEEE Trans. Comput. Soc. Syst. 5, 2 (2018), 493--507.Google ScholarGoogle ScholarCross RefCross Ref
  94. Vincent A. Traag, Gautier Krings, and Paul Van Dooren. 2013. Significant scales in community structure. Sci. Rep. 3 (2013). http://dblp.uni-trier.de/db/journals/corr/corr1306.html&ampnum;TraagKD13.Google ScholarGoogle Scholar
  95. Faramarz Valafar. 2002. Pattern recognition techniques in microarray data analysis. Ann. N. Y. Acad. Sci. 980, 1 (2002), 41--64.Google ScholarGoogle ScholarCross RefCross Ref
  96. Corinna Vehlow, Thomas Reinhardt, and Daniel Weiskopf. 2013. Visualizing fuzzy overlapping communities in networks. IEEE Trans. Vis. Comput. Graphics 19, 12 (2013), 2486--2495. DOI:https://doi.org/10.1109/TVCG.2013.232Google ScholarGoogle ScholarDigital LibraryDigital Library
  97. Xufei Wang, Lei Tang, Huan Liu, and Lei Wang. 2013. Learning with multi-resolution overlapping communities. Knowl. Inf. Syst. 36, 2 (2013), 517--535.Google ScholarGoogle ScholarDigital LibraryDigital Library
  98. Joyce Jiyoung Whang, David F. Gleich, and Inderjit S. Dhillon. 2013. Overlapping community detection using seed set expansion. In CIKM. ACM, 2099--2108.Google ScholarGoogle Scholar
  99. Jierui Xie, Mingming Chen, and Boleslaw K. Szymanski. 2013. LabelRankT: Incremental community detection in dynamic networks via label propagation. CoRR abs/1305.2006 (2013).Google ScholarGoogle Scholar
  100. Jierui Xie, Stephen Kelley, and Boleslaw K. Szymanski. 2013. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv. 45, 4 (Aug. 2013), Article 43, 35 pages. DOI:https://doi.org/10.1145/2501654.2501657Google ScholarGoogle ScholarDigital LibraryDigital Library
  101. J. Xie and B. K. Szymanski. 2011. Community detection using a neighborhood strength driven label propagation algorithm. In IEEE NSW. 188--195.Google ScholarGoogle Scholar
  102. Jierui Xie and Boleslaw K. Szymanski. 2012. Towards linear time overlapping community detection in social networks. In PAKDD. Malaysia, 25--36.Google ScholarGoogle Scholar
  103. Rui Xu and D. Wunsch, II. 2005. Survey of clustering algorithms. Trans. Neur. Netw. 16, 3 (May 2005), 645--678.Google ScholarGoogle ScholarDigital LibraryDigital Library
  104. Jaewon Yang and Jure Leskovec. 2013. Overlapping community detection at scale: A nonnegative matrix factorization approach. In WSDM. ACM, New York, 587--596.Google ScholarGoogle Scholar
  105. Mina Zarei, Dena Izadi, and Keivan Aghababaei Samani. 2009. Detecting overlapping community structure of networks based on vertex--vertex correlations. J. Stat. Mech. Theor. Exp. 2009, 11 (2009), P11013.Google ScholarGoogle Scholar
  106. Shihua Zhang, Rui-Sheng Wang, and Xiang-Sun Zhang. 2007. Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys. A: Stat. Mech. Appl. 374, 1 (2007), 483--490.Google ScholarGoogle ScholarCross RefCross Ref
  107. Xiao Zhang, Travis Martin, and M. E. J. Newman. 2015. Identification of core-periphery structure in networks. Phys. Rev. E 91, 3 (Mar. 2015), 032803. DOI:https://doi.org/10.1103/PhysRevE.91.032803Google ScholarGoogle Scholar
  108. Yuzhou Zhang, Jianyong Wang, Yi Wang, and Lizhu Zhou. 2009. Parallel community detection on large networks with propinquity dynamics. In KDD. ACM, 997--1006.Google ScholarGoogle Scholar
  109. Kun Zhao, Shao-Wu Zhang, and Quan Pan. 2010. Fuzzy analysis for overlapping community structure of complex network. In CCDC. 3976--3981.Google ScholarGoogle Scholar

Index Terms

  1. Ensemble Detection and Analysis of Communities in Complex Networks

      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

      • Article Metrics

        • Downloads (Last 12 months)160
        • Downloads (Last 6 weeks)15

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!