Abstract

Detecting community structure is crucial for uncovering the links between structures and functions in complex networks. Most of contemporary community detection algorithms employ single optimization criteria (e.g., modularity), which may have fundamental disadvantages. This paper considers the community detection process as a Multi-Objective optimization Problem (MOP). To solve the community detection problem this study used modified harmony search algorithm (HAS), the original HAS often converges to local optima which is a disadvantage with this method. To avoid this shortcoming the HAS was combined with a Chaotic Local Search (CLS). In the proposed algorithm an external repository considered to save non-dominated solutions found during the search process and a fuzzy clustering technique was used to control the size of the repository. The experiments in synthetic and real networks show that the proposed multi-objective community detection algorithm is able to discover more accurate community structures.

Full Text
Paper version not known

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 call

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.