Abstract

Community structure is a main structural feature of networks, which can model many complex systems. It illustrates a lot of information about networks like their internal organisation and the degree of similarity between network nodes. Many methods have been proposed to find community structure in networks. However, there is always requirement to new methods for many reasons especially the accuracy. In this paper, we present a new method to find community structure in networks. Our method is hierarchical algorithm based on Tabu Search metaheuristic. A dendrogram is built by our method after dividing a network several times. The community structure will be selected from the built dendrogram based on quality function called Modularity. Our method has been tested on artificial benchmark and real networks. Results demonstrate the superiority of our method compared with several state-of-art methods.

Full Text
Published version (Free)

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