IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/731207.html
   My bibliography  Save this article

Automatic Curve Fitting Based on Radial Basis Functions and a Hierarchical Genetic Algorithm

Author

Listed:
  • G. Trejo-Caballero
  • H. Rostro-Gonzalez
  • C. H. Garcia-Capulin
  • O. G. Ibarra-Manzano
  • J. G. Avina-Cervantes
  • C. Torres-Huitzil

Abstract

Curve fitting is a very challenging problem that arises in a wide variety of scientific and engineering applications. Given a set of data points, possibly noisy, the goal is to build a compact representation of the curve that corresponds to the best estimate of the unknown underlying relationship between two variables. Despite the large number of methods available to tackle this problem, it remains challenging and elusive. In this paper, a new method to tackle such problem using strictly a linear combination of radial basis functions (RBFs) is proposed. To be more specific, we divide the parameter search space into linear and nonlinear parameter subspaces. We use a hierarchical genetic algorithm (HGA) to minimize a model selection criterion, which allows us to automatically and simultaneously determine the nonlinear parameters and then, by the least-squares method through Singular Value Decomposition method, to compute the linear parameters. The method is fully automatic and does not require subjective parameters, for example, smooth factor or centre locations, to perform the solution. In order to validate the efficacy of our approach, we perform an experimental study with several tests on benchmarks smooth functions. A comparative analysis with two successful methods based on RBF networks has been included.

Suggested Citation

  • G. Trejo-Caballero & H. Rostro-Gonzalez & C. H. Garcia-Capulin & O. G. Ibarra-Manzano & J. G. Avina-Cervantes & C. Torres-Huitzil, 2015. "Automatic Curve Fitting Based on Radial Basis Functions and a Hierarchical Genetic Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-14, December.
  • Handle: RePEc:hin:jnlmpe:731207
    DOI: 10.1155/2015/731207
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/731207.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/731207.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/731207?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:731207. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.