Keywords
Benchmark (surveying)Computer scienceWord error rateProcess (computing)AlgorithmNoisy dataRule inductionArtificial intelligenceData miningMachine learning
Affiliated Institutions
Related Publications
An instance-weighting method to induce cost-sensitive trees
We introduce an instance-weighting method to induce cost-sensitive trees. It is a generalization of the standard tree induction process where only the initial instance weights d...
<b>ada</b>: An<i>R</i>Package for Stochastic Boosting
Boosting is an iterative algorithm that combines simple classification rules with "mediocre" performance in terms of misclassification error rate to produce a highly accurate cl...
Boosting the margin: a new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments\nwith boosting is that the test error of the generated classifier usually does\nnot increase as its size become...
Improving Performance in Neural Networks Using a Boosting Algorithm
A boosting algorithm converts a learning machine with error rate less than 50% to one with an arbitrarily low error rate. However, the algorithm discussed here depends on having...
Quickly Boosting Decision Trees - Pruning Underachieving Features Early
Boosted decision trees are one of the most popular and successful learning techniques used today. While exhibiting fast speeds at test time, relatively slow training makes them ...
Publication Info
- Year
- 1995
- Type
- book-chapter
- Pages
- 115-123
- Citations
- 3766
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
3766
OpenAlex
Cite This
William W. Cohen
(1995).
Fast Effective Rule Induction.
Elsevier eBooks
, 115-123.
https://doi.org/10.1016/b978-1-55860-377-6.50023-2
Identifiers
- DOI
- 10.1016/b978-1-55860-377-6.50023-2