Local Community Detection Using Greedy Algorithm with Probability
With the arrival of the era of big data, the scale of network has grown at an incredible rate, which has brought challenges to community discovery. Local community discovery is a kind of community discovery that does not need to know global information about network. A quantity of local community discovery algorithms have been put forward by researchers. Traditional local community discovery generally needs to define local community modularity Q, and greedily add nodes to the community when ΔQ > 0, which is easy to fall into the local optimal solution. Inspired by the ideal of simulated annealing, greedy algorithm with probability LCDGAP is proposed to detect local community in this paper, which can be applied to all algorithms that perform greedy addition. We permit that the node can be aggregated into the community with a certain probability when ΔQ < 0. At the same time, we guarantee that this probability will be getting smaller with the increase of program running time, ensuring the program’s convergence and stability. Experimental result proves that LCDGAP performs effectively not only in real-world dataset but also computer-generated dataset.
KeywordsGreedy algorithm Local community detection Probability
- 1.Chen, W., Wang, S., Zhang, X., et al.: EEG-based motion intention recognition via multi-task RNNs. In: pp. 279–287. Society for Industrial and Applied Mathematics (2018)Google Scholar
- 2.Yue, L., Chen, W., Li, X., et al.: A survey of sentiment analysis in social media. Knowl. Inf. Syst. 1–47 (2018)Google Scholar
- 5.Bu, Z., Zhang, C., Xia, Z.: A fast parallel modularity optimization algorithm for community detection in online social network. Knowl.-Based Syst. 176(3) (2013)Google Scholar
- 10.Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. Web Intell. Agent Syst. 6(4), 387–400 (2008)Google Scholar
- 11.Chen, J., Zaïane, O., Goebel, R.: Local community identification in social networks. In: Advances in Social Network Analysis and Mining, pp. 237–242 (2009)Google Scholar