Abstract

In recent years, social networks analysis has attracted the attention of many researchers. Community detection is one of the highly studied problems in this field. It is considered an NP-hard problem, and several algorithms have been proposed to solve this problem. In this chapter, the authors present a new algorithm for community detection in social networks based on the Black Hole optimization algorithm. The authors use the modularity density evaluation measure as a function to maximize. They also propose the enhancement of the algorithm by using two new strategies: initialization and evolution. The proposed algorithm has been tested on famous synthetic and real-world networks; experimental results compared with three known algorithms show the effectiveness of using this algorithm for community detection in social 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 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.