Toward effective knoledge acquisition with first-order logic induction

Knowledge acquisition with machine learning techniques is a fundamental requirement for knowledge discovery from databases and data mining systems. Two techniques in particular — inductive learning and theory revision — have been used toward this end. A method that combines both approaches to effectively acquire theories (regularity) from a set of training examples is presented. Inductive learning is used to acquire new regularity from the training examples; and theory revision is used to improve an initial theory. In addition, a theory preference criterion that is a combination of the MDL-based heuristic and the Laplace estimate has been successfully employed in the selection of the promising theory. The resulting algorithm developed by integrating inductive learning and theory revision and using the criterion has the ability to deal with complex problems, obtaining useful theories in terms of its predictive accuracy.

[1]  Raymond J. Mooney,et al.  Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.

[2]  Saso Dzeroski,et al.  Inductive Logic Programming: Techniques and Applications , 1993 .

[3]  Luc De Raedt,et al.  Multiple Predicate Learning , 1993, IJCAI.

[4]  Ivan Bratko,et al.  On Estimating Probabilities in Tree Pruning , 1991, EWSL.

[5]  Gordon Plotkin,et al.  A Note on Inductive Generalization , 2008 .

[6]  Masayuki Numao,et al.  Efficient Multiple Predicate Learner Based on Fast Failure Mechanism , 1996, PRICAI.

[7]  R. Mike Cameron-Jones,et al.  FOIL: A Midterm Report , 1993, ECML.

[8]  M. Pazzani,et al.  Error Reduction through Learning Multiple Descriptions , 1996, Machine Learning.

[9]  Ivan Bratko,et al.  First Order Regression , 1997, Machine Learning.

[10]  M. Numao,et al.  Concept formation in noisy domains , 1996 .

[11]  J. Ross Quinlan,et al.  The Minimum Description Length Principle and Categorical Theories , 1994, ICML.

[12]  R. Ichise,et al.  Inductive Logic Programming and Genetic Programming , 1998, ECAI.

[13]  Raymond J. Mooney,et al.  Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.

[14]  M. Pazzani,et al.  The Utility of Knowledge in Inductive Learning , 1992, Machine Learning.

[15]  張暁龍.  Knowledge Acquisition and Revision with First Order Logic Induction , 1998 .

[16]  Michael J. Pazzani,et al.  An information-based approach to integrating empirical and explanation-based learning , 1991 .

[17]  Nada Lavrac,et al.  The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains , 1986, AAAI.

[18]  Masayuki Numao,et al.  Learning and Revising Theories in Noisy Domains , 1997, ALT.

[19]  Masayuki Numao,et al.  Automated Bias Shift in a Constrained Space for Logic Program Synthesis , 2001 .

[20]  Michael J. Pazzani,et al.  Error reduction through learning multiple descriptions , 2004, Machine Learning.

[21]  Ehud Shapiro,et al.  Algorithmic Program Debugging , 1983 .

[22]  R. Mike Cameron-Jones,et al.  Induction of logic programs: FOIL and related systems , 1995, New Generation Computing.

[23]  Masayuki Numao,et al.  Efficient Learning of Logic Programs with Non-determinant, Non-discriminating Literals , 1991, ML.

[24]  Lionel Martin,et al.  Ilp-95, Leuven Mult Icn: an Empirical Multiple Predicate Learner , 1995 .

[25]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[26]  Shan-Hwei Nienhuys-Cheng,et al.  Foundations of Inductive Logic Programming , 1997, Lecture Notes in Computer Science.

[27]  Dana Angluin,et al.  Learning from noisy examples , 1988, Machine Learning.

[28]  Ashwin Srinivasan,et al.  Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction , 1996, Artif. Intell..

[29]  Stephen Muggleton,et al.  Efficient Induction of Logic Programs , 1990, ALT.

[30]  Donato Malerba,et al.  Multistrategy Learning for Document Recognition , 1994, Appl. Artif. Intell..

[31]  Gordon Plotkin,et al.  A Further Note on Inductive Generalization , 2008 .

[32]  Kunio Yoshida,et al.  Automatic Placement Using Static and Dynamic Groupings , 1996, IEA/AIE.

[33]  Stephen Muggleton,et al.  Inverse entailment and progol , 1995, New Generation Computing.

[34]  J. R. Quinlan.  Learning Logical Definitions from Relations , 1990 .

[35]  Masamichi Shimura,et al.  Learning from an Approximate Theory and Noisy Examples , 1993, AAAI.

[36]  Dennis D. Murphy,et al.  Book review: Computational Models of Scientific Discovery and Theory Formation Edited by Jeff Shrager & Pat Langley (Morgan Kaufmann San Mateo, CA, 1990) , 1992, SGAR.