文档介绍：Boosting
Foundations and Algorithms
“”— 10/1/2012 — 17:41 — page i
putation and Machine Learning
Thomas Dietterich, Editor
Christopher Bishop, David Heckerman, Michael Jordan, and Michael Kearns, Associate Editors
plete list of the books published in this series may be found at the back of the book.
“”— 10/1/2012 — 17:41 — page ii
Boosting
Foundations and Algorithms
Robert E. Schapire
Yoav Freund
The MIT Press
Cambridge, Massachusetts
London, England
“”— 10/1/2012 — 17:41 — page iii
© 2012 Massachusetts Institute of Technology
All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means
(including photocopying, recording, or information storage and retrieval) without permission in writing from the
publisher.
For information about special quality discounts, please email special_******@
This book was set in Times Roman by Westchester position.
Printed and bound in the United States of America.
Library of Congress Cataloging-in-Publication Data
Schapire, Robert E.
Boosting : foundations and algorithms / Robert E. Schapire and Yoav Freund.
p. cm.—(putation and machine learning series)
Includes bibliographical references and index.
ISBN 978-0-262-01718-3 (hardcover : alk. paper)
1. Boosting (Algorithms) 2. Supervised learning (Machine learning) I. Freund, Yoav. II. Title.
2012
'1—dc23
2011038972
1098765432
“”— 10/1/2012 — 17:41 — page iv
To our families
“”— 10/1/2012 — 17:41 — page v
On the cover: A randomized depiction of the potential function t (s) used in the boost-
by-majority algorithm, as given in equation (). Each pixel, identified with an integer
pair (t, s), was randomly colored blue with probability t (s), and was otherwise colored
yellow (with colors inverted where lettering appears). The round t runs horizontally from