An improved local community detection algorithm using selection probability
Summary: In order to find the structure of local community more effectively, we propose an improved local community detection algorithm ILCDSP, which improves the node selection strategy, and sets selection probability value for every candidate node. ILCDSP assigns nodes with different selection probability values, which are equal to the degree of the nodes to be chosen. By this kind of strategy, the proposed algorithm can detect the local communities effectively, since it can ensure the best search direction and avoid the local optimal solution. Various experimental results on both synthetic and real networks demonstrate that the quality of the local communities detected by our algorithm is significantly superior to the state-of-the-art methods.
- Local community detection in complex networks based on maximum cliques extension
- An improved spectral clustering community detection algorithm based on probability matrix
- Detection of local community structure of complex networks based on core nodes jumping
- A method for local community mining in the complex networks
- Community detection using local neighborhood in complex networks
This page was built for publication: An improved local community detection algorithm using selection probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718299)
