Hierarchical sampling for active learning

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 208-215

  Dasgupta, Sanjoy ^a   Hsu, Daniel ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS; ROBOT LEARNING;

ACTIVE LEARNING; ACTIVE LEARNING SCHEME; CLUSTER STRUCTURE; HIERARCHICAL SAMPLING; ACTIVE LEARNING SCHEMES; CLUSTER STRUCTURES; HIERARCHICAL SAMPLINGS;

MACHINE LEARNING; EDUCATION;

EID: 56449108037     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390183     Document Type: Conference Paper

References (11)

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