Intrinsic Dimension Estimation by Maximum Likelihood in Probabilistic PCA
Explore this paper's citation graph
Summary
This work demonstrates the asymptotic consistency of the maximum likelihood criterion for determining the intrinsic dimension of a dataset in a isotropic version of Probabilistic Principal Component Analysis (PPCA).
- Type
- preprint
- Published
- 2010-08-09
- Cited by
- 15
- References
- 27
- OpenAlex
- https://openalex.org/W16104578
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:8222545
Keywords
Dimension (graph theory), Principal component analysis, Consistency (knowledge bases), Probabilistic logic, Intrinsic dimension
References
- Statistical Factor Analysis and Related Methods
- A global geometric framework for nonlinear dimensionality reduction.
- An Algorithm for Finding Intrinsic Dimensionality of Data
- Data dimensionality estimation methods: a survey
- Asymptotic Inference for Eigenvectors
- Nonlinear dimensionality reduction by locally linear embedding.
- Representation and separation of signals using nonlinear PCA type learning
- Latent Variable Models and Factor Analysis
- Intrinsic dimension estimation of manifolds by incising balls
- Products of Gaussians and Probabilistic Minor Component Analysis
- Extreme Components Analysis
- An Intrinsic Dimensionality Estimator from Near-Neighbor Information
- Estimating the Intrinsic Dimension of Data with a Fractal-Based Method
- Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps
- An Evaluation of Intrinsic Dimensionality Estimators
- Probabilistic Principal Component Analysis
- Intrinsic Dimension Estimation Using Packing Numbers
- Automatic Choice of Dimensionality for PCA
- The Scree Test For The Number Of Factors.
- High-Dimensional Discriminant Analysis
Cited by
- Classification et modélisation de sorties fonctionnelles de codes de calcul : application aux calculs thermo-hydrauliques accidentels dans les réacteurs à eau pressurisés (REP)
- Model-based clustering of time series in group-specific functional subspaces
- Vector quantization based approximate spectral clustering of large datasets
- Gaussian mixture models for the classification of high‐dimensional vibrational spectroscopy data
- HDclassif: an R Package for Model-Based Clustering and Discriminant Analysis of High-Dimensional Data
- Contributions à l'apprentissage statistique en grande dimension, adaptatif et sur données atypiques
- Robust clustering of high-dimensional data
- A Proposition for Fixing the Dimensionality of a Laplacian Low-rank Approximation of any Binary Data-matrix
- Espace intrinsèque d'un graphe et recherche de communautés
- Relevant Eigen-Subspace of a Graph : A Randomization Test.
- Slimming down a high-dimensional binary datatable: relevant eigen-subspace and substantial content
- Modeling and Algorithms
- Project-Team mistis Modelling and Inference of Complex and Structured Stochastic Systems
- Characteristics of Local Intrinsic Dimensionality (LID) in Subspaces: Local Neighbourhood Analysis
- II Model-based Clustering of Time Series in Group-speci c Functional Subspaces ∗
Related papers
- On retine.
- Proceedings of the National Academy of Sciences of the United States of America: In This Issue.
- On Functional Equations in Linear Topological Spaces.
- Rolling back to BOULE
- Wildland-urban fire disasters aren’t actually a wildfire problem
- Groups of Collineations in a Space of Paths.
- Powerful screens for bacterial virulence proteins.
- Neanderthal symbolism and ornament manufacture: The bursting of a bubble?