手法を比較

	アンサンブルK近傍法	バギング（ブートストラップ集約）
分野	機械学習	機械学習
系統	Machine learning	Machine learning
提唱年	2000s	1996
提唱者	Domeniconi, C. & Yan, B. (key formalization)	Breiman, L.
種類	Ensemble (aggregated KNN classifiers/regressors)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
原典	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.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
別名	Ensemble KNN, KNN ensemble, aggregated k-nearest neighbors, combined KNN	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
関連	5	5
概要	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.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.