Growing Graph Network Based on an Online Gaussian Mixture Model

  • Kazuhiro Tokunaga
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6731)


In this paper, the author proposes a growing neural network based on an online Gaussian mixture model, in which mechanisms are included for growing Gaussian kernels and finding topologies between kernels using graph paths. The proposed method has the following advantages compared with conventional growing neural networks: no permanent increase in nodes (Gaussian kernels), robustness to noise, and increased speed of constructing networks. This paper presents the theory and algorithm for the proposed method and the results of verification experiments using artificial data.


Growing Neural Networks Gaussian Mixture Model Graph Online 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fritzke, B.: A growing neural gas network learns topologies. Advances in Neural Information Processing Systems 7, 625–632 (1995)Google Scholar
  2. 2.
    Deng, D., Kasabov, N.: On-line pattern analysis by evolving self-organizing maps. Neurocomputing 51, 87–103 (2003)CrossRefGoogle Scholar
  3. 3.
    Shen, F., Hasegawa, O.: An incremental network for on-line unsupervised classification and topology learning. Neural Networks 19(1), 90–106 (2006)CrossRefzbMATHGoogle Scholar
  4. 4.
    Akaike, H.: A new look at the statistical model identification. IEEE Transaction on Automatic Control 19(6), 716–723 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Schwarz, Gideon, E.: Estimating the dimension of a model. Annals of Statistics 6(2), 461–464 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Kazuhiro Tokunaga
    • 1
  1. 1.Kyushu Institute of TechnologyFukuokaJapan

Personalised recommendations