Boosting: Foundations and Algorithms (Adaptive Computation and Machine Learning series)

Robert E. Schapire

ISBN 10: 0262526034 / ISBN 13: 9780262526036

Published by The MIT Press, 2014

About this Item

Series: Adaptive Computation and Machine Learning Series. Num Pages: 544 pages, 77 b&w illus. BIC Classification: UMB; UYA; UYQM. Category: (P) Professional & Vocational. Dimension: 181 x 230 x 24. Weight in Grams: 854. . 2014. Paperback. . . . . Books ship from the US and Ireland.

Seller Inventory # V9780262526036

Bibliographic Details

• Title: Boosting: Foundations and Algorithms (Adaptive Computation and Machine Learning series)
• Publisher: The MIT Press
• Publication Date: 2014
• Language: English
• ISBN 10: 0262526034
• ISBN 13: 9780262526036
• Binding: Soft cover
• Condition: New

About this title

Synopsis

An accessible introduction and essential reference for an approach to machine learning that creates highly accurate prediction rules by combining many weak and inaccurate ones.

Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate “rules of thumb.” A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.

This book, written by the inventors of the method, brings together, organizes, simplifies, and substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers from diverse backgrounds while also providing an authoritative reference for advanced researchers. With its introductory treatment of all material and its inclusion of exercises in every chapter, the book is appropriate for course use as well.

The book begins with a general introduction to machine learning algorithms and their analysis; then explores the core theory of boosting, especially its ability to generalize; examines some of the myriad other theoretical viewpoints that help to explain and understand boosting; provides practical extensions of boosting for more complex learning problems; and finally presents a number of advanced theoretical topics. Numerous applications and practical illustrations are offered throughout.

About the Author

Robert E. Schapire is Principal Researcher at Microsoft Research in New York City. For their work on boosting, Freund and Schapire received both the Gödel Prize in 2003 and the Kanellakis Theory and Practice Award in 2004.

Yoav Freund is Professor of Computer Science at the University of California, San Diego. For their work on boosting, Freund and Schapire received both the Gödel Prize in 2003 and the Kanellakis Theory and Practice Award in 2004.