Boosting : : foundations and algorithms / / Robert E. Schapire and Yoav Freund.
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, conv...
Saved in:
Superior document: | Adaptive computation and machine learning series |
---|---|
VerfasserIn: | |
TeilnehmendeR: | |
Place / Publishing House: | Cambridge, Massachusetts : : MIT Press,, c2012. [Piscataqay, New Jersey] : : IEEE Xplore,, [2012] |
Year of Publication: | 2012 |
Language: | English |
Series: | Adaptive computation and machine learning
|
Physical Description: | 1 online resource (544 p.) |
Notes: | Bibliographic Level Mode of Issuance: Monograph |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
993547966004498 |
---|---|
ctrlnum |
(CKB)2560000000082843 (OCoLC)794669892 (CaPaEBR)ebrary10569012 (SSID)ssj0000681124 (PQKBManifestationID)11390235 (PQKBTitleCode)TC0000681124 (PQKBWorkID)10655163 (PQKB)10302005 (CaBNVSL)mat06267536 (IDAMS)0b000064818b458c (IEEE)6267536 (Au-PeEL)EBL3339451 (CaPaEBR)ebr10569012 (CaONFJC)MIL365528 (MiAaPQ)EBC3339451 (oapen)https://directory.doabooks.org/handle/20.500.12854/77893 (PPN)180003445 (EXLCZ)992560000000082843 |
collection |
bib_alma |
record_format |
marc |
spelling |
Schapire, Robert E., author. Boosting : foundations and algorithms / Robert E. Schapire and Yoav Freund. Cambridge The MIT Press 2012 Cambridge, Massachusetts : MIT Press, c2012. [Piscataqay, New Jersey] : IEEE Xplore, [2012] 1 online resource (544 p.) text txt computer c online resource cr Adaptive computation and machine learning series Bibliographic Level Mode of Issuance: Monograph English Also available in print. Includes bibliographical references and indexes. Foundations of machine learning -- Using AdaBoost to minimize training error -- Direct bounds on the generalization error -- The 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. 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. Description based on PDF viewed 12/23/2015. Boosting (Algorithms) Supervised learning (Machine learning) Artificial intelligence Algorithms and data structures 0-262-52603-4 0-262-01718-0 Freund, Yoav. Adaptive computation and machine learning |
language |
English |
format |
eBook |
author |
Schapire, Robert E., |
spellingShingle |
Schapire, Robert E., Boosting : foundations and algorithms / Adaptive computation and machine learning series Foundations of machine learning -- Using AdaBoost to minimize training error -- Direct bounds on the generalization error -- The 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. |
author_facet |
Schapire, Robert E., Freund, Yoav. |
author_variant |
r e s re res |
author_role |
VerfasserIn |
author2 |
Freund, Yoav. |
author2_variant |
y f yf |
author2_role |
TeilnehmendeR |
author_sort |
Schapire, Robert E., |
title |
Boosting : foundations and algorithms / |
title_sub |
foundations and algorithms / |
title_full |
Boosting : foundations and algorithms / Robert E. Schapire and Yoav Freund. |
title_fullStr |
Boosting : foundations and algorithms / Robert E. Schapire and Yoav Freund. |
title_full_unstemmed |
Boosting : foundations and algorithms / Robert E. Schapire and Yoav Freund. |
title_auth |
Boosting : foundations and algorithms / |
title_new |
Boosting : |
title_sort |
boosting : foundations and algorithms / |
series |
Adaptive computation and machine learning series |
series2 |
Adaptive computation and machine learning series |
publisher |
The MIT Press MIT Press, |
publishDate |
2012 |
physical |
1 online resource (544 p.) Also available in print. |
contents |
Foundations of machine learning -- Using AdaBoost to minimize training error -- Direct bounds on the generalization error -- The 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. |
isbn |
0-262-30039-7 1-280-67835-6 9786613655288 0-262-30118-0 0-262-52603-4 0-262-01718-0 |
callnumber-first |
Q - Science |
callnumber-subject |
Q - General Science |
callnumber-label |
Q325 |
callnumber-sort |
Q 3325.75 S33 42012EB |
illustrated |
Illustrated |
dewey-hundreds |
000 - Computer science, information & general works |
dewey-tens |
000 - Computer science, knowledge & systems |
dewey-ones |
006 - Special computer methods |
dewey-full |
006.3/1 |
dewey-sort |
16.3 11 |
dewey-raw |
006.3/1 |
dewey-search |
006.3/1 |
oclc_num |
794669892 |
work_keys_str_mv |
AT schapireroberte boostingfoundationsandalgorithms AT freundyoav boostingfoundationsandalgorithms |
status_str |
n |
ids_txt_mv |
(CKB)2560000000082843 (OCoLC)794669892 (CaPaEBR)ebrary10569012 (SSID)ssj0000681124 (PQKBManifestationID)11390235 (PQKBTitleCode)TC0000681124 (PQKBWorkID)10655163 (PQKB)10302005 (CaBNVSL)mat06267536 (IDAMS)0b000064818b458c (IEEE)6267536 (Au-PeEL)EBL3339451 (CaPaEBR)ebr10569012 (CaONFJC)MIL365528 (MiAaPQ)EBC3339451 (oapen)https://directory.doabooks.org/handle/20.500.12854/77893 (PPN)180003445 (EXLCZ)992560000000082843 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Adaptive computation and machine learning series |
is_hierarchy_title |
Boosting : foundations and algorithms / |
container_title |
Adaptive computation and machine learning series |
author2_original_writing_str_mv |
noLinkedField |
_version_ |
1796651933141827584 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04364nam a2200709 i 4500</leader><controlfield tag="001">993547966004498</controlfield><controlfield tag="005">20240219145908.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">151223s2012 maua ob 001 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2011038972</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0-262-30039-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1-280-67835-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613655288</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0-262-30118-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)2560000000082843</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)794669892</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebrary10569012</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SSID)ssj0000681124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBManifestationID)11390235</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBTitleCode)TC0000681124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBWorkID)10655163</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKB)10302005</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaBNVSL)mat06267536</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(IDAMS)0b000064818b458c</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(IEEE)6267536</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL3339451</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10569012</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL365528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC3339451</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/77893</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PPN)180003445</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)992560000000082843</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">CaBNVSL</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">CaBNVSL</subfield><subfield code="d">CaBNVSL</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">Q325.75</subfield><subfield code="b">.S33 2012eb</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">006.3/1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schapire, Robert E.,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Boosting :</subfield><subfield code="b">foundations and algorithms /</subfield><subfield code="c">Robert E. Schapire and Yoav Freund.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge</subfield><subfield code="b">The MIT Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts :</subfield><subfield code="b">MIT Press,</subfield><subfield code="c">c2012.</subfield></datafield><datafield tag="264" ind1=" " ind2="2"><subfield code="a">[Piscataqay, New Jersey] :</subfield><subfield code="b">IEEE Xplore,</subfield><subfield code="c">[2012]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (544 p.) </subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Adaptive computation and machine learning series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Bibliographic Level Mode of Issuance: Monograph</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Also available in print.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Foundations of machine learning -- Using AdaBoost to minimize training error -- Direct bounds on the generalization error -- The 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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on PDF viewed 12/23/2015.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Boosting (Algorithms)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Supervised learning (Machine learning)</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithms and data structures</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">0-262-52603-4</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">0-262-01718-0</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Freund, Yoav.</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Adaptive computation and machine learning</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-02-20 04:50:10 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2012-07-01 08:15:59 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5338692330004498&Force_direct=true</subfield><subfield code="Z">5338692330004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338692330004498</subfield></datafield></record></collection> |