CONCEPTUAL TRANSITION FROM LOGIC TO ARITHMETIC IN CONCEPT LEARNING

This paper presents a computational study of the change of the logic-based concepts to arithmeticbased concepts in inductive learning from examples. Specifically, we address the problem of learning concepts whose description in the original knowledge representation space is very complex and difficult to learn using a conventional machine learning approach. By detecting "exclusive-or" patterns in the initially created hypotheses, the system postulates symmetry relations among pairs of initial attributes. The symmetry pairs are then combined into maximal symmetry groups. Each symmetry group leads to a creation of a counting attribute which is added as a new dimension to the representation space. So modified representation space facilitates the determination of new type of concept descriptions, called conditional M-of-N rules. The proposed ideas are illustrated by a visualization method based on the generalized logic diagram (GLD).

[1]  M. Pazzani,et al.  ID2-of-3: Constructive Induction of M-of-N Concepts for Discriminators in Decision Trees , 1991 .

[2]  Ryszard S. Michalski,et al.  Data-driven constructive induction in AQ17-PRE: A method and experiments , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

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

[4]  Ryszard S. Michalski,et al.  Discovering Representation Space Transformations for Learning Concept Descriptions Combining DNF and M-of-N Rules , 1994 .

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

[6]  A Transformational Approach to Constructive Induction , 1991, ML.

[7]  Ryszard S. Michalski,et al.  Comparing Symbolic and Subsymbolic Learning: Three Studies , 1992 .

[8]  Paul E. Utgoff,et al.  A Hybrid Method for Feature Generation , 1991, ML.

[9]  Raymond J. Mooney,et al.  Symbolic Revision of Theories with M-of-N Rules , 1993, IJCAI.

[10]  Janusz Wnek,et al.  Hypothesis-driven constructive induction , 1993 .

[11]  Ryszard S. Michalski,et al.  Variable-Valued Logic and Its Applications to Pattern Recognition and Machine Learning , 1975 .

[12]  Ryszard S. Michalski,et al.  Recognition of Total or Partial Symmetry in a Completely or Incompletely Specified Switching Function , 1969 .

[13]  Stephen Muggleton,et al.  Duce, An Oracle-based Approach to Constructive Induction , 1987, IJCAI.

[14]  Azriel Rosenfeld,et al.  Machine Vision and Learning: Research Issues and Directions , 1994 .

[15]  Ryszard S. Michalski,et al.  A theory and methodology of inductive learning , 1993 .

[16]  Sebastian Thrun,et al.  The MONK''s Problems-A Performance Comparison of Different Learning Algorithms, CMU-CS-91-197, Sch , 1991 .