An efficient multiobjective evolutionary algorithm for community detection in social networks

Amiri, B., Hossain, L. and Crawford, J. W. (2011) An efficient multiobjective evolutionary algorithm for community detection in social networks. In: 2011 IEEE Congress of Evolutionary Computation (CEC), New Orleans, LA, USA, 5-8 June 2011, pp. 2193-2199. ISBN 9781424478347 (doi: 10.1109/CEC.2011.5949886)

Full text not currently available from Enlighten.


Community detection in complex networks has been addressed in different ways recently. To identify communities in social networks we can formulate it with two different objectives, maximization of internal links and minimization of external links. Because these two objects are correlated, the relationship between these two objectives is a trade-off. This study employed harmony search algorithm, which was conceptualized using the musical process of finding a perfect state of harmony to perform this bi-objective trade-off. In the proposed algorithm an external repository considered to save non-dominated solutions found during the search process and a fuzzy clustering technique is used to control the size of repository. The harmony search algorithm was applied on well-known real life networks, and good Pareto solutions were obtained when compared with other algorithms, such as the MOGA-Net and Newman algorithms.

Item Type:Conference Proceedings
Additional Information:Electronic ISBN: 9781424478354.
Glasgow Author(s) Enlighten ID:Crawford, Professor John
Authors: Amiri, B., Hossain, L., and Crawford, J. W.
College/School:College of Social Sciences > Adam Smith Business School > Management
Journal Name:2011 IEEE Congress of Evolutionary Computation, CEC 2011

University Staff: Request a correction | Enlighten Editors: Update this record