- 會議論文
- OpenAccess
Distributed Overlapping Community Detection
摘要
To discover all cohesion subgroups from the complex network is a critical issue in social network analysis. The research proposes a novel distributed static overlapping community detection method on the MapReduce framework to speed up the performance of community detection. The first step collects all neighbor information of each node in the complex network. Then, the TTT algorithm uses the previous information to enumerate all maximal cliques. Last, the CPM algorithm incrementally merges adjacent maximal cliques to complete the overlapping detection operation. The six datasets collected from YouTube are adopted to show the distributed method whether largely improve the performance in experiment.
延伸閱讀
- 吳牧寰 (2013). A Markov Chain Approach for Relative Centrality and Community Detection [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2013.00732
- 張芝榮 (2013). Relative Centrality and Local Community Detection [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2013.00731
- Servetnyk, M. (2020). Distributed Optimization for Signal Processing and Communications [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0030-1504202111234254
- 蔡以誠（2016）。Applying Local Expansion and Optimization to Overlapping Community Structure Detection and Analysis〔碩士論文，國立交通大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0030-0803201714353010
- Wang, L., Zhang, Y., Zhang, Y., & Zhang, H. (2017). A Novel Community Detection Algorithm Based on E_FEC. 電腦學刊, 28(5), 70-81. https://doi.org/10.3966/199115992017102805007