Bregman divergences for growing hierarchical self-organizing networks.
Growing hierarchical self-organizing models are characterized by the flexibility of their structure, which can easily accommodate for complex input datasets. However, most proposals use the Euclidean distance as the only error measure. Here we propose a way to introduce Bregman divergences in these models, which is based on stochastic approximation principles, so that more general distortion measures can be employed. A procedure is derived to compare the performance of networks using different divergences. Moreover, a probabilistic interpretation of the model is provided, which enables its use as a Bayesian classifier. Experimental results are presented for classification and data visualization applications, which show the advantages of these divergences with respect to the classical Euclidean distance.
Department of Computer Science, University of Malaga, 29071, Spain.
Ezequiel
E
López-Rubio
Esteban José
EJ
Palomo
Enrique
E
Domínguez
D000465:Algorithms; D001185:Artificial Intelligence; D006801:Humans; D008959:Models, Neurological; D016571:Neural Networks, Computer; D014894:Weights and Measures