MARC Record from marc_openlibraries_sanfranciscopubliclibrary

LEADER: 04312cam a22005774a 4500
001 758388404
003 OCoLC
005 20151005115126.0
008 111020s2012 maua b 001 0 eng
010 $a2011038972
016 7 $a015995335$2Uk
020 $a9780262017183
020 $a0262017180
020 $a9780262526036 (pbk.)
020 $a0262526034 (pbk.)
035 $a758388404
035 $a(OCoLC)758388404
037 $bMit Pr, C/O Triliteral Llc 100 Maple Ridge Dr, Cumberland, RI, USA, 02864-1769, (401)6584226$nSAN 631-8126
040 $aDLC$beng$cDLC$dYDX$dBTCTA$dUKMGB$dOCLCO$dBDX$dYDXCP$dIG#$dCDX$dRRP$dMYG$dKMS$dOCLCF$dSFR$dUtOrBLW
042 $apcc
049 $aSFRA
050 00 $aQ325.75$b.S33 2012
082 00 $a006.3/1$223
092 $a006.31$bSch167b
100 1 $aSchapire, Robert E.
245 10 $aBoosting :$bfoundations and algorithms /$cRobert E. Schapire, Yoav Freund.
260 $aCambridge, MA :$bMIT Press,$cc2012.
300 $axv, 526 p. :$bill. ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
490 1 $aAdaptive computation and machine learning
504 $aIncludes bibliographical references and indexes.
505 0 $aIntroduction and Overview -- Foundations of Machine Learning -- Using AdaBoost to Minimize Training Error -- Direct Bounds on the Generalization Error -- Margins Explanation for Boosting's Effectiveness -- Game Theory, Online Learning, and Boosting -- Loss Minimization and Generalizations of Boosting -- Boosting, Convex Optimization, and Information Geometry -- Using Confidence-Rated Weak Predictions -- Multiclass Classification Problems -- Learning to Rank -- Attaining the Best Possible Accuracy -- Optimally Efficient Boosting -- Boosting in Continuous Time -- Bibliographic Notes -- Exercises -- Some Notation, Definitions, and Mathematical Background.
520 $aBoosting 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 mysterious, controversial, even paradoxical. This book, written by the inventors of the method, brings together, organizes, simplifies, adn substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers form 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.
650 0 $aBoosting (Algorithms)
650 0 $aSupervised learning (Machine learning)
700 1 $aFreund, Yoav.
830 0 $aAdaptive computation and machine learning.
907 $a.b27146704$b12-20-18$c02-04-14
998 $axbt$b03-25-14$cm$da $e-$feng$gmau$h0$i0
957 00 $aOCLC reclamation of 2017-18
907 $a.b27146704$b09-01-15$c02-04-14
938 $aBaker and Taylor$bBTCP$nBK0010256799
956 $aPre-reclamation 001 value: ocn758388404
980 $a0314 sh
998 $axbt$b03-25-14$cm$da$e-$feng$gmau$h0$i0
994 $aC0$bSFR
999 $yMARS
945 $a006.31$bSch167b$d - - $e04-01-2017 16:21$f0$g0$h06-07-17$i31223104014478$j271$0800$k - - $lxbtci$o-$p$30.00$q-$r-$s- $t1$u9$v18$w0$x0$y.i77413982$z04-21-14
945 $a006.31$bSch167b$d - - $e06-02-2018 14:15$f0$g0$h06-07-18$i31223105884119$j351$0503$k - - $lxbtci$o-$p$52.00$q-$r-$s- $t0$u9$v10$w0$x1$y.i77839134$z05-29-14