![Kindle app logo image](https://cdn.statically.io/img/m.media-amazon.com/images/G/01/kindle/app/kindle-app-logo._CB668847749_.png)
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the author
OK
Boosting: Foundations and Algorithms (Adaptive Computation and Machine Learning)
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.
- ISBN-100262017180
- ISBN-13978-0262017183
- PublisherMit Pr
- Publication dateJanuary 1, 2012
- LanguageEnglish
- Dimensions7.25 x 1.25 x 9.25 inches
- Print length526 pages
Customers who viewed this item also viewed
- Regression Modeling Strategies: With Applications to Linear Models, Logistic and Ordinal Regression, and Survival Analysis (Springer Series in Statistics)HardcoverFREE Shipping by AmazonGet it as soon as Saturday, Jul 27Only 2 left in stock - order soon.
- Regression and Other Stories (Analytical Methods for Social Research)PaperbackFREE Shipping by AmazonGet it as soon as Saturday, Jul 27
- All of Statistics: A Concise Course in Statistical Inference (Springer Texts in Statistics)HardcoverFREE Shipping by AmazonGet it as soon as Saturday, Jul 27
- The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition (Springer Series in Statistics)HardcoverFREE Shipping by AmazonGet it as soon as Saturday, Jul 27
- Modern Investment Management: An Equilibrium ApproachBob LittermanHardcoverFREE Shipping by AmazonGet it as soon as Saturday, Jul 27Only 3 left in stock (more on the way).
Editorial Reviews
About the Author
Robert E. Schapire is Professor of Computer Science at Princeton University. 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.
Product details
- Publisher : Mit Pr (January 1, 2012)
- Language : English
- Hardcover : 526 pages
- ISBN-10 : 0262017180
- ISBN-13 : 978-0262017183
- Item Weight : 2.19 pounds
- Dimensions : 7.25 x 1.25 x 9.25 inches
- Best Sellers Rank: #3,814,725 in Books (See Top 100 in Books)
- #350 in Computer Algorithms
- #799 in Machine Theory (Books)
- #1,432 in Programming Algorithms
- Customer Reviews:
About the author
![Robert E. Schapire](https://cdn.statically.io/img/m.media-amazon.com/images/I/01Kv-W2ysOL._SY600_.png)
Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
This book proposes "Boosting" as the answer. Start with remarkably few technical requirements on the diagnostic indicators, plus some number of cases in which the condition's presence or absence is already known. Given that, Boosting iteratively determines the weight to assign each indicator. One requirement is that each indicator suggests presence or absence of the condition at least somewhat differently than random guessing - and being wrong most of the time is just as useful as being right more often than not, since the algorithm automatically assigns negative weights to such indicators.
After that, the authors present rigorous development in a number of directions. I emphasize "rigor" - this text offers detailed development, analysis, and formal proof of the algorithm and its properties, far beyond the needs of someone who just wants to implement the technique. Implementable detail is there, but you'll spend a fair bit of time teasing it out of the dense notation used here.
Then, once basics have been established, the discussion branches out. The authors offer game-theoretic analysis of the algorithm, along with comparisons to related optimization techniques. After tightening some of the technical requirements, they apply it to decision trees with binary outcomes, to N-ary classification problems for N>2, and to more complex kinds of tasks, always with the same mathematical rigor.
Frankly, it's a bit much for someone just looking to get the broad picture or someone looking to code something up fast and try it out. But, it's not meant for those readers. To get the most out of it, you should come prepared to take your time, work out the meaning of each equation, follow the development carefully, and maybe even do some of the exercises. If you've already plowed through some "yellow books," you'll know what I mean, even though this doesn't come from the Springer yellow series. For the prepared and patient reader, this has my highest recommendation
-- wiredweird
But be prepared that it's not a quick and casual introduction, it's a collection of the in-depth mathematical papers. It's a book that takes a very long time and much effort to read thoroughly and understand. You can skim over the proofs but it still takes a long time, after all it's pretty much everything known about boosting. I actually highly recommend not spending too much time on the proofs when you read it for the first time. This will give you a good overall picture, and then if you want to go deeper, read the book for the second time, the mathematics will make more sense on the second reading. You can also skip chapters depending on your interests, if you're not out to learn everything about boosting.
Probably the only really annoying thing from the engineering standpoint is that the algorithms in the book are what the mathematicians and the fans of functional programming call "algorithms", not the algorithms in the normal engineering sense. It takes some deciphering to turn them into a straightforward readable and understandable form. Bug again, it's a book about math, not engineering. I've had some of the deciphering I've done posted to a blog but I probably can't post a link to it here.
However, I found it hard to follow if I do not have previous knowledge about machine learning technology.
It is more focus on practical uses and ideas behind scenes, but not a good textbook for teaching courses for collage students.
I have had a copy out of the library, and finally ordered my own copy.
Chapter 1 is the best writing I've ever seen as an introduction to a technical book. It's a beautiful work of art.
Excuse me while I go read chapter 2 and on into Margin Theory...
Top reviews from other countries
![](https://images-na.ssl-images-amazon.com/images/S/amazon-avatars-global/default._CR0,0,1024,1024_SX48_.png)
![](https://images-eu.ssl-images-amazon.com/images/S/amazon-avatars-global/default._CR0,0,1024,1024_SX48_.png)
![](https://images-na.ssl-images-amazon.com/images/S/amazon-avatars-global/211e49a8-cb9f-4aa5-ae52-7e3aa5dae339._CR0,0,500,500_SX48_.jpg)
![](https://images-na.ssl-images-amazon.com/images/S/amazon-avatars-global/default._CR0,0,1024,1024_SX48_.png)
The text is really nothing more than an elementary introduction to this subject area that is better dealt with by other authors in a detailed way that will satisfy the academic communities need for indepth rigor that will satisfy their colleagues peer review standards.
As for the practitioner, there is nothing new and a lack of practical implementation strategies that will assist with the day to day usage for this book. Modern day texts provide the pseudo code based on R or the equivalent to assist the practitioner. This book is useless as a reference title for the practitioner.
Overall. better treatment of the subject area can be found elsewhere and for those thinking the book is a bargain, it will soon end up in the local library used book bin to be used as a coaster or monitor boost for the advanced programmer.