The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Genetic-based EM algorithm for learning Gaussian mixture models
Abstract
We propose a genetic-based expectation-maximization (GA-EM) algorithm for learning Gaussian mixture models from multivariate data. This algorithm is capable of selecting the number of components of the model using the minimum description length (MDL) criterion. Our approach benefits from the properties of Genetic algorithms (GA) and the EM algorithm by combination of both into a single procedure. The population-based stochastic search of the GA explores the search space more thoroughly than the EM method. Therefore, our algorithm enables escaping from local optimal solutions since the algorithm becomes less sensitive to its initialization. The GA-EM algorithm is elitist which maintains the monotonic convergence property of the EM algorithm. The experiments on simulated and real data show that the GA-EM outperforms the EM method since: 1) We have obtained a better MDL score while using exactly the same termination condition for both algorithms. 2) Our approach identifies the number of components which were used to generate the underlying data more often than the EM algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
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
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
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
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
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
Statistical Analysis of Finite Mixture Distributions.
Newton, J., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1986) · Biometrics · doi:10.2307/2531224 · Cited by 1,986
On Convergence Properties of the EM Algorithm for Gaussian Mixtures
Xu, L., & Jordan, M. I. (1996) · Neural Computation · doi:10.1162/neco.1996.8.1.129 · Cited by 756
Maximum Likelihood Estimation from Incomplete Data
Hartley, H. O. (1958) · Biometrics · doi:10.2307/2527783 · Cited by 602
Learning mixtures of Gaussians
Dasgupta, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814639 · Cited by 588
SMEM Algorithm for Mixture Models
Ueda, N., Nakano, R., Ghahramani, Z., & Hinton, G. E. (2000) · Neural Computation · doi:10.1162/089976600300015088 · Cited by 409
Efficient Greedy Learning of Gaussian Mixture Models
Verbeek, J. J., Vlassis, N., & Kröse, B. (2003) · Neural Computation · doi:10.1162/089976603762553004 · Cited by 340
Evolutionary computation: an overview
Back, T., & Schwefel, H.-P. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542329 · Cited by 237
A Component-Wise EM Algorithm for Mixtures
Celeux, G., Chrétien, S., Forbes, F., & Mkhadri, A. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/106186001317243403 · Cited by 145
BYY harmony learning, structural RPCL, and topological self-organizing on mixture models
Xu, L. (2002) · Neural Networks · doi:10.1016/s0893-6080(02)00084-9 · Cited by 115
Clustering in image space for place recognition and visual annotations for human-robot interaction
Martı́nez, A. M., & Vitria, J. M. (2001) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/3477.956029 · Cited by 33
Cited by
Automatic Design and Manufacture of Soft Robots
Hiller, J., & Lipson, H. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2172702 · Cited by 311
An Approach for Determining the Number of Clusters in a Model-Based Cluster Analysis
Akogul, S., & Erisoglu, M. (2017) · Entropy · doi:10.3390/e19090452 · Cited by 269
A survey of methods for 3D histology reconstruction
Pichat, J., Iglesias, J. E., Yousry, T., Ourselin, S., & Modat, M. (2018) · Medical Image Analysis · doi:10.1016/j.media.2018.02.004 · Cited by 207
Tuli, S., Gill, S. S., Casale, G., & Jennings, N. R. (2020) · Internet Technology Letters · doi:10.1002/itl2.198 · Cited by 23
Metadata
- Authors
- Pernkopf, F., & Bouchaffra, D.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2005-08
- Volume
- 27
- Issue
- 8
- Pages
- 1344-1348
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2124369546
- Cited by
- 265
- References
- 22
- FWCI
- 13.40
- 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.