期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2015
卷号：75
期号：1
出版社：Journal of Theoretical and Applied
摘要：Communities detection in graphs has been the subject of many algorithms. Recent methods seek to optimize a function of modularity indicating a maximum of relationships within communities and a minimum of inter-communities relations. This paper will be presented as follows, first, we present the state of the art in matters of detection methods of communities then we propose a method for detecting communities. This method works into two steps, the first step consist to split the graph into subgraphs by using the normalized covariance measurement and the second part allows to merge the sub-graphs by maximizing the modularity of the resulting graph.
