Active sampling for multiple output identification

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

Volumn 4005 LNAI, Issue , 2006, Pages 620-634

  Fine, Shai ^a   Mansour, Yishay ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; SAMPLING;

GEOMETRIC CONCEPTS; OUTPUT IDENTIFICATION; TRANSDUCTIVE SETTING;

IDENTIFICATION (CONTROL SYSTEMS);

EID: 33746044519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_45     Document Type: Conference Paper

References (21)

1. S. Dasgupta. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems (NIPS), 2004.
2. S. Dasgupta. Coarse sample complexity bounds for active learning. In Advances in Neural Information Processing Systems (NIPS), 2005.
3. S. Dasgupta, A. Kalai, and C. Monteleoni. Analysis of perception-based active learning. In Eighteenth Annual Conference on Learning Theory (COLT), 2005.
4. O. Edelstein, E. Farchi, Y. Nir G Ratzaby, and S Ur. Multithreaded Java program test generation. IBM Systems Journal, 41(3):111-125, 2002.
5. B. Efron. The convex hull of a rndom set of points. Biometrika, 52:331-343, 1965.
6. S. Fine, R. Gilad-Bachrach, and E. Shamir. Query by committee, linear separation and random walks. Theoretical Computer Science, 284(1), 2002.
7. A preliminary version appeared in EuroColt 1999.
8. S. Fine and A. Ziv. Coverage directed test generation for functional verification using Bayesian networks. In Proceedings of the 40th Design Automation Conference, pages 286-291, June 2003.
9. Y. Freund, H. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2/3):133-168, 1997.
10. S. R. Kulkarni, S. K. Mitter, and J. N. Tsitsiklis. Active learning using arbitrary binary valued queries. Machine Learning, 11:23-35, 1993.
11. R. Liere and P. Tadepalli. Active learning with committees for text categorization. In AAAI-97, 1997.
12. N. Linial, M. Luby, M. Saks, and D. Zuckerman. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica, 17(2):215-234, 1997.
13. A preliminary version appeard in STOC 1993.
14. Andrew Piziali. Functional Verification Coverage Measurement and Analysis. Springer, 2004.
15. F. P. Preparata and M. I Shamos. Computational Geometry: An introduction. Springer-Verlag, 1985.
16. A. Rényi and R. Sulamke. Über die konvexe hulle von n zufallig gewahlten punkten. Z. Wahrschein, 2:75-84, 1963.
17. N. Sauer. On the density of family of sets. J. of Combinatorial Theory, Ser. A 13:145-147, 1972.
18. H. S. Seung, M. Opper, and H. Sompolinsky. Query by committe. In Proceedings of the Fith Workshop on Computational Learning Theory, pages 287-294. Morgan Kaufman, San Mateo, CA, 1992.
19. S. Ur and Y. Yadin. Micro-architecture coverage directed generation of test programs. In Proceedings of the 36th Design Automation Conference, pages 175-180, June 1999.
20. V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its applications, XVI(2):264-280, 1971.
21. B. Wile, J. C. Goss, and W. Roesner. Comprehensive Functional Verification The Complete Industry Cycle. Elsevier, 2005.