Ensemble Methods: Foundations and Algorithms Front Cover

Ensemble Methods: Foundations and Algorithms

  • Length: 236 pages
  • Edition: 1
  • Publisher:
  • Publication Date: 2012-06-06
  • ISBN-10: 1439830037
  • ISBN-13: 9781439830031
  • Sales Rank: #561781 (See Top 100 Books)
Description

Ensemble Methods: Foundations and Algorithms (Chapman & Hall/Crc Machine Learnig & Pattern Recognition)

An up-to-date, self-contained introduction to a state-of-the-art machine learning approach, Ensemble Methods: Foundations and Algorithms shows how these accurate methods are used in real-world tasks. It gives you the necessary groundwork to carry out further research in this evolving field.

After presenting background and terminology, the book covers the main algorithms and theories, including Boosting, Bagging, Random Forest, averaging and voting schemes, the Stacking method, mixture of experts, and diversity measures. It also discusses multiclass extension, noise tolerance, error-ambiguity and bias-variance decompositions, and recent progress in information theoretic diversity.

Moving on to more advanced topics, the author explains how to achieve better performance through ensemble pruning and how to generate better clustering results by combining multiple clusterings. In addition, he describes developments of ensemble methods in semi-supervised learning, active learning, cost-sensitive learning, class-imbalance learning, and comprehensibility enhancement.

Table of Contents

1. Introduction 1
2. Boosting 23
3. Bagging 47
4. Combination Methods 67
5. Diversity 99
6. Ensemble Pruning 119
7. Clustering Ensembles 135
8. Advanced Topics 157

To access the link, solve the captcha.