skip to main content
10.1145/1363686.1364109acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Empirical evaluation of a new structure for AdaBoost

Published:16 March 2008Publication History

ABSTRACT

We propose a mixed structure to form cascades for AdaBoost classifiers, where parallel strong classifiers are trained for each layer. The structure allows for rapid training and guarantees high hit rates without changing the original threshold. We implemented and tested the approach for two datasets from UCI [1], and compared results of binary classifiers using three different structures: standard AdaBoost, a cascade classifier with threshold adjustments, and the proposed structure.

References

  1. A. Asuncion and D. Newman. UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences, 2007. http://www.ics.uci.edu/~mlearn/MLRepository.html.Google ScholarGoogle Scholar
  2. Y. Freund and R. E. Schapire. A short introduction to boosting. Journal of Jap. Society for Art Intell., 14(5):771--780, 1999.Google ScholarGoogle Scholar
  3. R. Lienhart, L. Liang, and A. Kuranov. A detector tree of boosted classifiers for real-time object detection and tracking. In ICME2003, pages 277--280. IEEE, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Viola and M. Jones. Robust real-time face detection. International Journal of Computer Vision, 57:137--154, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Empirical evaluation of a new structure for AdaBoost

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
          March 2008
          2586 pages
          ISBN:9781595937537
          DOI:10.1145/1363686

          Copyright © 2008 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 16 March 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • poster

          Acceptance Rates

          Overall Acceptance Rate1,650of6,669submissions,25%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader