A Two-round Variant of EM for Gaussian Mixtures
Not on the map. Why?
Abstract (arXiv)
Given a set of possible models (e.g., Bayesian network structures) and a data sample, in the unsupervised model selection problem the task is to choose the most accurate model with respect to the domain joint probability distribution. In contrast to this, in supervised model selection it is a priori known that the chosen model will be used in the future for prediction tasks involving more ``focused' predictive distributions. Although focused predictive distributions can be produced from the joint probability distribution by marginalization, in practice the best model in the unsupervised sense does not necessarily perform well in supervised domains. In particular, the standard marginal likelihood score is a criterion for the unsupervised task, and, although frequently used for supervised model selection also, does not perform well in such tasks. In this paper we study the performance of the marginal likelihood score empirically in supervised Bayesian network selection tasks by using a large number of publicly available classification data sets, and compare the results to those obtained by alternative model selection criteria, including empirical crossvalidation methods, an approximation of a supervised marginal likelihood measure, and a supervised version of Dawids prequential(predictive sequential) principle.The results demonstrate that the marginal likelihood score does NOT perform well FOR supervised model selection, WHILE the best results are obtained BY using Dawids prequential r napproach.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jan 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 3; 2024: 2; 2025: 3.
11 papers.
- 2023Over-Parameterization Exponentially Slows Down Gradient Descent for Learning a Single Neuroncited by 25
- 2021Differentially-Private Clustering of Easy Instancescited by 17
- 2024Toward Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixture Modelscited by 6
- 2021Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussianscited by 4
- 2022On unsupervised projections and second order signalscited by 1
- 2024Mixture-Models: a one-stop Python Library for Model-based Clustering using various Mixture Modelscited by 1
- 2025Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modelingcited by 1
- 2023Semidefinite programming on population clustering: a global analysiscited by 0
- 2023Optimal Transport for Kernel Gaussian Mixture Modelscited by 0
- 2025Learning Overspecified Gaussian Mixtures Exponentially Fast with the EM Algorithmcited by 0
- 2025Overspecified Mixture Discriminant Analysis: Exponential Convergence, Statistical Guarantees, and Remote Sensing Applicationscited by 0
- 2025Overspecified Mixture Discriminant Analysis: Exponential Convergence, Statistical Guarantees, and Remote Sensing Applications30 Oct 2025
- 2025Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modeling28 Jul 2025
- 2025Learning Overspecified Gaussian Mixtures Exponentially Fast with the EM Algorithm13 Jun 2025
- 2024Toward Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixture Models29 Jun 2024
- 2024Mixture-Models: a one-stop Python Library for Model-based Clustering using various Mixture Models8 Feb 2024
- 2023Optimal Transport for Kernel Gaussian Mixture Models28 Oct 2023
- 2023Over-Parameterization Exponentially Slows Down Gradient Descent for Learning a Single Neuron20 Feb 2023
- 2023Semidefinite programming on population clustering: a global analysis1 Jan 2023
- 2022On unsupervised projections and second order signals11 Apr 2022
- 2021Differentially-Private Clustering of Easy Instances29 Dec 2021
- 2021Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians2 Sep 2021