Committee-Based Sampling For Training Probabilistic Classi(cid:12)ers
暂无分享,去创建一个
[1] David A. Cohn,et al. Active Learning with Statistical Models , 1996, NIPS.
[2] David D. Lewis,et al. Heterogeneous Uncertainty Sampling for Supervised Learning , 1994, ICML.
[3] Yoav Preund,et al. Sifting informative examples from a random source. , 1994 .
[4] Mark Plutowski,et al. Selecting concise training sets from clean data , 1993, IEEE Trans. Neural Networks.
[5] John D. Lafferty,et al. Towards History-based Grammars: Using Richer Models for Probabilistic Parsing , 1993, ACL.
[6] David Yarowsky,et al. A method for disambiguating word senses in a large corpus , 1992, Comput. Humanit..
[7] H. Sebastian Seung,et al. Information, Prediction, and Query by Committee , 1992, NIPS.
[8] Andreas Stolcke,et al. Hidden Markov Model} Induction by Bayesian Model Merging , 1992, NIPS.
[9] David J. C. MacKay,et al. The Evidence Framework Applied to Classification Networks , 1992, Neural Computation.
[10] Yoav Freund,et al. An improved boosting algorithm and its implications on learning complexity , 1992, COLT '92.
[11] H. Sebastian Seung,et al. Query by committee , 1992, COLT '92.
[12] David J. C. MacKay,et al. Information-Based Objective Functions for Active Data Selection , 1992, Neural Computation.
[13] E. Brill. A Simple Rule-Based Part of Speech Tagger , 1992, HLT.
[14] B. Merialdo,et al. Tagging text with a probabilistic model , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[15] Lawrence R. Rabiner,et al. A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.
[16] Kenneth Ward Church. A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text , 1988, ANLP.
[17] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[18] Van Nostrand,et al. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .