IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v19y2025i1p1-27.html
   My bibliography  Save this article

Gene Expression Programming With Structured Reusability

Author

Listed:
  • YaPing Zheng

    (Guangzhou University, China)

  • Pei He

    (Guangzhou University, China)

  • Chi-Chang Chang

    (School of Medical Informatics, Chung Shan Medical University & IT Office, Chung Shan Medical University Hospital, Taichung, Taiwan & Department of Information Management, Ming Chuan University, Taoyuan City, Taiwan)

  • Kangshun Li

    (Dongguan City University, China)

Abstract

In the field of evolutionary computation, gene expression programming (GEP) has been favored by the public because of its straightforward encoding method. Due to the coding rules for the head and tail on gene, the ability of gene to be constructed as an expression is limited, thereby limiting the expressiveness of individuals. In this article, a variant that uses the standard GEP individual structure and is based on code reuse strategy is proposed to maintain the concise individual representation advantage of GEP and improve the expressive ability of individual. This method can improve the accuracy of the individual and reduce the expression tree complexity. In addition, experiments conducted to predict the recurrence of cervical cancer and malignancy of breast cancer have demonstrated that the predicted performance of GEP and gene expression programming with structured reusability (SR-GEP) has performed better than that of C5.0, but SR-GEP performs best.

Suggested Citation

  • YaPing Zheng & Pei He & Chi-Chang Chang & Kangshun Li, 2025. "Gene Expression Programming With Structured Reusability," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 19(1), pages 1-27, January.
    • Handle: RePEc:igg:jcini0:v:19:y:2025:i:1:p:1-27
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.371417
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcini0:v:19:y:2025:i:1:p:1-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.