Upper bounds for error rates of linear combinations of classifiers

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 24, Issue 5, 2002, Pages 591-602

  Murua, Alejandro ^a,b  

^a IEEE   (United States)

^b Insightful Corporation   (United States)

Author keywords

Classification trees; Exponential bounds; Machine learning; Weakly dependent classifiers

Indexed keywords

BAGGING; BOOSTING; DECISION RULE; ERROR RATES; EXPONENTIAL BOUNDS; LINEAR COMBINATIONS; MEAN SQUARED ERROR; RANDOMIZED TREES; WEAKLY DEPENDENT CLASSIFIERS;

ERROR ANALYSIS; KNOWLEDGE BASED SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; REGRESSION ANALYSIS; THEOREM PROVING; TREES (MATHEMATICS);

PATTERN RECOGNITION SYSTEMS;

EID: 0036565802     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.1000235     Document Type: Article

References (28)

1. Shape quantization and recognition with randomized trees
2. Boosting a weak learning algorithm by majority
3. Experiments with a new boosting algorithm
4. Boosting decision trees
5. Bagging predictors
6. Bias, variance and arcing classifiers
7. Using adaptive bagging to debias regressions
8. Bagging, boosting, and C4.5
9. Neural networks and the bias/variance dilemma
10. Bias, variance, and prediction error for classification rules
11. Speech recognition using randomized relational decision trees
12. Boosting the margin: A new explanation for the effectiveness of voting methods
13. Sharper bounds for Gaussian and empirical processes
14. Projection pursuit regression
15. Additive logistic regression: A statistical view of boosting
16. A training algorithm for optimal margin classifiers
17. Probability inequalities for empirical processes and a law of the iterated logarithm
18. Approximation theorems for independent and weakly dependent random vectors
19. Minimum distance estimates with rates under φ-mixing
20. Moment inequalities for mixing sequences of random variables