A Data Clustering Method for Communication Network Based on Affinity Propagation

With the expansion of the network scale, the amount of data in the communication network is also increasing. Data mining technology can effectively analyze the data generated in the network. As one of the important technologies of data mining, clustering is also widely used in the field of communication. However, the general clustering algorithm has numerical oscillation or large computational complexity. This paper proposes an improved AP clustering algorithm and proposes the concepts of filtering data transfer objects and dynamic damping coefficients. Experiment results show that the algorithm proposed in this paper can effectively improve efficiency and adapt well to communication network data.

[1]  Chang-Dong Wang,et al.  Multi-Exemplar Affinity Propagation , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Ying Zeng,et al.  Operation and maintenance analysis for power communication networks based on big data , 2016, 2016 China International Conference on Electricity Distribution (CICED).

[3]  Ali A. Ghorbani,et al.  A detailed analysis of the KDD CUP 99 data set , 2009, 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications.

[4]  M. Weigt,et al.  Unsupervised and semi-supervised clustering by message passing: soft-constraint affinity propagation , 2007, 0712.1165.

[5]  Ian H. Witten,et al.  Weka-A Machine Learning Workbench for Data Mining , 2005, Data Mining and Knowledge Discovery Handbook.

[6]  Philip S. Yu,et al.  Multi-View Clustering Based on Belief Propagation , 2016, IEEE Transactions on Knowledge and Data Engineering.

[7]  B. Everitt,et al.  Cluster Analysis: Everitt/Cluster Analysis , 2011 .

[8]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.