2010 International Conference on Computer and Communication Technology (ICCCT) 2010
DOI: 10.1109/iccct.2010.5640477
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm with entropy based initial bias for automated rule mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…After comparing the two generations of populations, best population is discovered. 4. After running several generations, final population can be realized.…”
Section: Proposed Genetic Algorithm With Modified Fitness Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…After comparing the two generations of populations, best population is discovered. 4. After running several generations, final population can be realized.…”
Section: Proposed Genetic Algorithm With Modified Fitness Functionmentioning
confidence: 99%
“…exist for classification. Genetic algorithms [1,2,3,4] is based on biological mechanism and takes attention of attribute interactions and has the capability of avoiding the convergence to local optimal solutions.…”
Section: Introductionmentioning
confidence: 99%
“…Initial population is generated by methodically eliminating the randomness using a generalized uniform population method [11] or using entropy based initialization [9][10] [14]. Several approaches to encode prediction (IF-THEN) rules into the genome of individuals, as well as generalizing/specializing crossover and informationtheoretic rule pruning operator have been suggested [15].…”
Section: Introductionmentioning
confidence: 99%
“…As rules are generated from random POP, their accuracy will be poorer in comparison to the rules generated by a pop which has been initialized using domain knowledge. Therefore, many researchers addressed this problem by seeding the initial GA population by using the concepts like entropy and attribute significance [9][10] [11].…”
Section: Introductionmentioning
confidence: 99%
“…A fixed encoding scheme is applied to the chromosomes and specific design is used for the mutation operator for GA designed by Fidelis et al [10] to discover comprehensible classification rules. A GA with entropy based filtering bias to initial population for automated rule mining proposed by Kapila et al [11]. A classification algorithm based on evolutionary approach that discovers comprehensible rules with exceptions in the form of censored production rules proposed by Bharadwaj & Al-Maqaleh [12], [13].…”
Section: Introductionmentioning
confidence: 99%