The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
DOI: 10.1109/cec.2003.1299857
|View full text |Cite
|
Sign up to set email alerts
|

Data mining rules using multi-objective evolutionary algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0
1

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(42 citation statements)
references
References 8 publications
0
41
0
1
Order By: Relevance
“…Casillas et al, [17] state that the initialization procedure has to guarantee that the initial individuals cover all the input examples from the training data set. To ensure this, the authors of [6] use mutated forms of the default rule as initial solutions where the default rule is the rule in which all limits are maximally spaced and all labels are included. In the current study maximum and minimum chromosomes are used as seeds to create initial population.…”
Section: Population Initializationmentioning
confidence: 99%
“…Casillas et al, [17] state that the initialization procedure has to guarantee that the initial individuals cover all the input examples from the training data set. To ensure this, the authors of [6] use mutated forms of the default rule as initial solutions where the default rule is the rule in which all limits are maximally spaced and all labels are included. In the current study maximum and minimum chromosomes are used as seeds to create initial population.…”
Section: Population Initializationmentioning
confidence: 99%
“…Pareto-based multi-objective GAs have been previously investigated in DM tasks, as the algorithms used in the search for nonlinear models of direct marketing in (Bhattacharyya, 2000) and to select characteristics for non-supervised learning in (Kim et al, 2000). In (Iglesia et al, 2003), an approach based on the NSGAII is employed in the classification task (only one goal attribute), using metrics related to the rules precision: accuracy and covering. A Pareto-based GA was implemented to mine rules from market-basket type databases (association task), using metrics for accuracy, comprehensibility and degree of interestingness (Ghosh & Nath, 2004).…”
Section: Evolutionary Algorithms Applied To Data Miningmentioning
confidence: 99%
“…Cover Type datasets, using equal false positive and false negative costs algorithm has been shown to be an effective multi-objective optimizer, both in general and when optimizing rules [1,2,3,4]. Parameter tuning was performed on the Adult dataset and on 10,000 records selected at random from the Cover Type dataset, minimizing the simple error rate and the number of ATs.…”
Section: Fig 5 Comparison Of Different Crossover Rates and Populatimentioning
confidence: 99%
“…Earlier work by the authors [1,2,3,4] described the application of multi-objective metaheuristics to the problem of partial classification [5]. This problem is the search for simple rules, that represent 'strong' or 'interesting' descriptions of a specified class, or subsets of the specified class, even when that class has few representative cases in the data.…”
Section: Introductionmentioning
confidence: 99%