Weak Learner
المُتعلِّم الضعيف
خوارزمية تصنيف أداؤها أفضل بقليل من التخمين العشوائي (أعلى من 50% بفارق طفيف). رغم ضعفه منفرداً يمكن دمجه مع غيره في أسلوب تعزيزي لتحقيق دقة عالية.
A classification algorithm that performs only slightly better than random guessing (just above 50% accuracy). Though weak alone, it can be combined with others via boosting to achieve high accuracy.
Also translated asالمصنِّف الضعيف، المتعلم البسيط، الفرضية الضعيفة
First appears in this corpus in: A Theory of the Learnable (1984)
Appears in these papers
- A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting1997in the sky ✦
- A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting1997in the sky ✦
- Bagging Predictors1996in the sky ✦
- Greedy Function Approximation: A Gradient Boosting Machine2001in the sky ✦
- A Theory of the Learnable1984in the sky ✦
- Rapid Object Detection Using a Boosted Cascade of Simple Features2001in the sky ✦
- Rapid Object Detection Using a Boosted Cascade of Simple Features2001in the sky ✦
- The Strength of Weak Learnability1990in the sky ✦
- The Strength of Weak Learnability1990in the sky ✦