Abstract
The discovery and analysis of community structure in complex networks is a hot topic in recent years. A community detection method called NVP is proposed based on the node vector label propagation rate of network nodes. The algorithm determines the centers by looking for NGC nodes, use the concept that the inner product of the node vector in the approximate modularity is greater than 0 to divide the initial community, and then divides the final community according to the relevant content of the label propagation rate. Experimental results show that the algorithm can effectively identify the community structure of various real-world networks and computer-generated networks. In addition, this algorithm can also obtain higher NMI values than DPC, FG, LE and DCN algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
