This paper presents GA-PVMINER, a parallel genetic algorithm that uses the Parallel Virtual Machine (PVM) to discover rules in a database. The system uses the Michigan's approach, where each individual represents a rule. A rule has the form "if condition then prediction". GA-PVMINER is based on the concept learning framework, but it performs a generalization of the classification task, which can be called dependence modeling (sometimes also called generalized rule induction). In this task, different discovered rules can predict the value of different goal attributes in the "prediction" part of a rule, whereas in classification all discovered rules predict the value of the same goal attribute. The global population of genetic algorithm individuals is divided into several subpopulations, each assigned to a distinct processor. For each subpopulation, all the individuals represent rules with the same goal attribute in the "prediction" part of the rule. Different subpopulations evolve rules predicting different goal attributes. The system exploits both data parallelism and function parallelism.
[1]
Foster J. Provost,et al.
Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network
,
1993,
ICML.
[2]
Jack Dongarra,et al.
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
,
1995
.
[3]
Robert C. Holte,et al.
Concept Learning and the Problem of Small Disjuncts
,
1989,
IJCAI.
[4]
Ke Wang,et al.
Interestingness-Based Interval Merger for Numeric Association Rules
,
1998,
KDD.
[5]
Padhraic Smyth,et al.
Rule Induction Using Information Theory
,
1991,
Knowledge Discovery in Databases.
[6]
Filippo Neri,et al.
A Parallel Genetic Algorithm for Concept Learning
,
1995,
ICGA.
[7]
Lorenza Saitta,et al.
Learning Disjunctive Concepts by Means of Genetic Algorithms
,
1994,
ICML.