Learning and Revising Theories in Noisy Domains
暂无分享,去创建一个
[1] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..
[2] J. Ross Quinlan,et al. The Minimum Description Length Principle and Categorical Theories , 1994, ICML.
[3] J. Rissanen. Stochastic Complexity and Modeling , 1986 .
[4] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .
[5] Michael J. Pazzani,et al. An information-based approach to integrating empirical and explanation-based learning , 1991 .
[6] Michael J. Pazzani,et al. A Methodology for Evaluating Theory Revision Systems: Results with Audrey II , 1993, IJCAI.
[7] Masamichi Shimura,et al. Learning from an Approximate Theory and Noisy Examples , 1993, AAAI.
[8] Masayuki Numao,et al. Efficient Multiple Predicate Learner Based on Fast Failure Mechanism , 1996, PRICAI.
[9] Masayuki Numao,et al. Learning Simple Recursive Concepts by Discovering Missing Examples , 1996, PRICAI.
[10] Ashwin Srinivasan,et al. Compression, Significance, and Accuracy , 1992, ML.