Learning acyclic rules based on chaining genetic programming

Wing Ho SHUM, Kwong Sak LEUNG, Man Leung WONG

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

Abstract

Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is applied to different areas. But BN cannot handle continuous values. In contrast, Genetic Programming (GP) can handle continuous values and produces classification rules. However, GP is possible to produce cyclic rules representing tautologic, in which are useless for inference and expert systems. Co-evolutionary Rule-chaining Genetic Programming (CRGP) is the first variant of GP handling the multi-class problem and produces acyclic classification rules [16]. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. It can handle multi-classes; it can avoid cyclic rules; it can handle input attributes with continuous values; and it can learn complex relationships among the attributes. In this paper, we propose a novel algorithm, the Chaining Genetic Programming (CGP) learning a set of acyclic rules and to produce better results than the CRGP's. The experimental results demonstrate that the proposed algorithm has the shorter learning process and can produce more accurate acyclic classification rules.
Original languageEnglish
Title of host publicationProceedings of the IEEE International Conference on Computer Systems and Applications, 2006
PublisherInstitute of Electrical and Electronics Engineers
Pages960-967
Number of pages8
DOIs
Publication statusPublished - 1 Jan 2006

Fingerprint

Genetic programming
Bayesian networks
Expert systems

Bibliographical note

Paper presented at the IEEE International Conference on Computer Systems and Applications 2006 (AICCSA), 8 March 2006, Dubai, United Arab Emirates.
ISBN of the source publication: 9781424402120

Cite this

SHUM, W. H., LEUNG, K. S., & WONG, M. L. (2006). Learning acyclic rules based on chaining genetic programming. In Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006 (pp. 960-967). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/AICCSA.2006.205204
SHUM, Wing Ho ; LEUNG, Kwong Sak ; WONG, Man Leung. / Learning acyclic rules based on chaining genetic programming. Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006. Institute of Electrical and Electronics Engineers, 2006. pp. 960-967
@inproceedings{b5b2a8dbdb6f46f98fd69b2ee8ba8425,
title = "Learning acyclic rules based on chaining genetic programming",
abstract = "Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is applied to different areas. But BN cannot handle continuous values. In contrast, Genetic Programming (GP) can handle continuous values and produces classification rules. However, GP is possible to produce cyclic rules representing tautologic, in which are useless for inference and expert systems. Co-evolutionary Rule-chaining Genetic Programming (CRGP) is the first variant of GP handling the multi-class problem and produces acyclic classification rules [16]. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. It can handle multi-classes; it can avoid cyclic rules; it can handle input attributes with continuous values; and it can learn complex relationships among the attributes. In this paper, we propose a novel algorithm, the Chaining Genetic Programming (CGP) learning a set of acyclic rules and to produce better results than the CRGP's. The experimental results demonstrate that the proposed algorithm has the shorter learning process and can produce more accurate acyclic classification rules.",
author = "SHUM, {Wing Ho} and LEUNG, {Kwong Sak} and WONG, {Man Leung}",
note = "Paper presented at the IEEE International Conference on Computer Systems and Applications 2006 (AICCSA), 8 March 2006, Dubai, United Arab Emirates. ISBN of the source publication: 9781424402120",
year = "2006",
month = "1",
day = "1",
doi = "10.1109/AICCSA.2006.205204",
language = "English",
pages = "960--967",
booktitle = "Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006",
publisher = "Institute of Electrical and Electronics Engineers",

}

SHUM, WH, LEUNG, KS & WONG, ML 2006, Learning acyclic rules based on chaining genetic programming. in Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006. Institute of Electrical and Electronics Engineers, pp. 960-967. https://doi.org/10.1109/AICCSA.2006.205204

Learning acyclic rules based on chaining genetic programming. / SHUM, Wing Ho; LEUNG, Kwong Sak; WONG, Man Leung.

Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006. Institute of Electrical and Electronics Engineers, 2006. p. 960-967.

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

TY - GEN

T1 - Learning acyclic rules based on chaining genetic programming

AU - SHUM, Wing Ho

AU - LEUNG, Kwong Sak

AU - WONG, Man Leung

N1 - Paper presented at the IEEE International Conference on Computer Systems and Applications 2006 (AICCSA), 8 March 2006, Dubai, United Arab Emirates. ISBN of the source publication: 9781424402120

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is applied to different areas. But BN cannot handle continuous values. In contrast, Genetic Programming (GP) can handle continuous values and produces classification rules. However, GP is possible to produce cyclic rules representing tautologic, in which are useless for inference and expert systems. Co-evolutionary Rule-chaining Genetic Programming (CRGP) is the first variant of GP handling the multi-class problem and produces acyclic classification rules [16]. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. It can handle multi-classes; it can avoid cyclic rules; it can handle input attributes with continuous values; and it can learn complex relationships among the attributes. In this paper, we propose a novel algorithm, the Chaining Genetic Programming (CGP) learning a set of acyclic rules and to produce better results than the CRGP's. The experimental results demonstrate that the proposed algorithm has the shorter learning process and can produce more accurate acyclic classification rules.

AB - Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is applied to different areas. But BN cannot handle continuous values. In contrast, Genetic Programming (GP) can handle continuous values and produces classification rules. However, GP is possible to produce cyclic rules representing tautologic, in which are useless for inference and expert systems. Co-evolutionary Rule-chaining Genetic Programming (CRGP) is the first variant of GP handling the multi-class problem and produces acyclic classification rules [16]. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. It can handle multi-classes; it can avoid cyclic rules; it can handle input attributes with continuous values; and it can learn complex relationships among the attributes. In this paper, we propose a novel algorithm, the Chaining Genetic Programming (CGP) learning a set of acyclic rules and to produce better results than the CRGP's. The experimental results demonstrate that the proposed algorithm has the shorter learning process and can produce more accurate acyclic classification rules.

UR - http://commons.ln.edu.hk/sw_master/7078

U2 - 10.1109/AICCSA.2006.205204

DO - 10.1109/AICCSA.2006.205204

M3 - Conference paper (refereed)

SP - 960

EP - 967

BT - Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006

PB - Institute of Electrical and Electronics Engineers

ER -

SHUM WH, LEUNG KS, WONG ML. Learning acyclic rules based on chaining genetic programming. In Proceedings of the IEEE International Conference on Computer Systems and Applications, 2006. Institute of Electrical and Electronics Engineers. 2006. p. 960-967 https://doi.org/10.1109/AICCSA.2006.205204