%0 Journal Article %1 ChiZhou:2003:TEC %A Zhou, Chi %A Xiao, Weimin %A Tirpak, Thomas M. %A Nelson, Peter C. %D 2003 %J IEEE Transactions on Evolutionary Computation %K GEP algorithms, classification data expression gene genetic mining, programming, rule, %N 6 %P 519--531 %T Evolving accurate and compact classification rules with gene expression programming %V 7 %X Classification is one of the fundamental tasks of data mining. Most rule induction and decision tree algorithms perform local, greedy search to generate classification rules that are often more complex than necessary. Evolutionary algorithms for pattern classification have recently received increased attention because they can perform global searches. In this paper, we propose a new approach for discovering classification rules by using gene expression programming (GEP), a new technique of genetic programming (GP) with linear representation. The antecedent of discovered rules may involve many different combinations of attributes. To guide the search process, we suggest a fitness function considering both the rule consistency gain and completeness. A multiclass classification problem is formulated as multiple two-class problems by using the one-against-all learning method. The covering strategy is applied to learn multiple rules if applicable for each class. Compact rule sets are subsequently evolved using a two-phase pruning method based on the minimum description length (MDL) principle and the integration theory. Our approach is also noise tolerant and able to deal with both numeric and nominal attributes. Experiments with several benchmark data sets have shown up to 20% improvement in validation accuracy, compared with C4.5 algorithms. Furthermore, the proposed GEP approach is more efficient and tends to generate shorter solutions compared with canonical tree-based GP classifiers.

@article{ChiZhou:2003:TEC, abstract = {Classification is one of the fundamental tasks of data mining. Most rule induction and decision tree algorithms perform local, greedy search to generate classification rules that are often more complex than necessary. Evolutionary algorithms for pattern classification have recently received increased attention because they can perform global searches. In this paper, we propose a new approach for discovering classification rules by using gene expression programming (GEP), a new technique of genetic programming (GP) with linear representation. The antecedent of discovered rules may involve many different combinations of attributes. To guide the search process, we suggest a fitness function considering both the rule consistency gain and completeness. A multiclass classification problem is formulated as multiple two-class problems by using the one-against-all learning method. The covering strategy is applied to learn multiple rules if applicable for each class. Compact rule sets are subsequently evolved using a two-phase pruning method based on the minimum description length (MDL) principle and the integration theory. Our approach is also noise tolerant and able to deal with both numeric and nominal attributes. Experiments with several benchmark data sets have shown up to 20% improvement in validation accuracy, compared with C4.5 algorithms. Furthermore, the proposed GEP approach is more efficient and tends to generate shorter solutions compared with canonical tree-based GP classifiers.}, added-at = {2008-06-19T17:46:40.000+0200}, author = {Zhou, Chi and Xiao, Weimin and Tirpak, Thomas M. and Nelson, Peter C.}, biburl = {https://www.bibsonomy.org/bibtex/27f7a2dc424e3ec0572027da0cb2ca450/brazovayeye}, interhash = {a99e33a714cf7c9bc9056aa1cf965774}, intrahash = {7f7a2dc424e3ec0572027da0cb2ca450}, issn = {1089-778X}, journal = {IEEE Transactions on Evolutionary Computation}, keywords = {GEP algorithms, classification data expression gene genetic mining, programming, rule,}, month = {December}, number = 6, pages = {519--531}, size = {13 pages}, timestamp = {2008-06-19T17:55:52.000+0200}, title = {Evolving accurate and compact classification rules with gene expression programming}, volume = 7, year = 2003 }