The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Recursive unsupervised learning of finite mixture models
Open accessAbstract
There are two open problems when finite mixture densities are used to model multivariate data: the selection of the number of components and the initialization. In this paper, we propose an online (recursive) algorithm that estimates the parameters of the mixture and that simultaneously selects the number of components. The new algorithm starts with a large number of randomly initialized components. A prior is used as a bias for maximally structured models. A stochastic approximation recursive learning algorithm is proposed to search for the maximum a posteriori (MAP) solution and to discard the irrelevant components.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
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
A 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
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
Cited by
Improved adaptive Gaussian mixture model for background subtraction
Zivkovic, Z. (2004) · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · doi:10.1109/icpr.2004.1333992 · Cited by 1,951
Self-citationEfficient adaptive density estimation per image pixel for the task of background subtraction
Zivkovic, Z., & van der Heijden, F. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.11.005 · Cited by 1,557
Self-citationAn overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
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
Background subtraction in real applications: Challenges, current models and future directions
Garcia-Garcia, B., Bouwmans, T., & Rosales Silva, A. J. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2019.100204 · Cited by 337
Metadata
- Authors
- Zivkovic, Z., & van der Heijden, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-05
- Volume
- 26
- Issue
- 5
- Pages
- 651-656
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2152565110
- Cited by
- 266
- References
- 21
- FWCI
- 7.12
- Type
- journal article
- Language
- en
- Open access
- green
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: Recursive unsupervised learning of finite mixture models. https://app.cochat.ai/papers/10.1109/tpami.2004.1273970
- The paper
- Zivkovic, Z., & van der Heijden, F. (2004). Recursive unsupervised learning of finite mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2004.1273970
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.