ScholarGate
Assistent
Machine learningMachine learning

Ensemble K-Nearest Neighbors

Ensemble K-Nearest Neighbors kombinerer flere KNN-modeller — hver trænet med en forskellig værdi af k, afstandsmetrik, funktionssubset eller databootstrap — og aggregerer deres forudsigelser ved flertalsafstemning (klassifikation) eller gennemsnit (regression). Tilgangen reducerer den høje varians, der er iboende i enhver enkelt KNN-model, og producerer mere stabile, nøjagtige forudsigelser på tabeldata.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. 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. DOI: 10.1109/ICPR.2004.1334065
  2. Zhou, Z.-H. (2012). Ensemble Methods: Foundations and Algorithms. Chapman and Hall/CRC. ISBN: 978-1-4398-3003-1

Sådan citerer du denne side

ScholarGate. (2026, June 3). Ensemble K-Nearest Neighbors (Aggregated KNN). ScholarGate. https://scholargate.app/da/machine-learning/ensemble-k-nearest-neighbors

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateEnsemble K-nearest neighbors (Ensemble K-Nearest Neighbors (Aggregated KNN)). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/ensemble-k-nearest-neighbors · Datasæt: https://doi.org/10.5281/zenodo.20539026