Rapid Prototyping of ILP Systems Using Explicit Bias
暂无分享,去创建一个
[1] James W. Brown,et al. Controlling the complexity of menu networks , 1982, CACM.
[2] S. Džeroski,et al. Learning Relations from Noisy Examples: An Empirical Comparison of LINUS and FOIL , 1991, ML.
[3] J. Ross Quinlan,et al. Determinate Literals in Inductive Logic Programming , 1991, IJCAI.
[4] Michael J. Pazzani,et al. Detecting and correcting errors in rule-based expert systems: an integration of empirical and explanation-based learning , 1991 .
[5] Jorg-uwe Kietz,et al. Controlling the Complexity of Learning in Logic through Syntactic and Task-Oriented Models , 1992 .
[6] Raymond J. Mooney,et al. Learning Relations by Pathfinding , 1992, AAAI.
[7] Saso Dzeroski,et al. PAC-learnability of determinate logic programs , 1992, COLT '92.
[8] William W. Cohen. Cryptographic Limitations on Learning One-Clause Logic Programs , 1993, AAAI.
[9] ProgramsWilliam W. CohenAT. Learnability of Restricted Logic Programs , 1993 .
[10] William W. Cohen. Grammatically Biased Learning: Learning Logic Programs Using an Explicit Antecedent Description Language , 1994, Artif. Intell..