skip to main content
10.1145/1390156.1390183acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
research-article

Hierarchical sampling for active learning

Published:05 July 2008Publication History

ABSTRACT

We present an active learning scheme that exploits cluster structure in data.

References

  1. Balcan, M.-F., Beygelzimer, A., & Langford, J. (2006). Agnostic active learning. ICML. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Balcan, M.-F., Broder, A., & Zhang, T. (2007). Margin based active learning. COLT. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Blei, D., Ng, A., & Jordan, M. (2003). Latent dirichlet allocation. JMLR, 3, 993--1022. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Castro, R., & Nowak, R. (2007). Minimax bounds for active learning. COLT. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cohn, D., Atlas, L., & Ladner, R. (1994). Improving generalization with active learning. Machine Learning, 15, 201--221. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dasgupta, S. (2005). Coarse sample complexity bounds for active learning. NIPS.Google ScholarGoogle Scholar
  7. Dasgupta, S., Hsu, D., & Monteleoni, C. (2007). A general agnostic active learning algorithm. Neural Information Processing Systems.Google ScholarGoogle Scholar
  8. Freund, Y., Seung, H., Shamir, E., & Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28, 133--168. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Hanneke, S. (2007). A bound on the label complexity of agnostic active learning. ICML. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Schohn, G., & Cohn, D. (2000). Less is more: active learning with support vector machines. ICML. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Schutze, H., Velipasaoglu, E., & Pedersen, J. (2006). Performance thresholding in practical text classification. ACM International Conference on Information and Knowledge Management. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Hierarchical sampling for active learning

      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 Other conferences
        ICML '08: Proceedings of the 25th international conference on Machine learning
        July 2008
        1310 pages
        ISBN:9781605582054
        DOI:10.1145/1390156

        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: 5 July 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate140of548submissions,26%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader