Inductive learning in First-Order Logic (FOL) is a hard task due to both the pro-hibitive size of the search space and the computational cost of evaluating hypotheses. This paper introduces an evolutionary algo-rithm for concept learning in (a fragment of) FOL. The algorithm evolves a population of Horn clauses by repeated selection, mutation and optimization of more fit clauses. Its main novelty, with respect to previous approaches, is the use of stochastic search biases for re-ducing the complexity of the search process and of the clause fitness evaluation. An ex-perimental evaluation of the algorithm indi-cates its effectiveness in learning short hy-potheses of satisfactory accuracy in a short amount of time.
Concept learning is the induction of a de-scription from a set of examples. Inductive logic programm...
Abstract. This paper proposes an experimental evaluation of various discretization schemes in three ...
Learning in first-order logic (FOL) languages suffers from a specific difficulty: both induction and...
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a sho...
Summary. This chapter provides a short overview of a GA-based system for in-ductive concept learning...
Concept learning is the induction of a description from a set of examples. Inductive logic programmi...
Learning from examples in FOL, also known as Inductive Logic Programming (ILP) (Muggleton & Raed...
In this paper, we explore the use of genetic algorithms (GAs) to construct a system called GABIL tha...
In this thesis we describe a novel approach to application of Evolutionary Algorithms (EAs) into the...
In this paper, we explore the use of genetic algorithms (GAs) as a key element in the design and imp...
This paper presents a highly parallel genetic algorithm, designed for concept induction in propositi...
In this paper we explore the use of an adaptive search technique (genetic algorithms) to construct a...
This paper presents a highly parallel genetic algorithm, designed for concept induction in propositi...
This paper proposes two alternative methods for dealing with numeri-cal attributes in inductive conc...
178 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.HCL achieves two functionalit...
Concept learning is the induction of a de-scription from a set of examples. Inductive logic programm...
Abstract. This paper proposes an experimental evaluation of various discretization schemes in three ...
Learning in first-order logic (FOL) languages suffers from a specific difficulty: both induction and...
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a sho...
Summary. This chapter provides a short overview of a GA-based system for in-ductive concept learning...
Concept learning is the induction of a description from a set of examples. Inductive logic programmi...
Learning from examples in FOL, also known as Inductive Logic Programming (ILP) (Muggleton & Raed...
In this paper, we explore the use of genetic algorithms (GAs) to construct a system called GABIL tha...
In this thesis we describe a novel approach to application of Evolutionary Algorithms (EAs) into the...
In this paper, we explore the use of genetic algorithms (GAs) as a key element in the design and imp...
This paper presents a highly parallel genetic algorithm, designed for concept induction in propositi...
In this paper we explore the use of an adaptive search technique (genetic algorithms) to construct a...
This paper presents a highly parallel genetic algorithm, designed for concept induction in propositi...
This paper proposes two alternative methods for dealing with numeri-cal attributes in inductive conc...
178 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1998.HCL achieves two functionalit...
Concept learning is the induction of a de-scription from a set of examples. Inductive logic programm...
Abstract. This paper proposes an experimental evaluation of various discretization schemes in three ...
Learning in first-order logic (FOL) languages suffers from a specific difficulty: both induction and...