Abstract
A wide variety of applications could be formulated to resolve the problem of finding all communities from a given network, ranging from social and biological network analysis to web mining and searching. In this study, we propose the concept of virtual attractive strength between each pair of node in networks, and then give the definition of community structure based on the proposed attractive strength. Furthermore, we present a community detection method by moving vertices to the clusters that produce the largest attractive strengths to them until the division of network reaches unchanged. Experimental results on synthetic and real networks indicate that the proposed approach has favorite effectiveness and fast convergence speed, which provides an efficient method for exploring and analyzing complex systems.
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 callDisclaimer: 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.
