Machine learningMachine learning

Aktivno učenje K-najbližih susjeda

Aktivno učenje s K-najbližim susjedima kombinira predviđanje KNN-a temeljeno na instancama s iterativnom strategijom upita koja odabire najinformativnije neoznačene primjere za anotaciju. Model traži oznake samo za instance gdje su margine glasova susjedstva najuže, postižući konkurentnu točnost s daleko manje označenih primjera nego potpuno nadzirani KNN na tabličnim podacima.

Otvorite u MethodMindUskoroVideoUskoroDownload slides

Pročitajte cijelu metodu

Samo za članove

Prijavite se besplatnim računom kako biste pročitali ovaj odjeljak.

Prijavite se

Method map

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

Izvori

  1. Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison. link
  2. Zhu, X., Lafferty, J., & Ghahramani, Z. (2003). Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions. Proceedings of the ICML 2003 Workshop on the Continuum from Labeled to Unlabeled Data, 58–65. link

Kako citirati ovu stranicu

ScholarGate. (2026, June 3). Active Learning with K-Nearest Neighbors Classifier. ScholarGate. https://scholargate.app/hr/machine-learning/active-learning-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
ScholarGateActive learning K-nearest neighbors (Active Learning with K-Nearest Neighbors Classifier). Preuzeto 2026-06-15 s https://scholargate.app/hr/machine-learning/active-learning-k-nearest-neighbors · Skup podataka: https://doi.org/10.5281/zenodo.20539026