A lexicographic genetic algorithm for hierarchical classification rule induction

Author(s):  
Gean Trindade Pereira ◽  
Paulo. H. R. Gabriel ◽  
Ricardo Cerri
2020 ◽  
Vol 16 (7) ◽  
pp. 1019-1028
Author(s):  
Hayder Naser Khraibet AL-Behadili ◽  
Ku Ruhana Ku-Mahamud ◽  
Rafid Sagban

1996 ◽  
Vol 18 (2-3) ◽  
pp. 135-145 ◽  
Author(s):  
Toshio Tsuchiya ◽  
Tatsushi Maeda ◽  
Yukihiro Matsubara ◽  
Mitsuo Nagamachi

2011 ◽  
Vol 2 (1) ◽  
pp. 49-58
Author(s):  
Periasamy Vivekanandan ◽  
Raju Nedunchezhian

Genetic algorithm is a search technique purely based on natural evolution process. It is widely used by the data mining community for classification rule discovery in complex domains. During the learning process it makes several passes over the data set for determining the accuracy of the potential rules. Due to this characteristic it becomes an extremely I/O intensive slow process. It is particularly difficult to apply GA when the training data set becomes too large and not fully available. An incremental Genetic algorithm based on boosting phenomenon is proposed in this paper which constructs a weak ensemble of classifiers in a fast incremental manner and thus tries to reduce the learning cost considerably.


Sign in / Sign up

Export Citation Format

Share Document