Abstract
Along with the fast advance of internet technique, internet users have to deal with novel data every day. For most of them, one of the most useful knowledge exploited from web is about the transfer of the information expressed by dynamically updated data. Unfortunately, traditional algorithms often cluster novel data without considering the existent clustering model. They have to cluster input data over again, once input data are updated. Hence, they are time-consuming and inefficient. For efficiently clustering dynamic data, a novel Self-Adaptive Clustering algorithm (abbreviated as SAC) is proposed in this paper. SAC comes from Self Organizing Mapping algorithm (abbreviated as SOM), whereas, it doesn’t need to make any assumption about neuron topology beforehand. Besides, when input data are updated, its topology remodels meanwhile. Experiment results demonstrate that SAC can automatically tune its topology along with the update of input data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Martin, S., Detlef, N.: Towards the Automation of Intelligent Data Analysis. Appl. Soft Comput. 6, 348–356 (2006)
Dhillon, I.S., Guan, Y.Q., Kogan, J.: Iterative Clustering of High Dimensional Text Data Augmented by Local Search. In: Proceedings of the Second IEEE International Conference on Data Mining, pp. 131–138. IEEE Press, Japan (2002)
Ghaseminezhad, M.H., Karami, A.: A Novel Self-Organizing Map (SOM) Neural Network for Discrete Groups of Data Clustering. Appl. Soft Comput. 11, 3771–3778 (2011)
Melody, Y.K.: Extending the Kohonen Self-Organizing Map Networks for Clustering Analysis. Comput. Stat. Data Anal. 38, 161–180 (2001)
Tseng, C.L., Chen, Y.H., Xu, Y.Y., Pao, H.T., Fu, H.C.: A Self-Growing Probabilistic Decision-Based Neural Network with Automatic Data Clustering. Neurocomput. 61, 21–38 (2004)
Melody, Y.K.: Extending the Kohonen Self-Organizing Map Networks for Clustering Analysis. Comput. Stat. Data Anal. 38, 161–180 (2001)
Lee, S., Kim, G., Kim, S.: Self-Adaptive and Dynamic Clustering for Online Anomaly Detection. Expert Syst. Appl. 38, 14891–14898 (2011)
Hodge, V.J., Austin, J.: Hierarchical Growing Cell Structures: TreeGCS. IEEE Trans. Knowl. Data Engin. 13, 207–218 (2001)
Duan, L., Xu, L.D., Guo, F., Lee, J., Yan, B.P.: A Local-Density Based Spatial Clustering Algorithm with Noise. Inform. Syst. 32, 978–986 (2007)
Ezequiel, L.R.: Probabilistic Self-Organizing Maps for Qualitative Data. Neural Networks 23, 1208–1225 (2010)
Tokunaga, K., Furukawa, T.: Modular Network SOM. Neural Networks 22, 82–90 (2009)
Kohonen, T., Kaski, S., Lagus, K., Salojarvi, J., Paatero, V., Saarela, A.: Self Organization of a Massive Document Collection. IEEE Trans. Neural Networks 11, 574–585 (2000)
Blake, C., Keogh, E., Merz, C.J.: UCI Repository of Machine Learning Databases. University of California, Irvine (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Alahakoon, D., Halganmuge, S.K., Srinivasan, B.: Dynamic Self-Organizing Maps with Controlled Growth for Knowledge Discovery. IEEE Trans. Neural Networks 11, 601–614 (2000)
Rauber, A., Merkl, D., Dittenbach, M.: The Growing Hierarchical Self-Organizing Map: Exploratory Analysis of High-Dimensional Data. IEEE Trans. Neural Networks 13, 1331–1341 (2002)
Qin, A.K., Suganthan, P.N.: Robust Growing Neural Gas Algorithm with Application in Cluster Analysis. Neural Networks 17, 1135–1148 (2004)
Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1995); (2nd Extended Edition 1997)
Robert, L.K., Warwick, K.: The Plastic Self Organising Map. In: Proceedings of the 2002 International Joint Conference on Neural Networks, pp. 727–732. IEEE Press, Hawaii (2002)
Hung, C., Wermter, S.: A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering. In: Proceedings of the Third IEEE International Conference on Data Mining, pp. 75–82. IEEE Press, Melbourne (2003)
Gu, M., Zha, H., Ding, C., He, X.: Simon, H., Xia, J.: Spectral Relaxation Models and Structure Analysis for K-Way Graph Clustering and Bi-Clustering. Technical Report, CSE-01-007, Penn State University (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, M., Lin, L., Shan, L., Sun, C. (2012). A Novel Self-Adaptive Clustering Algorithm for Dynamic Data. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34487-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-34487-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34486-2
Online ISBN: 978-3-642-34487-9
eBook Packages: Computer ScienceComputer Science (R0)