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

An Algorithm for Optimally Fitting a Wiener Model

Author

Listed:
  • Lucas P. Beverlin
  • Derrick K. Rollins
  • Nisarg Vyas
  • David Andre

Abstract

The purpose of this work is to present a new methodology for fitting Wiener networks to datasets with a large number of variables. Wiener networks have the ability to model a wide range of data types, and their structures can yield parameters with phenomenological meaning. There are several challenges to fitting such a model: model stiffness, the nonlinear nature of a Wiener network, possible overfitting, and the large number of parameters inherent with large input sets. This work describes a methodology to overcome these challenges by using several iterative algorithms under supervised learning and fitting subsets of the parameters at a time. This methodology is applied to Wiener networks that are used to predict blood glucose concentrations. The predictions of validation sets from models fit to four subjects using this methodology yielded a higher correlation between observed and predicted observations than other algorithms, including the Gauss-Newton and Levenberg-Marquardt algorithms.

Suggested Citation

  • Lucas P. Beverlin & Derrick K. Rollins & Nisarg Vyas & David Andre, 2011. "An Algorithm for Optimally Fitting a Wiener Model," Mathematical Problems in Engineering, Hindawi, vol. 2011, pages 1-15, December.
  • Handle: RePEc:hin:jnlmpe:570509
    DOI: 10.1155/2011/570509
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2011/570509.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2011/570509.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2011/570509?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:570509. 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.