Improving Expressivity of Inductive Logic Programming by Learning Different Kinds of Fuzzy Rules

  • Authors:
  • Mathieu Serrurier;Henri Prade

  • Affiliations:
  • IRIT, UPS, 118 route de Narbonne, 31062, Toulouse cedex 9, France;IRIT, UPS, 118 route de Narbonne, 31062, Toulouse cedex 9, France

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue on soft computing for information mining
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Introducing fuzzy predicates in inductive logic programming may serve two different purposes: allowing for more adaptability when learning classical rules or getting more expressivity by learning fuzzy rules. This latter concern is the topic of this paper. Indeed, introducing fuzzy predicates in the antecedent and in the consequent of rules may convey different non-classical meanings. The paper focuses on the learning of gradual and certainty rules, which have an increased expressive power and have no simple crisp counterpart. The benefit and the application domain of each kind of rules are discussed. Appropriate confidence degrees for each type of rules are introduced. These confidence degrees play a major role in the adaptation of the classical FOIL inductive logic programming algorithm to the induction of fuzzy rules for guiding the learning process. The method is illustrated on a benchmark example and a case-study database.