Document Type : Original Research Paper
Authors
School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran.
Abstract
Background and Objectives: So far, several methods have been proposed to detect communities, which indicate the high importance of discovering communities for understanding social networks and detecting useful and hidden patterns in the network. The goal of such analyses is to find a group of users with common characteristics. Basically, social networks are considered as graphs, so the analysis is also done using graph methods, in which nodes represent individuals and edges represent relationships between them. Since community detection is an NP-complete problem, several meta-heuristic approaches have been used to tackle this problem, mainly considering "modularity" as the objective function. In most approaches, modularity has been used, which suffers from the limitation of resolution and cannot detect communities that are small in size and consider it in combination with large communities.
Methods: In this paper, a new hybrid algorithm of bee colony and genetics is proposed for community detection which performs optimization using the "balanced modularity" fitness function. In this algorithm, parallel processing is used to speed up optimization, genetic algorithm is used to create the initial population, and genetic operators are used in the search by bees.
Results: Experiments on well-known real-world networks, including karate, American football, dolphins, and political books, have shown that our method provides more accurate results than the state-of-the-art community detection methods.
Conclusion: The combined optimization of bee colony and genetics not only provides globally optimal solution but also it does not need prior information about the number as well as the structure of communities.
Keywords
Main Subjects
', './data/jecei/coversheet/cover_en.jpg'))
Send comment about this article