Learning mixture models via component-wise parameter smoothing
From MaRDI portal
Publication:962310
DOI10.1016/j.csda.2009.04.012zbMath1464.62147OpenAlexW1985215876WikidataQ58312640 ScholiaQ58312640MaRDI QIDQ962310
Chandan K. Reddy, Bala Rajaratnam
Publication date: 6 April 2010
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2009.04.012
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (3)
Dealing with multiple local modalities in latent class profile analysis ⋮ Robust mixture model cluster analysis using adaptive kernels ⋮ Editorial: Second special issue on statistical algorithms and software
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- AN APPROACH TO TIME SERIES SMOOTHING AND FORECASTING USING THE EM ALGORITHM
- Mixture model clustering for mixed data with missing information
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
- Editorial: Advances in mixture models
- Text classification from labeled and unlabeled documents using EM
- Global optimization for molecular clusters using a new smoothing approach
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Edge-Preserving Smoothers for Image Processing
- Model-Based Gaussian and Non-Gaussian Clustering
- Adaptive partitioned random search to global optimization
- Efficient Greedy Learning of Gaussian Mixture Models
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
This page was built for publication: Learning mixture models via component-wise parameter smoothing
