Query by Committee made real

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 443-450

  Gilad Bachrach, Ran ^a,b   Navot, Amir ^a   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; LARGE-SCALE PROBLEM; LOW-DIMENSIONAL SPACES; NOVEL ALGORITHM; QUERY BY COMMITTEES; RANDOM WALK; REAL-WORLD PROBLEM; SELECTIVE SAMPLING;

LEARNING ALGORITHMS;

EID: 33746057106     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. Cohn, L. Atlas, and R. Ladner. Training connectionist networks with queries and selective sampling. Advanced in Neural Information Processing Systems 2, 1990.
2. H. S. Seung, M. Opper, and H. Sompolinsky. Query by committee. Proc. of the Fifth Workshop on Computational Learning Theory, pages 287-294, 1992.
3. C. Campbell, N. Cristianini, and A. Smola. Query learning with large margin classifiers. In Proc. 17'th International Conference on Machine Learning (ICML), 2000.
4. S. Tong. Active Learning: Theory and Applications. PhD thesis, Stanford University, 2001.
5. G. Tur, R. Schapire, and D. Hakkani-Tür. Active learning for spoken language understanding. In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing, 2003.
6. Y. Freund, H. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28:133-168, 1997.
7. H. Mamitsuka and N. Abe. Efficient data mining by active learning. In Progress in Discovery Science, pages 258-267, 2002.
8. R. Bachrach, S. Fine, and E. Shamir. Query by committee, linear separation and random walks. Theoretical Computer Science, 284(1), 2002.
9. L. Lovász and S. Vempala. Hit and run is fast and fun. Technical Report MSR-TR- 2003-05,Microsoft Research, 2003.
10. B. Boser, I. Guyon, and V. Vapnik. Optimal margin classifiers. In Fifth Annual Workshop on Computational Learning Theory, pages 144-152, 1992.
11. S. Dasgupta. Analysis of a greedy active learning strategy. In Neural Information Processing Systems (NIPS), 2004.
12. S. Dasgupta, A. T. Kalai, and C. Monteleoni. Analysis of perceptron-based active learning. In Proceeding of the 18th annual Conference on Learning Theory (COLT), 2005.
13. R. Herbrich, T. Graepel, and C. Campbell. Bayes pointmachines. Journal ofMachine Learning Research, 1:245-279, 2001.
14. R. Gilad-Bachrach, A. Navot, and N. Tishby. Query by committee made real - supplementary material. http://www.cs.huji.ac.il/~ranb/kqcb supp.ps.
15. L. Lovász and S. Vempala. Hit-and-run from a corner. In Proc. of the 36th ACM Symposium on the Theory of Computing (STOC), 2004.
16. A.M. Martinez and R. Benavente. The ar face database. Technical report, CVC Tech. Rep. #24, 1998.