IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v13y2019i3p195-208.html
   My bibliography  Save this article

Extending Gaussian process emulation using cluster analysis and artificial neural networks to fit big training sets

Author

Listed:
  • Wim De Mulder
  • Bernhard Rengs
  • Geert Molenberghs
  • Thomas Fent
  • Geert Verbeke

Abstract

Gaussian process (GP) emulation is a relatively recent statistical technique that provides a fast-running approximation to a complex computer model, given training data generated by the considered model. Despite its sound theoretical foundation, GP emulation falls short in practical applications where the training dataset is very large, due to numerical instabilities in inverting the correlation matrix. We show how GP emulation can be extended to handle large training sets by first dividing the training set into smaller subsets using cluster analysis, then training an emulator for each subset, and finally combining the emulators using an artificial neural network (ANN). Our work has also conceptual relevance, as it shows how to solve a big data problem by introducing a local level in input space, where each emulator specialises in a certain subregion, and a global level, where the identified local features of the computer model are combined into a global view.

Suggested Citation

  • Wim De Mulder & Bernhard Rengs & Geert Molenberghs & Thomas Fent & Geert Verbeke, 2019. "Extending Gaussian process emulation using cluster analysis and artificial neural networks to fit big training sets," Journal of Simulation, Taylor & Francis Journals, vol. 13(3), pages 195-208, July.
  • Handle: RePEc:taf:tjsmxx:v:13:y:2019:i:3:p:195-208
    DOI: 10.1080/17477778.2018.1489936
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/17477778.2018.1489936
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/17477778.2018.1489936?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tjsmxx:v:13:y:2019:i:3:p:195-208. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.