Introduction Basic Concepts Popular Learning Algorithms Evaluation and Comparison Ensemble Methods Applications of Ensemble Methods Boosting A General Boosting Procedure The AdaBoost Algorithm Illustrative Examples Theoretical Issues Multiclass Extension Noise Tolerance Bagging Two Ensemble Paradigms The Bagging Algorithm Illustrative Examples Theoretical Issues Random Tree Ensembles Combination Methods Benefits of Combination Averaging Voting Combining by Learning Other Combination Methods Relevant Methods Diversity Ensemble Diversity Error Decomposition Diversity Measures Information Theoretic Diversity Diversity Generation Ensemble Pruning What Is Ensemble Pruning Many Could Be Better Than All Categorization of Pruning Methods Ordering-Based Pruning Clustering-Based Pruning Optimization-Based Pruning Clustering Ensembles Clustering Categorization of Clustering Ensemble Methods Similarity-Based Methods Graph-Based Methods Relabeling-Based Methods Transformation-Based Methods Advanced Topics Semi-Supervised Learning Active Learning Cost-Sensitive Learning Class-Imbalance Learning Improving Comprehensibility Future Directions of Ensembles References Index Further Readings appear at the end of each chapter.
Author(s): Zhi-Hua Zhou.
Series: Chapman & Hall/CRC Machine learning & pattern recognition series
Publisher: Chapman & Hall / CRC Press
Year: 2012
Language: English
Pages: 222
City: Boca Raton, Fla.
Tags: Информатика и вычислительная техника;Искусственный интеллект;Интеллектуальный анализ данных;
Front Cover......Page 1
Contents......Page 12
Preface......Page 8
Notations......Page 10
1. Introduction......Page 16
2. Boosting......Page 38
3. Bagging......Page 62
4. Combination Methods......Page 82
5. Diversity......Page 114
6. Ensemble Pruning......Page 134
7. Clustering Ensembles......Page 150
8. Advanced Topics......Page 172
References......Page 202