Abstract
Most of the real world networks we encounter today are complex networks and one of the important characteristics of these networks is the community structure. Identifying communities in a complex network is classified as computably hard and thus many metaheuristic approaches have been proposed in the past. In this paper we propose an improved differential evolution based algorithm which exploits the structural similarity of the network to generate a better initial population leading to a more accurate identification of communities. We have tested our algorithm on various well-known real world and artificial networks.
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.
