Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Verbeek, J. J., Vlassis, N., Kröse, B. · 2003 · Neural Computation

Abstract

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

Crossref · 10.1162/089976603762553004

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

The text we found for this paper looks like another document, so its claims and self-check weren’t run. The registry and citation checks still apply.

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

Show all 27 references

Research works printed but not linked: 1

  1. DerSimonian R., 1986, J. Roy. Statist. Soc. C, 35, 302

Cited by

See all 340

Metadata

Authors
Verbeek, J. J., Vlassis, N., & Kröse, B.
Affiliations
University of Amsterdam (NL)
Venue
Neural Computation
Published
2003-02-01
Volume
15
Issue
2
Pages
469-485
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2140136927
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
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.