Ensemble methods in data mining [electronic resource] : improving accuracy through combining predictions
- Giovanni Seni, John F. Elder.
- San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, c2010.
- Physical description
- 1 electronic text (xvi, 108 p.) : ill.
- Synthesis lectures on data mining and knowledge discovery (Online) ; #2. 2151-0075
- Includes bibliographical references (p. 101-105).
- Ensembles Discovered Predictive Learning and Decision Trees Model Complexity, Model Selection and Regularization Importance Sampling and the Classic Ensemble Methods Rule Ensembles and Interpretation Statistics Ensemble Complexity.
- (source: Nielsen Book Data)
- Publisher's summary
Ensemble methods have been called the most influential development in Data Mining and Machine Learning in the past decade. They combine multiple models into one usually more accurate than the best of its components. Ensembles can provide a critical boost to industrial challenges - from investment timing to drug discovery, and fraud detection to recommendation systems - where predictive accuracy is more vital than model interpretability. Ensembles are useful with all modeling algorithms, but this book focuses on decision trees to explain them most clearly. After describing trees and their strengths and weaknesses, the authors provide an overview of regularization - today understood to be a key reason for the superior performance of modern ensembling algorithms. The book continues with a clear description of two recent developments: Importance Sampling (IS) and Rule Ensembles (RE). IS reveals classic ensemble methods - bagging, random forests, and boosting - to be special cases of a single algorithm, thereby showing how to improve their accuracy and speed. REs are linear rule models derived from decision tree ensembles. They are the most interpretable version of ensembles, which is essential to applications such as credit scoring and fault diagnosis. Lastly, the authors explain the paradox of how ensembles achieve greater accuracy on new data despite their (apparently much greater) complexity. This book is aimed at novice and advanced analytic researchers and practitioners -- especially in Engineering, Statistics, and Computer Science. Those with little exposure to ensembles will learn why and how to employ this breakthrough method, and advanced practitioners will gain insight into building even more powerful models. Throughout, snippets of code in R are provided to illustrate the algorithms described and to encourage the reader to try the techniques. The authors are industry experts in data mining and machine learning who are also adjunct professors and popular speakers. Although early pioneers in discovering and using ensembles, they here distill and clarify the recent groundbreaking work of leading academics (such as Jerome Friedman) to bring the benefits of ensembles to practitioners.
(source: Nielsen Book Data)
- Publication date
- Synthesis lectures on data mining and knowledge discovery, 2151-0075 ; #2
- Part of: Synthesis digital library of engineering and computer science.
- Title from PDF t.p. (viewed on March 6, 2010).
- Series from website.
- Abstract freely available; full-text restricted to subscribers or individual document purchasers.
- Referenced in
- Google scholar
- Google book search
- Also available in print.
- Mode of access: World Wide Web.
- System requirements: Adobe Acrobat reader.
- Related Work
- Synthesis digital library of engineering and computer science.
- 9781608452859 (electronic bk.)
- 9781608452842 (pbk.)
- 1608452840 (pbk.)
Browse related items
Start at call number: