The DOI matches its Crossref record; 26 of the 27 references it cites were found in a registry or an index.
Efficient Greedy Learning of Gaussian Mixture Models
Open accessAbstract
This article concerns the greedy learning of gaussian mixtures. In the greedy approach, mixture components are inserted into the mixture one aftertheother.We propose a heuristic for searching for the optimal component to insert. In a randomized manner, a set of candidate new components is generated. For each of these candidates, we find the locally optimal new component and insert it into the existing mixture. The resulting algorithm resolves the sensitivity to initialization of state-of-the-art methods, like expectation maximization, and has running time linear in the number of data points and quadratic in the (final) number of mixture components. Due to its greedy nature, the algorithm can be particularly useful when the optimal number of mixture components is unknown. Experimental results comparing the proposed algorithm to other methods on density estimation and texture segmentation are provided.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733
Self-citationA View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
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
On Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion)
Richardson, S., & Green, P. J. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00095 · Cited by 1,898
On Bayesian Analysis of Mixtures with an Unknown Number of Components
Richardson, S. T., & Green, P. J. (1997) · Cited by 919
The Geometry of Mixture Likelihoods: A General Theory
Lindsay, B. G. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346059 · Cited by 634
Research works printed but not linked: 1
- DerSimonian R., 1986, J. Roy. Statist. Soc. C, 35, 302
Cited by
A survey on deep learning and its applications
Dong, S., Wang, P., & Abbas, K. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100379 · Cited by 1,800
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
A tutorial on task-parameterized movement learning and retrieval
Calinon, S. (2016) · Intelligent Service Robotics · doi:10.1007/s11370-015-0187-9 · Cited by 422
Finite mixture models and model-based clustering
Melnykov, V., & Maitra, R. (2010) · Statistics Surveys · doi:10.1214/09-ss053 · Cited by 314
Genetic-based EM algorithm for learning Gaussian mixture models
Pernkopf, F., & Bouchaffra, D. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.162 · Cited by 265
Metadata
- Authors
- Verbeek, J. J., Vlassis, N., & Kröse, B.
- Affiliations
- University of Amsterdam (NL)
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2003-02-01
- Volume
- 15
- Issue
- 2
- Pages
- 469-485
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2140136927
- Semantic Scholar
- 0c20cf7ce72d0df1e7a72ad4a94aed2a37c5a1c3
- Cited by
- 340
- References
- 27
- Citations by year
- 2026: 1 · 2025: 7 · 2024: 10 · 2023: 6 · 2022: 4 · 2021: 13 · 2020: 18 · 2019: 7 · 2018: 12 · 2017: 14 · 2016: 24 · 2015: 14 · 2014: 22 · 2013: 13 · 2012: 9
- FWCI
- 18.46
- Type
- journal article
- Language
- en
- Open access
- green
- orbilu.uni.lu
- Licence
- other-oa
- Locations
- Neural Computation (publishedVersion)
- PubMed (publishedVersion)
- UvA-DARE (University of Amsterdam) (publishedVersion)
- Open Repository and Bibliography (University of Luxembourg) (submittedVersion, other-oa)
- HAL (submittedVersion, other-oa)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Stichting voor de Technische Wetenschappen
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Methods and Mixture Models
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Keywords
- Gaussian mixture model, greedy learning, component insertion, density estimation, texture segmentation, model selection, expectation-maximization algorithm
- MeSH terms
- Algorithms, Learning, Normal Distribution
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Greedy Learning of Gaussian Mixture Models. https://app.cochat.ai/papers/10.1162/089976603762553004
- The paper
- Verbeek, J. J., Vlassis, N., & Kröse, B. (2003). Efficient Greedy Learning of Gaussian Mixture Models. Neural Computation. https://doi.org/10.1162/089976603762553004
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.