Journal ArticleDOI
Mixtures of probabilistic principal component analyzers
Reads0
Chats0
TLDR
PCA is formulated within a maximum likelihood framework, based on a specific form of gaussian latent variable model, which leads to a well-defined mixture model for probabilistic principal component analyzers, whose parameters can be determined using an expectation-maximization algorithm.Abstract:
Principal component analysis (PCA) is one of the most popular techniques for processing, compressing, and visualizing data, although its effectiveness is limited by its global linearity. While nonlinear variants of PCA have been proposed, an alternative paradigm is to capture data complexity by a combination of local linear PCA projections. However, conventional PCA does not correspond to a probability density, and so there is no unique way to combine PCA models. Therefore, previous attempts to formulate mixture models for PCA have been ad hoc to some extent. In this article, PCA is formulated within a maximum likelihood framework, based on a specific form of gaussian latent variable model. This leads to a well-defined mixture model for probabilistic principal component analyzers, whose parameters can be determined using an expectationmaximization algorithm. We discuss the advantages of this model in the context of clustering, density modeling, and local dimensionality reduction, and we demonstrate its application to image compression and handwritten digit recognition.read more
Citations
More filters
Journal Article
Multiscale dictionary learning: non-asymptotic bounds and robustness
TL;DR: In this article, the authors prove non-asymptotic probabilistic bounds on the approximation error of Geometric Multi-Resolution Analysis (GMRA) for a rich class of data-generating statistical models that includes "noisy" manifolds.
Journal ArticleDOI
A Bayesian approach to object detection using probabilistic appearance-based models
TL;DR: A Bayesian approach, inspired by probabilistic principal component analysis (PPCA), to detect objects in complex scenes using appearance-based models, showing a major improvement in detection performances with respect to the standard methods up to now.
Journal ArticleDOI
Robust PCA Methods for Complete and Missing Data
TL;DR: This paper considers and introduces methods for robust principal component analysis (PCA), including also cases where there are missing values in the data, and introduces robust methods for estimation of both thePCA eigenvectors directly or the PCA subspace spanned by them.
Posted Content
Shapley Values of Reconstruction Errors of PCA for Explaining Anomaly Detection
TL;DR: In this paper, a method to compute the Shapley values of reconstruction errors of principal component analysis (PCA) is presented, which is particularly useful in explaining the results of anomaly detection based on PCA.
Journal ArticleDOI
A General Framework for Understanding Compressed Subspace Clustering Algorithms
TL;DR: A general framework for analyzing the performance of various subspace clustering algorithms when applied to the compressed data is proposed based on the recently proposed restricted isometric property of Gaussian random projection for low-dimensional subspaces.
References
More filters
Journal ArticleDOI
Maximum likelihood from incomplete data via the EM algorithm
Book
Neural networks for pattern recognition
TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Book
Principal Component Analysis
TL;DR: In this article, the authors present a graphical representation of data using Principal Component Analysis (PCA) for time series and other non-independent data, as well as a generalization and adaptation of principal component analysis.
Book ChapterDOI
Neural Networks for Pattern Recognition
Suresh Kothari,Heekuck Oh +1 more
TL;DR: The chapter discusses two important directions of research to improve learning algorithms: the dynamic node generation, which is used by the cascade correlation algorithm; and designing learning algorithms where the choice of parameters is not an issue.
Journal ArticleDOI
LIII. On lines and planes of closest fit to systems of points in space
TL;DR: This paper is concerned with the construction of planes of closest fit to systems of points in space and the relationships between these planes and the planes themselves.