Abstract
A dynamic network clustering algorithm based on Affinity Propagation (AP) is proposed in this paper. The algorithm takes both time consumption and clustering accuracy into consideration. For a node joining, leaving, and moving, procedures are designed respectively to firstlyadjust clusters locallybased on the similarities between the node and the exemplars, and then use AP algorithm globally if the whole redundancy reaches a predefined threshold. Experiments on artificial datasets and KDD99 show that the proposed algorithm reduces time consumption greatly with only less than 5% loss of clustering accuracy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972–976 (2007)
Karen, K.: Affinity program slashes computing times, October 25 (2007), http://www.news.utoronto.ca/bin6/070215-2952.asp
Xiao, Y., Yu, J.: Semi-Supervised clustering based on affinity propagation algorithms. Journal of Software 19(11), 2803–2813 (2008) (in Chinese)
Wang, K., Zhang, J., Li, D., Zhang, X., Guo, T.: Adaptive affinity propagation clustering. Acta Automatica Sinica 33(12), 1242–1246 (2007) (in Chinese)
Thavikulwat, P.: Affinity Propagation: A Clustering Algorithm for Computer-Assisted Business Simulations and Experiential Exercises. Development in Business Simulation and Experiential Learning 35 (2008)
Zhang, X., Furtlehner, C., Sebag, M.: Data Streaming with Affinity Propagation. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part II. LNCS (LNAI), vol. 5212, pp. 628–643. Springer, Heidelberg (2008)
KDD99: Kdd cup 1999 data (computer network intrusion detection) (1999), http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Huo, Q., Yang, P. (2012). Dynamic Network Clustering with Affinity Propagation. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25781-0_94
Download citation
DOI: https://doi.org/10.1007/978-3-642-25781-0_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25780-3
Online ISBN: 978-3-642-25781-0
eBook Packages: EngineeringEngineering (R0)