Growing hierarchical probabilistic self-organizing graphs

Abstract:

Since the introduction of the growing hierarchical self-organizing map, much work has been done on self-organizing neural models with a dynamic structure. These models allow adjusting the layers of the model to the features of the input dataset. Here we propose a new self-organizing model which is based on a probabilistic mixture of multivariate Gaussian components. The learning rule is derived from the stochastic approximation framework, and a probabilistic criterion is used to control the growth of the model. Moreover, the model is able to adapt to the topology of each layer, so that a hierarchy of dynamic graphs is built. This overcomes the limitations of the self-organizing maps with a fixed topology, and gives rise to a faithful visualization method for high-dimensional data. © 2011 IEEE.

Año de publicación:

2011

Keywords:

• Hierarchical self-organization
• Visualization
• Web mining
• unsupervised learning
• classification

Fuente:

scopus