Computationally efficient learning of multivariate \(t\) mixture models with missing information
From MaRDI portal
Publication:964652
DOI10.1007/s00180-008-0129-5zbMath1189.62095OpenAlexW2060488211MaRDI QIDQ964652
Publication date: 22 April 2010
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-008-0129-5
Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Point estimation (62F10)
Related Items (10)
Learning from incomplete data via parameterized \(t\) mixture models through eigenvalue decomposition ⋮ Automated learning of factor analysis with complete and incomplete data ⋮ Robust model-based clustering via mixtures of skew-\(t\) distributions with missing information ⋮ Supervised learning of multivariate skew normal mixture models with missing information ⋮ Model-based clustering of multivariate skew data with circular components and missing values ⋮ Asymmetric clusters and outliers: mixtures of multivariate contaminated shifted asymmetric Laplace distributions ⋮ Capturing patterns via parsimonious \(t\) mixture models ⋮ An efficient ECM algorithm for maximum likelihood estimation in mixtures of \(t\)-factor analyzers ⋮ Mixtures of generalized hyperbolic distributions and mixtures of skew-\(t\) distributions for model-based clustering with incomplete data ⋮ Discussion of `Model-based clustering and classification with non-normal mixture distributions' by Lee and McLachlan
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Robust clustering by deterministic agglomeration EM of mixtures of multivariate \(t\)-distributions
- On fast supervised learning for normal mixture models with missing information
- Finite mixture and Markov switching models.
- Maximum likelihood estimation via the ECM algorithm: A general framework
- Inference and missing data
- Parameter expansion to accelerate EM: the PX-EM algorithm
- The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
- Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
- Bayesian Density Estimation and Inference Using Mixtures
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: Computationally efficient learning of multivariate \(t\) mixture models with missing information