Compară metode

	Model Gaussian Mixture cu Învățare Activă	Proces Gaussian de Învățare Activă
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	2000s (combination)	1992
Autorul original	Settles, B. (active learning framework); Dempster, Laird & Rubin (GMM via EM, 1977)	MacKay, D. J. C.
Tip	Active learning for probabilistic clustering / density estimation	Bayesian active learning
Sursa seminală	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.	MacKay, D. J. C. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 590–604.
Denumiri alternative	AL-GMM, active GMM, query-by-committee GMM, active density estimation	GP active learning, Gaussian process active learning, GP-AL, Bayesian active learning with GP
Înrudite	4	4
Rezumat	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.	Active Learning Gaussian Process (GP-AL) combines a Gaussian process probabilistic model with an active learning query strategy, using the GP's posterior uncertainty to select the most informative unlabeled examples for labeling. This iterative approach minimizes labeling effort while maximizing predictive accuracy, making it ideal when labeled data is scarce or expensive to obtain.