The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Mixtures of Probabilistic Principal Component Analyzers
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 expectation-maximization 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
LIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,633
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Journal of the Royal Statistical Society (B)
Fildes, R. (1993) · International Journal of Forecasting · doi:10.1016/0169-2070(93)90088-5 · Cited by 3,437
Nonlinear principal component analysis using autoassociative neural networks
Kramer, M. A. (1991) · AIChE Journal · doi:10.1002/aic.690370209 · Cited by 3,037
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
A database for handwritten text recognition research
Hull, J. J. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.291440 · Cited by 2,244
Journal of the Royal Statistical Society.
(1921) · The Economic Journal · doi:10.1093/ej/31.121.133 · Cited by 1,465
GTM: The Generative Topographic Mapping
Bishop, C. M., Svensén, M., & Williams, C. K. I. (1998) · Neural Computation · doi:10.1162/089976698300017953 · Cited by 1,388
Self-citationHastie, T., & Stuetzle, W. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478797 · Cited by 1,249
Asymptotic Theory for Principal Component Analysis
Anderson, T. W. (1963) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704248 · Cited by 1,150
Latent Variable Models and Factor Analysis
Tatsuoka, K., & Bartholomew, D. J. (1989) · Journal of Educational Statistics · doi:10.2307/1164730 · Cited by 1,008
Statistical Inference in Factor Analysis
Anderson, T. W., & Rubin, H. (1956) · Project Euclid (Cornell University) · Cited by 954
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
Subspace methods of pattern recognition
(1984) · Signal Processing · doi:10.1016/0165-1684(84)90028-8 · Cited by 791
Dimension Reduction by Local Principal Component Analysis
Kambhatla, N., & Leen, T. K. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1493 · Cited by 717
EM Algorithms for ML Factor Analysis
Rubin, D. B., & Thayer, D. T. (1982) · Psychometrika · doi:10.1007/bf02293851 · Cited by 603
Statistical Factor Analysis and Related Methods: Theory and Applications
Basilevsky, A. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316894 · Cited by 449
A novelty detection approach to classification
Japkowicz, N., Myers, C. E., & Gluck, M. A. (1995) · Cited by 412
Modeling the manifolds of images of handwritten digits
Hinton, G. E., Dayan, P., & Revow, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554192 · Cited by 330
Estimation and Tests of Significance in Factor Analysis
Rao, C. R. (1955) · Psychometrika · doi:10.1007/bf02288983 · Cited by 306
Tibshirani, R. (1992) · Statistics and Computing · doi:10.1007/bf01889678 · Cited by 221
A hierarchical latent variable model for data visualization
Bishop, C. M., & Tipping, M. E. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667885 · Cited by 201
Self-citationMode-finding for mixtures of Gaussian distributions
Carreira-Perpinan, M. A. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.888716 · Cited by 192
Optimally adaptive transform coding
Dony, R. D., & Haykin, S. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.465101 · Cited by 105
Multivariate Analysis, Part 2: Classification, Covariance Structures, and Repeated Measurements
Shanmugam, R., Krzanowski, W. J., & Marriott, F. H. C. (1997) · Technometrics · doi:10.2307/1270779 · Cited by 103
Inferring the eigenvalues of covariance matrices from limited, noisy data
Everson, R., & Roberts, S. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847792 · Cited by 99
Hierarchical GTM: constructing localized nonlinear projection manifolds in a principled way
Peter Tiňo, B., & Nabney, I. T. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000238 · Cited by 98
Recognizing Handwritten Digits Using Mixtures of Linear Models
Hinton, G. E., Revow, M. D., & Dayan, P. (1994) · Cited by 97
Wang, Y., Luo, L., Freedman, M. T., & Kung, S. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846734 · Cited by 73
Improved Gaussian Mixture Density Estimates Using Bayesian Penalty Terms and Network Averaging
Ormoneit, D., & Tresp, V. (1995) · Cited by 65
A Neural Network Autoassociator for Induction Motor Failure Prediction
Petsche, T., Marcantonio, A., Darken, C. J., Hanson, S. J., Kuhn, G. M., & Santoso, N. I. (1995) · neural information processing systems · Cited by 42
The Bayesian Evidence Scheme for Regularizing Probability-Density Estimating Neural Networks
Husmeier, D. (2000) · Neural Computation · doi:10.1162/089976600300014890 · Cited by 28
Cited by
Investigations into resting-state connectivity using independent component analysis
Beckmann, C. F., DeLuca, M., Devlin, J. T., & Smith, S. M. (2005) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2005.1634 · Cited by 3,398
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Probabilistic Independent Component Analysis for Functional Magnetic Resonance Imaging
Beckmann, C. F., & Smith, S. M. (2004) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2003.822821 · Cited by 2,715
Unsupervised learning of finite mixture models
Figueiredo, M. A. T., & Jain, A. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990138 · Cited by 2,125
Independent Component Analysis: Principles and Practice
(2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624148 · Cited by 1,917
Metadata
- Authors
- Tipping, M. E., & Bishop, C. M.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 1999-02-01
- Volume
- 11
- Issue
- 2
- Pages
- 443-482
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2146610201
- Cited by
- 1,873
- References
- 37
- FWCI
- 54.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.