Semantic and Syntactic Attribute Types in AQ Learning

AQ learning strives to perform natural induction that aims at deriving general descriptions from specific data and formulating them in human-oriented forms. Such descriptions are in the forms closely corresponding to simple natural language statements, or are transformed to such statements in order to make computer generated knowledge easy to interpret and understand. An important feature of natural induction is that it employs a wide range of types of attributes to guide the process of generalization. Attribute types constitute problem domain knowledge, and are provided by the user, or are inferred by the learning program from the data. This paper makes a distinction between semantic and syntactic attribute types in AQ learning, explains their relationships and provides their classifications. Semantic types depend solely on the structure of attribute domains and help to create plausible generalizations, while syntactic types depend also on physical properties of attribute domains, and are used to efficiently implement semantic types.

[1]  R. Michalski Attributional Calculus: A Logic and Representation Language for Natural Induction , 2004 .

[2]  Dorian Pyle,et al.  Data Preparation for Data Mining , 1999 .

[3]  Ryszard S. Michalski,et al.  Reasoning with Meta-values in AQ Learning , 2005 .

[4]  Peter Clark,et al.  The CN2 Induction Algorithm , 1989, Machine Learning.

[5]  Kenneth A. Kaufman,et al.  Learning Patterns in Noisy Data: The AQ Approach , 2001, Machine Learning and Its Applications.

[6]  Ian Witten,et al.  Data Mining , 2000 .

[7]  Leonard R. Sussman,et al.  Nominal, Ordinal, Interval, and Ratio Typologies are Misleading , 1993 .

[8]  John J. Grefenstette,et al.  The Evolution of Strategies for Multiagent Environments , 1992, Adapt. Behav..

[9]  Larry Kerschberg,et al.  Mining for knowledge in databases: The INLEN architecture, initial implementation and first results , 2004, Journal of Intelligent Information Systems.

[10]  Ryszard S. Michalski,et al.  Pattern Recognition as Knowledge-Guided Computer Induction , 1978 .

[11]  Ryszard S. Michalski,et al.  Inductive inference of VL decision rules , 1977, SGAR.

[12]  Ryszard S. Michalski,et al.  The Use of Compound Attributes inAQ Learning , 2006, Intelligent Information Systems.

[13]  William W. Cohen Fast Effective Rule Induction , 1995, ICML.

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

[15]  Kenneth A. Kaufman,et al.  The AQ21 Natural Induction Program for Pattern Discovery: Initial Version and its Novel Features , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[16]  S S Stevens,et al.  On the Theory of Scales of Measurement. , 1946, Science.

[17]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[18]  Thomas G. Dietterich,et al.  Inductive Learning of Structural Descriptions: Evaluation Criteria and Comparative Review of Selected Methods , 1981, Artif. Intell..

[19]  Sumit Sarkar,et al.  A probabilistic relational model and algebra , 1996, TODS.

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

[21]  Ryszard S. Michalski,et al.  Data-Driven Constructive Induction , 1998, IEEE Intell. Syst..

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

[23]  Kenneth A. Kaufman,et al.  A Method for Reasoning with Structured and Continuous Attributes in the INLEN-2 Multistrategy Knowledge Discovery System , 1996, KDD.

[24]  Kenneth A. Kaufman,et al.  The Development of the Inductive Database System VINLEN: A Review of Current Research , 2003, IIS.

[25]  A. Berger,et al.  On the theory of C[alpha]-tests , 1989 .