Active learning in the non-realizable case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4264 LNAI, Issue , 2006, Pages 63-77

  Kääriäinen, Matti ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; QUERY LANGUAGES; STATISTICAL METHODS;

ACTIVE LEARNING; EXPONENTIAL LABEL COMPLEXITY; STATISTICAL LEARNING THEORY;

LEARNING SYSTEMS;

EID: 33750727664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894841_9     Document Type: Conference Paper

References (14)

1. Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997.
2. Sanjoy Dasgupta, Adam Tauman Kalai, and Claire Monteleoni. Analysis of perceptron-based active learning. In COLT'05, pages 249-263. Springer-Verlag, 2005.
3. Sanjoy Dasgupta. Coarse sample complexity bounds for active learning. In NIPS'05, 2005.
4. Nina Balcan, Alina Beygelzimer, and John Langford. Agnostic active learning. In ICML, 2006. Accepted.
5. Simon Tong and Daphne Koller. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45-66, 2002.
6. Dana Angluin and Philip Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1987.
7. Yasubumi Sakakibara. On learning from queries and counterexamples in the presence of noise. Information Processing Letters, 37(5):279-284, 1991.
8. Vladimir N. Vapnik. Estimation of Dependencies Based on Empirical Data. Springer-Verlag, 1982.
9. Claudio Gentile and David P. Helmbold. Improved lower bounds for learning from noisy examples: an information-theoretic approach. In COLT'98, pages 104-115. ACM Press, 1998.
10. Carlos Domingo, Ricard Gavaldà, and Osamu Watanabe. Adaptive sampling methods for scaling up knowledge discovery algorithms. In DS'99, pages 172-183. Springer-Verlag, 1999.
11. Rui Castro, March 2006. Personal communication.
12. Samuel D. Silvey. Optimal Design. Chapman and Hall, London, 1980.
13. Gustaf Elfving. Selection of nonrepeatable observations for estimation. In Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 69-75, 1956.
14. Ran Canetti, Guy Even, and Oded Goldreich. Lower bounds for sampling algorithms for estimating the average. Information Processing Letters, 53(1):17-25, 1995.