ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Semi-supervised Active Learning×Etikettpropagering×
ÄmnesområdeMaskininlärningMaskininlärning
FamiljMachine learningMachine learning
Ursprungsår20022002
UpphovspersonMuslea, I., Minton, S., & Knoblock, C. A.Zhu, X. & Ghahramani, Z.
TypHybrid learning frameworkGraph-based semi-supervised classification
UrsprungskällaSettles, B. (2012). Active Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool. DOI ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗
AliasSSAL, active semi-supervised learning, query-based semi-supervised learning, semi-supervised learning with active queriesLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
Närliggande33
SammanfattningSemi-supervised Active Learning (SSAL) is a hybrid learning paradigm that combines active learning's selective query strategy with semi-supervised learning's ability to exploit unlabeled data. The model iteratively selects the most informative unlabeled instances for expert annotation while simultaneously leveraging the large pool of unannotated samples to improve its own representations, dramatically reducing labeling costs while maintaining strong predictive accuracy.Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.
ScholarGateDatamängd
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 3 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Semi-supervised Active Learning · Label Propagation. Hämtad 2026-06-17 från https://scholargate.app/sv/compare