Robust extraction of local structures by the minimum beta-divergence method.
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 beta-divergence. It searches a local PCA structure based on an initial location of the shifting parameter and a value for the tuning parameter beta. 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 beta and the initial value of the shifting parameter mu 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.
Mollah
Md Nurul Haque
MN
The Institute of Statistical Mathematics, Tachikawa, Tokyo, Japan. nhmollah@ism.ac.jp
Sultana
Nayeema
N
Minami
Mihoko
M
Eguchi
Shinto
S
D000465:Algorithms; D016000:Cluster Analysis; D003198:Computer Simulation; D016208:Databases, Factual; D007858:Learning; D016011:Normal Distribution; D025341:Principal Component Analysis; D013997:Time Factors