Skip to main content

Dynamic Growing Self-organizing Neural Network for Clustering

  • Conference paper
Advanced Data Mining and Applications (ADMA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5139))

Included in the following conference series:

  • 2500 Accesses

Abstract

Neural Networks have been widely used in the field of intelligent information processing such as classification, clustering, prediction, and recognition. Unsupervised learning is the main method to collect and find features from large unlabeled data. In this paper a new unsupervised learning clustering neuron network—Dynamic Growing Self-organizing Neuron Network (DGSNN) is presented. It uses a new competitive learning rule—Improved Winner-Take-All (IWTA) and adds new neurons when it is necessary. The advantage of DGSNN is that it overcomes the usual problems of other clustering methods: dead units and prior knowledge of the number of clusters. In the experiments, DGSNN is applied to clustering tasks to check its ability and is compared with other clustering algorithms RPCL and WTA. The results show that DGSNN performs accurately and efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ressom, H., Wang, D., Natarajan, P.: Adaptive Double Self-organizing Maps for Clustering Gene Expression Profiles. Neural Network 16, 633–640 (2003)

    Article  Google Scholar 

  2. Nair, T.M., Zheng, C.L., Fink, J.L.: Rival Penalized Competitive Learning (RPCL): A Topology-determining Algorithm for Analyzing Gene Expression Data. Computational Biology and Chemistry 27, 565–574 (2003)

    Article  MATH  Google Scholar 

  3. Chen, N., Chen, A., Zhou, L.X.: An Efficient Clustering Algorithm in Large Transaction Databases. Journal of Software 12(4), 475–484 (2001)

    Google Scholar 

  4. Song, L.P., Zheng, J.H.: Evaluation Method of the Corpus Segmentation Based on Clustering. Chinese Journal of Computers 27(2), 192–196 (2004)

    MathSciNet  Google Scholar 

  5. Giuseppe, A., Ernesto, C., Girolamo, F., Silvano, V.: A Feature Extraction Unsupervised Neural Network for An Environmental Data Set. Neural Networks 16, 427–436 (2003)

    Article  Google Scholar 

  6. Yang, Y.L., Guan, X.D., You, J.Y.: Mining The Page Clustering Based on the Content of Web Pages and the Site Topology. Journal of Software 13(3), 467–469 (2002)

    Google Scholar 

  7. Ezequiel, L.R., Jose, M.P., Jose, A.G.R.: Principal Components Analysis Competitive Learning. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 318–325. Springer, Heidelberg (2003)

    Google Scholar 

  8. Liu, Z.Y., Chiu, K.C., Xu, L.: Local PCA for Line Detection And Thinning. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol. 2683, pp. 21–34. Springer, Heidelberg (2003)

    Google Scholar 

  9. Kamimura, R.: Competitive Learning by Information Maximization: Eliminating Dead Neurons in Competitive Learning. In: Kaynak, O., Alpaydın, E., Oja, E., Xu, L. (eds.) ICANN 2003 and ICONIP 2003. LNCS, vol. 2714, pp. 99–106. Springer, Heidelberg (2003)

    Google Scholar 

  10. Fung, W.K., Liu, Y.H.: A Game-theoretic Adaptive Categorization Mechanism for ART-type Networks. In: Dorffner, G., Bischof, H., Hornik, K. (eds.) ICANN 2001. LNCS, vol. 2130, pp. 170–176. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Garcia-Bernal, M.A., Munoz-perez, J., Gomez-Ruiz, J.A., Ladron de, G.I.: A Competitive Neural Network Based on Dipoles. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 398–405. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Andrew, L.: Analyses on the Generalized Lotto-type Competitive Learning. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS, vol. 1983, pp. 9–16. Springer, Heidelberg (2000)

    Google Scholar 

  13. Marsland, S., Sphairo, J., Nehmzow, U.: A Self-organising Network That Grows When Required. Neural Networks 15, 1041–1058 (2002)

    Article  Google Scholar 

  14. Hirotaka, I., Hiroyuki, N.: Efficiency of Self-generating Neural Networks Applied to Pattern Recognition. Mathematical and Computer Modelling 38, 1225–1232 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tian, D., Ren, Y., Li, Q. (2008). Dynamic Growing Self-organizing Neural Network for Clustering. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2008. Lecture Notes in Computer Science(), vol 5139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88192-6_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88192-6_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88191-9

  • Online ISBN: 978-3-540-88192-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics