An entropy-based adaptive genetic algorithm for learning classification rules

L. Yang, D. H. Widyantoro, T. Ioerger, J. Yen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

Genetic algorithm is one of the commonly used approaches on data mining. In this paper, we put forward a genetic algorithm approach for classification problems. Binary coding is adopted in which an individual in a population consists of a fixed number of rules that stand for a solution candidate. The evaluation function considers four important factors which are error rate, entropy measure, rule consistency and hole ratio, respectively. Adaptive asymmetric mutation is applied by the self-adaptation of mutation inversion probability from 1-0 (0-1). The generated rules are not disjoint but can overlap. The final conclusion for prediction is based on the voting of rules and the classifier gives all rules equal weight for their votes. Based on three databases, we compared our approach with several other traditional data mining techniques including decision trees, neural networks and naive bayes learning. The results show that our approach outperformed others on both the prediction accuracy and the standard d eviation.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Evolutionary Computation, ICEC
Pages790-796
Number of pages7
Volume2
StatePublished - 2001
EventCongress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
Duration: May 27 2001May 30 2001

Other

OtherCongress on Evolutionary Computation 2001
CountryKorea, Republic of
CitySeoul
Period5/27/015/30/01

Fingerprint

Adaptive algorithms
Data mining
Entropy
Genetic algorithms
Function evaluation
Decision trees
Classifiers
Neural networks

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

Yang, L., Widyantoro, D. H., Ioerger, T., & Yen, J. (2001). An entropy-based adaptive genetic algorithm for learning classification rules. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (Vol. 2, pp. 790-796)
Yang, L. ; Widyantoro, D. H. ; Ioerger, T. ; Yen, J. / An entropy-based adaptive genetic algorithm for learning classification rules. Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. Vol. 2 2001. pp. 790-796
@inproceedings{9d2cd81363de4236a44aeb81bf8ca27b,
title = "An entropy-based adaptive genetic algorithm for learning classification rules",
abstract = "Genetic algorithm is one of the commonly used approaches on data mining. In this paper, we put forward a genetic algorithm approach for classification problems. Binary coding is adopted in which an individual in a population consists of a fixed number of rules that stand for a solution candidate. The evaluation function considers four important factors which are error rate, entropy measure, rule consistency and hole ratio, respectively. Adaptive asymmetric mutation is applied by the self-adaptation of mutation inversion probability from 1-0 (0-1). The generated rules are not disjoint but can overlap. The final conclusion for prediction is based on the voting of rules and the classifier gives all rules equal weight for their votes. Based on three databases, we compared our approach with several other traditional data mining techniques including decision trees, neural networks and naive bayes learning. The results show that our approach outperformed others on both the prediction accuracy and the standard d eviation.",
author = "L. Yang and Widyantoro, {D. H.} and T. Ioerger and J. Yen",
year = "2001",
language = "English (US)",
volume = "2",
pages = "790--796",
booktitle = "Proceedings of the IEEE Conference on Evolutionary Computation, ICEC",

}

Yang, L, Widyantoro, DH, Ioerger, T & Yen, J 2001, An entropy-based adaptive genetic algorithm for learning classification rules. in Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. vol. 2, pp. 790-796, Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of, 5/27/01.

An entropy-based adaptive genetic algorithm for learning classification rules. / Yang, L.; Widyantoro, D. H.; Ioerger, T.; Yen, J.

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. Vol. 2 2001. p. 790-796.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An entropy-based adaptive genetic algorithm for learning classification rules

AU - Yang, L.

AU - Widyantoro, D. H.

AU - Ioerger, T.

AU - Yen, J.

PY - 2001

Y1 - 2001

N2 - Genetic algorithm is one of the commonly used approaches on data mining. In this paper, we put forward a genetic algorithm approach for classification problems. Binary coding is adopted in which an individual in a population consists of a fixed number of rules that stand for a solution candidate. The evaluation function considers four important factors which are error rate, entropy measure, rule consistency and hole ratio, respectively. Adaptive asymmetric mutation is applied by the self-adaptation of mutation inversion probability from 1-0 (0-1). The generated rules are not disjoint but can overlap. The final conclusion for prediction is based on the voting of rules and the classifier gives all rules equal weight for their votes. Based on three databases, we compared our approach with several other traditional data mining techniques including decision trees, neural networks and naive bayes learning. The results show that our approach outperformed others on both the prediction accuracy and the standard d eviation.

AB - Genetic algorithm is one of the commonly used approaches on data mining. In this paper, we put forward a genetic algorithm approach for classification problems. Binary coding is adopted in which an individual in a population consists of a fixed number of rules that stand for a solution candidate. The evaluation function considers four important factors which are error rate, entropy measure, rule consistency and hole ratio, respectively. Adaptive asymmetric mutation is applied by the self-adaptation of mutation inversion probability from 1-0 (0-1). The generated rules are not disjoint but can overlap. The final conclusion for prediction is based on the voting of rules and the classifier gives all rules equal weight for their votes. Based on three databases, we compared our approach with several other traditional data mining techniques including decision trees, neural networks and naive bayes learning. The results show that our approach outperformed others on both the prediction accuracy and the standard d eviation.

UR - http://www.scopus.com/inward/record.url?scp=0034870275&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034870275&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034870275

VL - 2

SP - 790

EP - 796

BT - Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

ER -

Yang L, Widyantoro DH, Ioerger T, Yen J. An entropy-based adaptive genetic algorithm for learning classification rules. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. Vol. 2. 2001. p. 790-796