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/zh/compare