A Genetic Algorithm for Generalized Rule Induction
Advances in soft computingPublished 1 January 1999
Alex A. Freitas
Citations50
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents a new genetic algorithm designed for discovering a few interesting, high-level prediction rules from databases, rather than discovering classification knowledge as usual in the literature.
Abstract
Data mining consists of the efficient discovery of knowledge from databases. This paper presents a new genetic algorithm designed for discovering a few interesting, high-level prediction rules from databases, rather than discovering classification knowledge (often a large rule set) as usual in the literature. Three important data mining issues addressed by our algorithm are the interestingness of the discovered knowledge, the computational efficiency of the algorithm, and the trade-off between representation expressiveness and efficiency.
Keywords
Computer Science
Generating production rules from decision trees
474 Citations1987J. R. Quinlan
This paper describes a technique for transforming such trees to small sets of production rules, a common formalism for expressing knowledge in expert systems, and provides a way of combining different decision trees for the same classification domain.
Concept learning and the problem of small disjuncts
342 Citations1989Robert C. Holte, Liane Acker +1 more
Various approaches to this problem are evaluated, including the novel approach of using a bias different than the "maximum generality" bias, which prove partly successful, but the problem of small disjuncts remains open.
Machine LearningA knowledge-intensive genetic algorithm for supervised learning
247 Citations1994Cezary Z. Janikow
The method of abstracting the genetic algorithm to the problem level, described here for the supervised inductive learning, can be also extended to other domains and tasks, since it provides a framework for combining recently popular genetic algorithm methods with traditional problem-solving methodologies.
Machine LearningA Knowledge-Intensive Genetic Algorithm for Supervised Learning
150 Citations1993Cezary Z. Janikow
The method of abstracting the genetic algorithm to the problem level, described here for the supervised inductive learning, provides a framework for combining recently popular genetic algorithm methods with traditional problem-solving methodologies.
Journal of Intelligent Information SystemsSelecting among rules induced from a hurricane database
109 Citations1995John A. Major, John J. Mangano
A rule refinement strategy is presented, partly implemented in a Prolog program, that operationalizes “interestingness” into performance, simplicity, novelty, and significance and yielded 10 “genuinely interesting” rules.
Elsevier eBooksLearning with Rare Cases and Small Disjuncts
86 Citations1995Gary M. Weiss
One key conclusion is that when low levels of attribute noise are applied only to the training set (the ability to learn the correct concept is being evaluated), rare cases within a domain are primarily responsible for making learning difficult.
Limits on Learning Machine Accuracy Imposed by Data Quality
61 Citations1994Corinna Cortes, L. D. Jackel +1 more
Learning first order logic rules with a genetic algorithm
53 Citations1995S. Augier, G. Venturing +1 more
A new algorithm called SIAO1 for learning first order logic rules with genetic algorithms using the covering principle developed in AQ where seed examples are generalized into rules using however a genetic search, as initially introduced in the SIA algorithm for attribute-based representation.
Knowledge AcquisitionChoosing among competing generalizations
32 Citations1991Friedrich Gebhardt
A procedure is developed and examined that employs two notions: a measure for the quality of a single generalization and an asymmetric measures for the similarity of two generalizations (called affinity) that co-operate in suppressing generalizations that are worse than, but not too different from, another generalization.
UEA Digital Repository (University of East Anglia)Discovering knowledge in commercial databases using modern heuristic techniques
22 Citations1996Beatriz de la Iglesia, Justin C. W. Debuse +1 more
The requirements that data mining systems must meet to be useful in most real commercial environments are explored and some of the available data mining techniques are looked at, including the author's own heuristic techniques, and how they perform with respect to those requirements.