ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

ماشین بردار پشتیبان یادگیری فعال×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learning
سال پیدایش20012001
پدیدآورTong, S. & Koller, D.Breiman, L.
نوعActive learning + kernel classifierEnsemble (bagging of decision trees)
منبع بنیادینTong, S., & Koller, D. (2001). Support Vector Machine Active Learning with Applications to Text Classification. Journal of Machine Learning Research, 2, 45–66. link ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
نام‌های دیگرActive SVM, AL-SVM, SVM active learning, query-by-committee SVMRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
مرتبط34
خلاصهActive learning SVM combines the strong decision-boundary of support vector machines with an intelligent query strategy that selects the most informative unlabeled instances for human annotation. Introduced by Tong and Koller in 2001, it achieves high classification accuracy using far fewer labeled examples than passive supervised learning, making it practical whenever labeling is expensive or slow.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مقایسهٔ روش‌ها: Active learning Support vector machine · Random Forest. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare