Active learning Gaussian mixture model
Active Learning Gaussian Mixture Model combines an iterative query strategy with a Gaussian Mixture Model learner. The algorithm selects the most informative unlabeled points — typically those with highest predictive uncertainty — presents them to an oracle for labeling, and refits the GMM using EM on the growing labeled set. The result is a density model that matches full-data quality while requiring far fewer labeled examples.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
- Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. Proceedings of the 20th International Conference on Machine Learning (ICML), 912–919. · URL
- Settles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6(1), 1–114. Morgan & Claypool Publishers. · DOI 10.2200/S00429ED1V01Y201207AIM018
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.