IDEAS home Printed from https://ideas.repec.org/a/taf/sactxx/v2021y2021i4p295-322.html
   My bibliography  Save this article

Grouping of contracts in insurance using neural networks

Author

Listed:
  • Mark Kiermayer
  • Christian Weiß

Abstract

Despite the high importance of grouping in practice, there exists little research on the respective topic. The present work presents a framework for grouping and a novel method to optimize model points in life insurance. We introduce a supervised clustering algorithm using neural networks to form a less complex portfolio, alias grouping. In a two-step approach, we first approximate selected characteristics of a portfolio. Next, we nest this estimator in a neural network, such that cluster representatives, alias model points, are calibrated in accordance with their effect on the characteristics of the portfolio. This approach is similar to the work by Horvath, B., Muguruza, A. & Tomas, M. [(2019). Deep learning volatility. Available on arXiv 1901.09647.], who focus on the calibration of implied volatility models. Our numerical experiments for term life insurance and defined contribution pension plans show significant improvements, in terms of capturing the characteristics of a portfolio, of the neural network approach over K-means clustering, a common baseline algorithm for grouping. These results are further confirmed by a sensitivity analysis of the investment surplus, where we additionally show the flexibility of the model to include common industry practice.

Suggested Citation

  • Mark Kiermayer & Christian Weiß, 2021. "Grouping of contracts in insurance using neural networks," Scandinavian Actuarial Journal, Taylor & Francis Journals, vol. 2021(4), pages 295-322, April.
  • Handle: RePEc:taf:sactxx:v:2021:y:2021:i:4:p:295-322
    DOI: 10.1080/03461238.2020.1836676
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03461238.2020.1836676?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:sactxx:v:2021:y:2021:i:4:p:295-322. 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/sact .

    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.