Genetic rule induction at an intermediate level

Abstract Lists of if–then rules (i.e. ordered rule sets) are among the most expressive and intelligible representations for inductive learning algorithms. Two extreme strategies searching for such a list of rules can be distinguished: (i) local strategies primarily based on a step-by-step search for the optimal list of rules, and (ii) global strategies primarily based on a one-strike search for the optimal list of rules. Both approaches have their disadvantages. In this paper we present an intermediate strategy. A sequential covering strategy is combined with a one-strike genetic search for the next most promising rule. To achieve this, a new rule-fitness function is introduced. Experimental results on benchmark problems are presented and the performance of our intermediate approach is compared with other rule learning algorithms. Finally, GeSeCo's performance is compared to a more local strategy on a set of tasks in which the information value of individual attributes is varied.

[1]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[2]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

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

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

[5]  Paul E. Utgoff,et al.  ID5: An Incremental ID3 , 1987, ML Workshop.

[6]  Attilio Giordana,et al.  Learning Structured Concepts Using Genetic Algorithms , 1992, ML.

[7]  Stephen F. Smith,et al.  A Genetic System for Learning Models of Consumer Choice , 1987, ICGA.

[8]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[9]  Ryszard S. Michalski,et al.  On the Quasi-Minimal Solution of the General Covering Problem , 1969 .

[10]  Ivan Bratko,et al.  Prolog Programming for Artificial Intelligence , 1986 .

[11]  John R. Anderson,et al.  Machine learning - an artificial intelligence approach , 1982, Symbolic computation.

[12]  Pavel Brazdil,et al.  Proceedings of the European Conference on Machine Learning , 1993 .

[13]  Peter Clark,et al.  The CN2 induction algorithm , 2004, Machine Learning.

[14]  M. Bohanec,et al.  KNOWLEDGE ACQUISITION AND EXPLANATION FOR MULTI-ATTRIBUTE DECISION MAKING ∗ , 1988 .

[15]  John H. Holland,et al.  Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems , 1995 .

[16]  Diana Faye Gordon.  Active bias adjustment for incremental, supervised concept learning , 1990 .

[17]  Kenneth A. De Jong,et al.  Using genetic algorithms for concept learning , 1993, Machine Learning.

[18]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[19]  Ivan Bratko,et al.  PROLOG Programming for Artificial Intelligence, Second Edition , 1990 .

[20]  Gilles Venturini,et al.  SIA: A Supervised Inductive Algorithm with Genetic Search for Learning Attributes based Concepts , 1993, ECML.