Overlapping Community Discovery based on Seed Expansion and Shortest Path of Graph
Pages 172 - 176
Abstract
This article proposes an overlapping community discovery algorithm based on the combination of seed extension and the shortest path of the graph (Overlapping Communities Detecting Based on Seed Extension and Shortest Path of Graph, the following referred to as SESPG algorithm). First, the seed node is selected according to the influence of the node. Secondly, the nodes of the community are preliminarily divided by calculating the similarity between the nodes and the seed community. Then calculate the maximum value of the shortest path between the seeds in the community and the nodes in the community. Use this as the radius. For nodes within the radius but not in the community, calculate the similarity with the community, and join the community if it exceeds the threshold. Finally, the communities with high similarity are merged to complete the discovery of overlapping communities. After comparing with other algorithms, the SESPG algorithm has a good performance when the complexity is high, and the number of nodes is large.
References
[1]
Qiao Shaojie, Han Nan, Zhang Kaifeng, Zou Lei, Wang Hongzhi, Louis Alberto GUTIERREZ. Overlapping community detection algorithm in complex network big data[J]. Journal of Software, 2017, 28(03): 631-647.
[2]
Newman M E J and Girvan M. Finding and evaluating community structure in networks. [J]. Physical review. E, Statistical, nonlinear, and soft matter physics, 2004, 69(2 Pt 2): 026113.
[3]
Yu Zhiyong, Chen Jijie, Guo Kun, Chen Yuzhong, Xu Qian. Discovery of overlapping communities based on influence and seed expansion[J]. Chinese Journal of Electronics, 2019, 47(01): 153-160.
[4]
Hui Xie, Yongjie Yan. Detecting an Overlapping Community Structure by Using Clique-to-Clique Similarity based Label Propagation[J]. Journal of the Korean Physical Society,2019,75(6):
[5]
Shi Dong. Improved label propagation algorithm for overlapping community detection[J]. Computing,2020,102(10):
[6]
Steve Gregory. Finding overlapping communities in networks by label propagation[J]. New Journal of Physics, 2010, 12(10): 103018 (26pp).
[7]
Jierui Xie and Boleslaw K. Szymanski and Xiaoming Liu. SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process[J]. CoRR, 2011, abs/1109.5720
[8]
David Lusseau The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations[J]. Behavioral Ecology and Sociobiology, 2003, 54(4): 396-405.
[9]
Girvan M and Newman M E J. Community structure in social and biological networks. [J]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12): 7821-6.
[10]
Jure Leskovec and Jon Kleinberg and Christos Faloutsos. Graph evolution[J]. ACM Transactions on Knowledge Discovery from Data (TKDD), 2007, 1(1): 2-es.
[11]
Lancichinetti Andrea and Fortunato Santo and Radicchi Filippo. Benchmark graphs for testing community detection algorithms. [J]. Physical review. E, Statistical, nonlinear, and soft matter physics, 2008, 78(4 Pt 2): 046110.
[12]
Huawei Shen Detect overlapping and hierarchical community structure in networks[J]. Physica A: Statistical Mechanics and its Applications, 2009, 388(8): 1706-1712.
[13]
Leon Danon Comparing community structure identification[J]. Journal of Statistical Mechanics: Theory and Experiment, 2005, 2005(09)
[14]
Palla Gergely Uncovering the overlapping community structure of complex networks in nature and society. [J]. Nature, 2005, 435(7043): 814-8.
Recommendations
Overlapping community detection using seed set expansion
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge ManagementCommunity detection is an important task in network analysis. A community (also referred to as a cluster) is a set of cohesive vertices that have more connections inside the set than outside. In many social and information networks, these communities ...
Community-Affiliation Graph Model for Overlapping Network Community Detection
ICDM '12: Proceedings of the 2012 IEEE 12th International Conference on Data MiningOne of the main organizing principles in real-world networks is that of network communities, where sets of nodes organize into densely linked clusters. Communities in networks often overlap as nodes can belong to multiple communities at once. ...
k-Fewest Turn and Shortest Path Algorithm based on Stroke Graph
IWCTS '23: Proceedings of the 16th ACM SIGSPATIAL International Workshop on Computational Transportation ScienceThis paper proposes the k-fewest turn and shortest path (k-FTSP) algorithm to solve the problem of route search in web mapping systems. Conventional shortest path search has a problem in that the generated shortest path may include many right and/or left ...
Comments
Information & Contributors
Information
Published In
January 2022
250 pages
ISBN:9781450387408
DOI:10.1145/3517077
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 May 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- The Nation Natural Science Foundation of China
- The Natural Science Foundation of Tianjin,China
Conference
ICMIP 2022
ICMIP 2022: 2022 7th International Conference on Multimedia and Image Processing
January 14 - 16, 2022
Tianjin, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 23Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format