A new clustering algorithm based on data field in complex networks

作者：Liu, Yuhua; Jin, Jianzhi^*; Zhang, Yi; Xu, Cui

来源：Journal of Supercomputing, 2014, 67(3): 723-737.

DOI：10.1007/s11227-013-0984-x

• Clustering
• Complex network
• Data field
• Mutual information
• Importance
• Potential

The evaluation of node importance in complex networks has been an increasing widespread concern in recent years. Seeking and protecting vital nodes is important to ensure the security and stability of the whole network. Existing clustering algorithms of complex networks all have certain drawbacks, which could not cover everything in calculation accuracy and time complexity, and need external supervision. To design a fast complex networks clustering method is a problem which requires to be solved immediately. This paper proposes a clustering algorithm of complex networks based on data field using physical data field theory, which excavates key nodes in complex networks by evaluating the importance of nodes based on a mutual information algorithm, and then uses it to classify the clusters. To verify the validity of the algorithm, a simulation experiment was conducted. The results indicated that the algorithm could analyze the cluster exactly and calculate with high-speed, it could also determine the granularity of a partition according to the actual demand.

• 出版日期2014-3
• 单位华中师范大学