A Novel Complex Networks Clustering Algorithm Based on the Core Influence of Nodes

Abstract EN

In complex networks, cluster structure, identified by the heterogeneity of nodes, has become a common and important topological property.

Network clustering methods are thus significant for the study of complex networks.

Currently, many typical clustering algorithms have some weakness like inaccuracy and slow convergence.

In this paper, we propose a clustering algorithm by calculating the core influence of nodes.

The clustering process is a simulation of the process of cluster formation in sociology.

The algorithm detects the nodes with core influence through their betweenness centrality, and builds the cluster’s core structure by discriminant functions.

Next, the algorithm gets the final cluster structure after clustering the rest of the nodes in the network by optimizing method.

Experiments on different datasets show that the clustering accuracy of this algorithm is superior to the classical clustering algorithm (Fast-Newman algorithm).

It clusters faster and plays a positive role in revealing the real cluster structure of complex networks precisely.