Comparar métodos

	Processo Gaussiano em Conjunto	Comitê de Votação
Área	Aprendizado de máquina	Aprendizado de máquina
Família	Machine learning	Machine learning
Ano de origem	2000–2015	1990s–2004
Autor original	Tresp, V. (committee formulation); Deisenroth, M. P. & Ng, J. W. (distributed formulation)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Tipo	Ensemble of probabilistic surrogate models	Ensemble (combination of multiple classifiers by vote)
Fonte seminal	Tresp, V. (2000). A Bayesian Committee Machine. Neural Computation, 12(11), 2719–2741.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
Outros nomes	Gaussian Process ensemble, GP committee machine, distributed GP, mixture of GPs	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Relacionados	4	5
Resumo	Ensemble Gaussian Process trains multiple independent GP experts on data subsets or overlapping regions, then combines their posterior predictions — means and variances — into a single probabilistic forecast. This approach retains the calibrated uncertainty estimates of standard GPs while overcoming their O(n³) cubic cost bottleneck, making probabilistic regression practical on datasets with thousands to millions of observations.	A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.