|
[1]G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Vol. 435, pp. 814-818, 2005. [2]M. E. Newman, and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, Vol. 69, Issue 2, pp. 026113, 2004. [3]M. E. Newman, "Modularity and community structure in networks," in Proceedings of the National Academy of Sciences, Vol. 103, pp. 8577-8582, 2006. [4]D. J. Watts, and S. H. Strogatz, "Collective dynamics of ‘small-world’ networks," Nature, Vol. 393, pp. 440-442, 1998. [5]J. J. Whang, D. F. Gleich, and I. S. Dhillon, "Overlapping community detection using seed set expansion," in Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 2099-2108, 2013. [6]Y. J. Su, and C. C. Lee, "Overlapping Community Detection with Two-Level Expansion by Local Clustering Coefficients," in Proceedings of the Security with Intelligent Computing and Big-data Services, Vol. 733, pp. 105-112, 2018. [7]J. Scott, "Social network analysis: developments, advances, and prospects," Social Network Analysis and Mining, Vol. 1, pp. 21-26, 2011. [8]S. Wasserman, and K. Faust, "Social network analysis: Methods and applications," Cambridge University Press, 1994. [9]V. Latora, and M. Marchiori, "Efficient behavior of small-world networks," Physical Review Letters, Vol. 87, Issue 19, pp. 198701, 2001. [10]Samoylenko, D. Aleja, E. Primo, K. Alfaro-Bittner, E. Vasilyeva, K. Kovalenko, and S. Boccaletti, "Why are there six degrees of separation in a social network?," Physical Review X, Vol. 13, Issue 2, pp. 021032, 2023. [11]R. Sanders, "The Pareto principle: its use and abuse," Journal of Services Marketing, Vol. 1, No. 2, pp. 37-40, 1987. [12]J. Xie, S. Kelley, and B. K. Szymanski, "Overlapping community detection in networks: The state-of-the-art and comparative study," ACM Computing Surveys, Vol. 45, Issue 4, pp. 1-35, 2013. [13]P. K. Gopalan, and D. M. Blei, "Efficient discovery of overlapping communities in massive networks," in Proceedings of the National Academy of Sciences, Vol. 110, No. 36, pp. 14534-14539, 2013. [14]T. Schank, and D. Wagner, "Approximating clustering coefficient and transitivity," Journal of Graph Algorithms and Applications, Vol. 9, No. 2, pp. 265-275, 2005. [15]S. Maity, and S. K. Rath, "Extended Clique percolation method to detect overlapping community structure," in Proceedings of the 2014 International Conference on Advances in Computing, Communications and Informatics, pp. 31-37, 2014. [16]M. Chen, K. Kuzmin, and B. K. Szymanski, "Extension of modularity density for overlapping community structure," in Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 856-863, 2014. [17]X. Deng, J. Zhai, T. Lv , and L. Yin, "Efficient vector influence clustering coefficient based directed community detection method," IEEE Access, Vol. 5, pp. 17106-17116, 2017. [18]X. Pan, G. Xu, B. Wang, and T. Zhang, "A novel community detection algorithm based on local similarity of clustering coefficient in social networks," IEEE Access, Vol. 7, pp. 121586-121598, 2019. [19]Q. Ji, D. Li, and Z. Jin, "Divisive algorithm based on node clustering coefficient for community detection," IEEE Access, Vol. 8, pp. 142337-142347, 2020. [20]X. K. Zhang, X. Tian, Y. N. Li, and C. Song, "Label propagation algorithm based on edge clustering coefficient for community detection in complex networks," International Journal of Modern Physics B, Vol. 28, No. 30, pp. 1450216, 2014. [21]J. Yang, J. McAuley, and J. Leskovec, "Community detection in networks with node attributes," in Proceedings of the 2013 IEEE 13th International Conference on Data Mining, pp. 1151-1156, 2013. [22]J. hao, Z. Han, Q. Yang, and T. Zhou, "Community detection based on distance dynamics," in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1075-1084, 2015. [23]F. Moradi, T. Olovsson, and P. Tsigas, "A local seed selection algorithm for overlapping community detection," in Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1-8, 2014. [24]J. J. Whang, D. F. Gleich, and I. S. Dhillon, "Overlapping community detection using neighborhood-inflated seed expansion," IEEE Transactions on Knowledge and Data Engineering, Vol. 28, Issue 5, pp. 1272-1284, 2016. [25]R. Kanawati, "Seed-centric approaches for community detection in complex networks," in Proceedings of the 6th International Conference on Social Computing and Social Media, pp. 197-208, 2014. [26]K. Guo, L. He, Y. Chen, W. Guo, and J. Zheng, "A local community detection algorithm based on internal force between nodes," Applied Intelligence, Vol. 50, pp. 328-340, 2020. [27]Y. Zhang, B. Wu, Y. Liu, and J. Lv, "Local community detection based on network motifs," Tsinghua Science and Technology, Vol. 24, No. 6, pp. 716-727, 2019. [28]J. Liu, Y. Shao, and S. Su, "Multiple local community detection via high-quality seed identification," in Proceedings of the Web and Big Data: 4th International Joint Conference, pp. 37-52, 2020. [29]Hollocou, T. Bonald, and M. Lelarge, "Improving PageRank for local community detection," arXiv:1610.08722, 2016. [30]L. Ni, W. Luo, W. Zhu, and B. Hua, "Local overlapping community detection," ACM Transactions on Knowledge Discovery from Data, Vol. 14, Issue 1, pp. 1-25, 2019.
|