Comparer des méthodes

	Ensemble de K plus proches voisins	Ensemble par vote
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2000s	1990s–2004
Auteur d'origine	Domeniconi, C. & Yan, B. (key formalization)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Type	Ensemble (aggregated KNN classifiers/regressors)	Ensemble (combination of multiple classifiers by vote)
Source fondatrice	Domeniconi, C., & Yan, B. (2004). Nearest neighbor ensemble. In Proceedings of the 17th International Conference on Pattern Recognition (ICPR), Vol. 1, pp. 228–231. IEEE.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
Alias	Ensemble KNN, KNN ensemble, aggregated k-nearest neighbors, combined KNN	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Apparentées	5	5
Résumé	Ensemble K-Nearest Neighbors combines multiple KNN models — each trained with a different value of k, distance metric, feature subset, or data bootstrap — and aggregates their predictions by majority vote (classification) or averaging (regression). The approach reduces the high variance inherent in any single KNN model and produces more stable, accurate predictions on tabular data.	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.