Research Article
A Graph-Based Shortest Path Community Expansion Method
@INPROCEEDINGS{10.1007/978-3-031-32443-7_21, author={Wang Wenzhang and Zheng Xiaoyan}, title={A Graph-Based Shortest Path Community Expansion Method}, proceedings={Mobile Networks and Management. 12th EAI International Conference, MONAMI 2022, Virtual Event, October 29-31, 2022, Proceedings}, proceedings_a={MONAMI}, year={2023}, month={5}, keywords={community discovery shortest paths community expansion overlapping communities}, doi={10.1007/978-3-031-32443-7_21} }- Wang Wenzhang
Zheng Xiaoyan
Year: 2023
A Graph-Based Shortest Path Community Expansion Method
MONAMI
Springer
DOI: 10.1007/978-3-031-32443-7_21
Abstract
With the advent of the era of big data, research on community discovery has become more and more popular. For the division of nodes in the network, the mainstream method is to calculate the fitness function of nodes and communities. This paper proposes a graph-based shortest path community expansion method (A Graph-Based Shortest Path Community Expansion Method, hereinafter referred to as SPCE algorithm). The algorithm mainly includes four steps: selecting seed nodes, expanding seed communities, finding overlapping nodes, and optimizing communities. In the process of community expansion, the SPCE algorithm does not use the current mainstream fitness function method for community expansion. Instead, it uses the characteristics of dense connections within communities and sparse connections between communities to expand using the shortest path method of graphs. After experiments in real networks and artificial networks, the SPCE algorithm can more accurately discover the community structure in the network.
