Active learning using on-line algorithms

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

Volumn , Issue , 2011, Pages 850-858

  Mesterharm, Chris ^a   Pazzani, Michael J ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Algorithms; Design; Performance; Theory

Indexed keywords

APPLICATION PROGRAMS; ARTIFICIAL INTELLIGENCE; E-LEARNING;

ACTIVE LEARNING; LEARNING PROBLEM; LOW BOUND; ON-LINE ALGORITHMS; ON-LINE MODELLING; ONLINE LEARNING; ORDERS OF MAGNITUDE; PERFORMANCE; PERFORMANCE BOUNDS; THEORY;

LEARNING ALGORITHMS;

EID: 80052679754     PISSN: 2154817X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020553     Document Type: Conference Paper

References (29)

1. D. Angluin. Queries revisited. Theor. Comput. Sci., 313:175-194, February 2004.
2. J. Attenberg and F. Provost. Why label when you can search? In KDD, 2010.
3. M. F. Balcan, A. Beygelzimer, and J. Langford. Agnostic active learning. In ICML, 2006.
4. M. F. Balcan, S. Hanneke, and J. W. Vaughan. The true sample complexity of active learning. Machine Learning, 80(2-3):111-139, 2010.
5. A. Beygelzimer, S. Dasgupta, and J. Langford. Importance weighted active learning. In ICML, 2009.
6. A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang. Agnostic active learning without constraints. In NIPS, 2010.
7. H. D. Block. The perceptron: A model for brain functioning. Reviews of Modern Physics, 34(1):123-135, 1962.
8. N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, 50(9):2050-2057, 2004.
9. N. Cesa-Bianchi, C. Gentile, and L. Zaniboni. Worst-case analysis of selective sampling for linear classification. Journal of Machine Learning Research, 7:1205-1230, 2006. (Pubitemid 44015299)
10. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20(3):273-297, 1995.
11. S. Dasgupta. Coarse sample complexity bounds for active learning. In Y. Weiss, B. Scḧolkopf, and J. Platt, editors, NIPS, pages 235-242, Cambridge, MA, 2006. MIT Press.
12. S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. In NIPS, 2007.
13. C. B. D.J. Newman, S. Hettich and C. Merz. UCI repository of machine learning databases, 1998; http://archive.ics.uci.edu/ml/.
14. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second-price auction American Economic Review, 97(1):242-259, 2007.
15. Y. Freund and R. E. Schapire. Large margin classification using the perceptron algorithm. In COLT, 1998.
16. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28:133-1680, 1997.
17. C. Gentile. A new approximate maximal margin classification algorithm. Machine Learning, 2:213-242, 2001.
18. S. Hanneke. Rates of convergence in active learning. The Annals of Statistics, 39(1):333-361, 2011.
19. M.-C. Jenkins and D. Smith. Conservative stemming for search and indexing. In SIGIR, 2005.
20. T. Joachims. Making large-scale support vector machine learning practical. In A. S. B. Schölkopf, C. Burges, editor, Advances in Kernel Methods: Support Vector Machines. MIT Press, Cambridge, MA, 1999.
21. D. D. Lewis and W. A. Gale. A sequential algorithm for training text classifiers. In SIGIR, pages 3-12. Springer-Verlag, 1994.
22. R. Liere and P. Tadepalli. Active learning with committees for text categorization. In AAAI, pages 591-596, 1997.
23. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
24. N. Littlestone. From on-line to batch learning. In COLT, pages 269-284, 1989.
25. N. Littlestone. Mistake Bounds and Linear-threshold Learning Algorithms. PhD thesis, Computer Science, University of California, Santa Cruz, 1989. Technical Report UCSC-CRL-89-11.
26. W. Maass and M. K. Warmuth. Efficient learning with virtual threshold gates. Information and Computation, 141:378-386, 1997.
27. C. Mesterharm. Improving On-line Learning. PhD thesis, Computer Science, Rutgers, The State University of New Jersey, 2007.
28. B. Settles. Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison, 2009.
29. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.