Skip to main content

The probabilistic growing cell structures algorithm

  • Part IV: Signal Processing: Blind Source Separation, Vector Quantization, and Self Organization
  • Conference paper
  • First Online:
Artificial Neural Networks — ICANN'97 (ICANN 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1327))

Included in the following conference series:

Abstract

The growing cell structures (GCS) algorithm is an adaptive k-means clustering algorithm in which new clusters are added dynamically to produce a Dirichlet tessellation of the input space. In this paper we extend the non-parametric model of the GCS into a probabilistic one, assuming that samples are distributed in each cluster according to a multi-variate normal probability density function. We show that by recursively estimating the means and the variances of the clusters, and by introducing a new criterion for the insertion and deletion of a cluster, our approach can be more powerful to the original GCS algorithm. We demonstrate our results within the mobile robots paradigm.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fritzke B.: Growing cell structures—a self-organizing network for unsupervised and supervised learning. Neural Networks 7(9) (1994) 1441–1460.

    Google Scholar 

  2. Haykin S.: Neural Networks. Macmillan College Publishing Company, New York, (1994).

    Google Scholar 

  3. Kaufman L., Rousseeuw P.J.: Finding Groups in Data. An Introduction to Cluster Analysis. Wiley, New York, (1990).

    Google Scholar 

  4. Kohonen T.: The self-organizing map. Proceedings of the IEEE 78(9) (Sep 1990) 1464–1480.

    Google Scholar 

  5. Lippmann R.P.: Pattern classification using neural networks. IEEE Communications Magazine (Nov 1989) 47–64.

    Google Scholar 

  6. Papoulis A.: Probability, Random Variables, and Stochastic Processes. McGrawHill, 3rd edn., (1991).

    Google Scholar 

  7. Ripley B.D.: Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge, U.K., (1996).

    Google Scholar 

  8. Tråvén H.G.C.: A neural network approach to statistical pattern classification by “semiparametric” estimation of probability density functions. IEEE Transactions on Neural Networks 2(3) (May 1991) 366–377.

    Google Scholar 

  9. Vlassis N.A., Papakonstantinou G., Tsanakas P.: Robot map building by Kohonen's self-organizing neural networks. In: Proc. 1st Mobinet Symposium on Robotics for Health Care. Athens, Greece, (May 1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wulfram Gerstner Alain Germond Martin Hasler Jean-Daniel Nicoud

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vlassis, N.A., Dimopoulos, A., Papakonstantinou, G. (1997). The probabilistic growing cell structures algorithm. In: Gerstner, W., Germond, A., Hasler, M., Nicoud, JD. (eds) Artificial Neural Networks — ICANN'97. ICANN 1997. Lecture Notes in Computer Science, vol 1327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020228

Download citation

  • DOI: https://doi.org/10.1007/BFb0020228

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63631-1

  • Online ISBN: 978-3-540-69620-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics