An efficient graph clustering algorithm in signed graph based on modularity maximization

Abstract

The unsigned graphs containing positive links only, have been analyzed fruitfully. However, the physical relations behind complex networks are dissimilar. We often encounter the signed networks that have both positive and negative links as well. It is very important to study the characteristics of complex networks and predict individual attitudes by analyzing the attitudes of individuals and their neighbors, which can divide individuals into different clusters or communities. To detect the clusters in signed networks, first, a modularity function for signed networks is proposed on the basis of the combination of positive and negative part. Then, a new graph clustering algorithm for signed graphs has also been proposed based on CNM algorithm, which has high efficiency. Finally, the algorithm has been applied on both artificial and the real networks. The results show that the proposed method has been able to achieve near-perfect solution, which is suitable for multiple types real networks.