1993
DOI: 10.1007/3-540-56602-3_142
|View full text |Cite
|
Sign up to set email alerts
|

SIA: A supervised inductive algorithm with genetic search for learning attributes based concepts

Abstract: Abstract. This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable number of attributes, which can be numeric or symbolic, and examples may belong to several classes. SIA algorithm is somewhat similar to the AQ algorithm because it takes an example as a seed and generalizes it, using a genetic process, to find a rule maximizing a noise tolerant rule evaluation criterion. The SIA approach to sup… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
102
0
6

Year Published

1998
1998
2014
2014

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 153 publications
(108 citation statements)
references
References 10 publications
(13 reference statements)
0
102
0
6
Order By: Relevance
“…Moreover, the fitness function has been provided with a set of parameters so that the user can drive the process of search depending on the desired rules. The punishment of the covered instances allows the subsequent rules, found by QARGA, trying to cover those instances that were still uncovered, by means of an iterative rule learning (IRL) (Venturini 1993).…”
Section: Description Of the Search Of Rulesmentioning
confidence: 99%
“…Moreover, the fitness function has been provided with a set of parameters so that the user can drive the process of search depending on the desired rules. The punishment of the covered instances allows the subsequent rules, found by QARGA, trying to cover those instances that were still uncovered, by means of an iterative rule learning (IRL) (Venturini 1993).…”
Section: Description Of the Search Of Rulesmentioning
confidence: 99%
“…SLAVE iteratively evolves a set of individuals following an iterative rule learning scheme [47]. This process is based on the iteration of the following steps: 1) learn one rule from the dataset, 2) penalize the data covered by the rule.…”
Section: Slavementioning
confidence: 99%
“…As a result, the concept of GBML has been extended with new proposals of learners that use EAs to evolve their knowledge. Some of these approaches lay between the definitions of Pittsburgh-style and Michigan-style GBML, such as the Iterative Learning Rule approach [47]. Others methodologies propose to include EAs as robust search mechanisms to assist the building of neural networks [34,48] or statistical classifiers [14,36].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It chooses the best individual of the evolutionary process, transforming it into a rule, which is used to eliminate data from the training file [13]. In this way, the training file is reduced for the following iteration.…”
Section: Algorithmmentioning
confidence: 99%