Article ID: | iaor2014145 |
Volume: | 57 |
Issue: | 1 |
Start Page Number: | 129 |
End Page Number: | 165 |
Publication Date: | Jan 2014 |
Journal: | Computational Optimization and Applications |
Authors: | Mkel Marko, Karmitsa Napsu, Pulkkinen Seppo |
Keywords: | Newton method, noise, principal component analysis, trust regions |
In practical applications related to, for instance, machine learning, data mining and pattern recognition, one is commonly dealing with noisy data lying near some low‐dimensional manifold. A well‐established tool for extracting the intrinsically low‐dimensional structure from such data is principal component analysis (PCA). Due to the inherent limitations of this linear method, its extensions to extraction of nonlinear structures have attracted increasing research interest in recent years. Assuming a generative model for noisy data, we develop a probabilistic approach for separating the data‐generating nonlinear functions from noise. We demonstrate that ridges of the marginal density induced by the model are viable estimators for the generating functions. For projecting a given point onto a ridge of its estimated marginal density, we develop a generalized trust region Newton method and prove its convergence to a ridge point. Accuracy of the model and computational efficiency of the projection method are assessed via numerical experiments where we utilize Gaussian kernels for nonparametric estimation of the underlying densities of the test datasets.