Abstract
This paper discusses a new highly robust learning algorithm for exploring local principal component analysis (PCA) structures in which an observed data follow one of several heterogeneous PCA models. The proposed method is formulated by minimizing β-divergence. It searches a local PCA structure based on an initial location of the shifting parameter and a value for the tuning parameter β. If the initial choice of the shifting parameter belongs to a data cluster, then the proposed method detects the local PCA structure of that data cluster, ignoring data in other clusters as outliers. We discuss the selection procedures for the tuning parameter β and the initial value of the shifting parameter μ in this article. We demonstrate the performance of the proposed method by simulation. Finally, we compare the proposed method with a method based on a finite mixture model.
Original language | English |
---|---|
Pages (from-to) | 226-238 |
Number of pages | 13 |
Journal | Neural Networks |
Volume | 23 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2010 Mar |
Keywords
- Adaptive selection for the tuning parameter
- Cross validation
- Initialization of the parameters
- Local PCA
- Sequential estimation
- β-divergence
ASJC Scopus subject areas
- Cognitive Neuroscience
- Artificial Intelligence