ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Машина опорных векторов с частичной разметкой×Случайный лес×
ОбластьМашинное обучениеМашинное обучение
СемействоMachine learningMachine learning
Год появления19992001
Автор методаJoachims, T.Breiman, L.
ТипSemi-supervised classifierEnsemble (bagging of decision trees)
Основополагающий источникJoachims, T. (1999). Transductive Inference for Text Classification using Support Vector Machines. Proceedings of the 16th International Conference on Machine Learning (ICML), 200–209. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Другие названияS3VM, Transductive SVM, TSVM, Semi-SVMRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Связанные44
СводкаSemi-supervised Support Vector Machine (S3VM) extends the classical SVM by incorporating large quantities of unlabeled data alongside a small labeled training set. It seeks a maximum-margin hyperplane that not only separates the labeled examples but also passes through low-density regions of the full data distribution, yielding better generalization when labeled samples are scarce.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Semi-supervised Support Vector Machine · Random Forest. Получено 2026-06-15 из https://scholargate.app/ru/compare