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-17 от https://scholargate.app/bg/compare