Active learning with direct query construction

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 480-487

  Ling, Charles X ^a   Du, Jun ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Active learning; Classification; Supervised learning

Indexed keywords

ACTIVE LEARNERS; ACTIVE LEARNING; ACTIVE-LEARNING ALGORITHMS; CLASSIFICATION; DATA SCARCITIES; DECISION-TREE ALGORITHMS; LABELED DATUM; PREDICTIVE ERRORS; QUERY CONSTRUCTIONS;

DATA MINING; DECISION TREES; EDUCATION; INFORMATION MANAGEMENT; LABELS; LAKES; MINING; SUPERVISED LEARNING;

LEARNING ALGORITHMS;

ALGORITHMS; CLASSIFICATION; DATA PROCESSING; DECISION MAKING; INFORMATION RETRIEVAL; LABELING; PROBLEM SOLVING;

EID: 65449185038     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401950     Document Type: Conference Paper

References (20)

1. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, April 1988.
2. Y. Baram, R. El-Yaniv, and K. Luz. Online choice of active learning algorithms. Journal of Machine Learning Research, 5:255-291, 2004.
3. C. Blake, E. Keogh, and C. J. Merz. Uci repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
4. L. Breiman. Random forests. Machine Learning, V45(1):5-32, October 2001.
5. D. A. Cohn, L. Atlas, and R. E. Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
6. Y. Freund, S. H. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997.
7. R. Greiner, A. J. Grove, and D. Roth. Learning cost-sensitive active classifiers. Artif. Intell., 139(2): 137-174, August 2002.
8. A. Kapoor and R. Greiner. Learning and classifying under hard budgets, pages 170-181. 2005.
9. M. Lindenbaum, S. Markovitch, and D. Rusakov. Selective sampling for nearest neighbor classifiers. Machine Learning, 54(2): 125-152, February 2004.
10. D. D. Margineantu. Active cost-sensitive learning. In the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, 2005.
11. A. Mccallum and K. Nigam. Employing em and pool-based active learning for text classification. In ICML '98: Proceedings of the Fifteenth International Conference on Machine Learning, pages 350-358, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.
12. T. M. Mitchell. Machine Learning. McGraw-Hill Science/Engineering/ Math, March 1997.
13. F. Provost and P. Domingos. Tree induction for probability-based ranking. Machine Learning, 52(3): 199-215, September 2003.
14. R. R. Quinlan. C4-5: programs for machine learning. Morgan Kaufmann Publishers Inc., 1993.
15. N. Roy and A. Mccallum. Toward optimal active learning through sampling estimation of error reduction. In Proc. 18th International Conf. on Machine Learning, pages 441-448. Morgan Kaufmann, San Francisco, CA, 2001.
16. M. Saar-Tsechansky and F. Provost. Active sampling for class probability estimation and ranking. Machine Learning, 54(2):153-178, February 2004.
17. H. S. Seung, M. Opper, and H. Sompolinsky. Query by committee. In COLT '92: Proceedings of the fifth annual workshop on Computational learning theory, pages 287-294, New York, NY, USA, 1992. ACM Press.
18. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45-66, 2002.
19. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, second edition, June 2005.
20. T. Zhang and F. J. Oies. A probability analysis on the value of unlabeled data for classification problems. In Proc. 17th International Conf. on Machine Learning, pages 1191-1198, 2000.