Skip to main content

Advertisement

Log in

Parsimonious genetic programming for complex process intelligent modeling: algorithm and applications

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

A novel genetic programming (GP) algorithm called parsimonious genetic programming (PGP) for complex process intelligent modeling was proposed. First, the method uses traditional GP to generate nonlinear input–output model sets that are represented in a binary tree structure according to special decomposition method. Then, it applies orthogonal least squares algorithm (OLS) to estimate the contribution of the branches, which refers to basic function term that cannot be decomposed anymore, to the accuracy of the model, so as to eliminate complex redundant subtrees and enhance convergence speed. Finally, it obtains simple, reliable and exact linear in parameters nonlinear model via GP evolution. Simulations validate that the proposed method can generate more robust and interpretable models, which is obvious and easy for realization in real applications. For the proposed algorithm, the whole modeling process is fully automatic, which is a rather promising method for complex process intelligent modeling.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Akaike H (1974) A new look at the statistical model identification. IEEE Trans Automat Control 19:716–723

    Article  MATH  MathSciNet  Google Scholar 

  2. Liang G, Wilkes D, Cadzow J (1993) ARMA model order estimation based on the eigenvalues of the covariance matrix. IEEE Trans Signal Process 41(10):3003–3009

    Article  MATH  Google Scholar 

  3. Aguirre LA, Billings SA (1995) Improved structure selection for nonlinear models based on term clustering. Int J Control 62:569–587

    Article  MATH  MathSciNet  Google Scholar 

  4. Winkler S, Affenzeller M, Wagner S (2005) New methods for the identification of nonlinear model structures based upon Genetic Programming techniques. http://citeseer.ist.psu.edu/634350.html

  5. Mendes EMAM, Billings SA (2001) An alternative solution to the model structure selection problem. IEEE Trans Syst Man Cybern A: Syst Hum 31(6):597–608

    Article  Google Scholar 

  6. Feil B, Abonyi J, Szeifert F (2004) Model order selection of nonlinear input–output models using a clustering based approach. J Process Control 14(6):593–602

    Article  Google Scholar 

  7. Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. Cambridge, MIT Press

    MATH  Google Scholar 

  8. Madár J, Abonyi J, Szeifert F (2005) Genetic programming for the identification of nonlinear input–output models. http://citeseer.ist.psu.edu/720344.html

  9. Pearson R (2003) Selecting nonlinear model structures for computer control. J Process Control 13(1):1–26

    Article  Google Scholar 

  10. Chen S, Billings S, Luo W (1989) Orthogonal least squares methods and their application to nonlinear system identification. Int J Control 50:1873–1896

    Article  MATH  MathSciNet  Google Scholar 

  11. Vapnik VN (1998) The nature of statistical learning. Springer, New York

    Google Scholar 

Download references

Acknowledgments

This work is jointly supported by NSFC and CAA under grant 60672179 and also supported by National Defense Advanced Research Fund Grant # 4132030103.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xun-kai Wei.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wei, Xk., Li, Yh. & Feng, Y. Parsimonious genetic programming for complex process intelligent modeling: algorithm and applications. Neural Comput & Applic 19, 329–335 (2010). https://doi.org/10.1007/s00521-009-0308-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-009-0308-5

Keywords

Navigation