Global-local learning strategies in probabilistic principal components analysis
Abstract
We present a neural model which extends classical competitive learning by performing a Probabilistic Principal Components Analysis at each neuron. In the learning process is utilized a competition rule which try to get the better representation of the dataset while maintaining the homogeneity of the formed clusters. The model also has the ability to learn the number of basis vectors required to represent the principal directions of each cluster, so it overcomes a drawback of most local PCA models, where the dimensionality of a cluster must be fixed a priori.
Citation
Please, cite this work as:
[Lóp+06] E. López-Rubio, J. Ortiz-de-Lazcano-Lobato, D. López-Rodríguez, et al. “Global-local learning strategies in probabilistic principal components analysis”. In: Artificial Intelligence and Soft Computing, August 28-30, 2006, Palma de Mallorca, Spain. Ed. by A. P. del Pobil. cited By 0; Conference of 10th IASTED International Conference on Artificial Intelligence and Soft Computing, ASC 2006 ; Conference Date: 28 August 2006 Through 30 August 2006; Conference Code:74030. Palma de Mallorca: IASTED/ACTA Press, 2006, pp. 46-51. URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-56149099517&partnerID=40&md5=d435d7f751c9133a83357d3c5c884fd0.