IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2024i12p3672-3691.html
   My bibliography  Save this article

Optimal knots for smoothing splines and adaptive smoothing splines in generalized linear models: Design approach

Author

Listed:
  • Mina Allami
  • Mehrdad Niaparast

Abstract

Smoothing splines play a crucial role as a prevalent tool for estimating unknown functions in non parametric regression. In fitting functions with varying roughness, adaptive smoothing splines provide the flexibility to adjust the smoothing parameter adaptively with the changes over the predictor variable within specific intervals, facilitating accommodation for changing roughness. Despite its intuitive appeal and high flexibility, the implementation of this estimator poses challenges, especially in the absence of specified knot numbers, knot locations, and certain simplifying assumptions on the smoothing parameter. D-optimal designs are considered to specify the knot locations in this models. The prior information from data as the prior curvature knowledge can be useful for this optimization problem. For this purpose, the smoothing parameter in this optimization problem can be considered as a function based on the prior curvature. We apply this method to responses from the exponential family of distributions. The mathematical expression of the estimator of the curve in a generalized linear mixed model enables us to derive an information matrix. The derived information matrix and hence the optimum design will depend on the values of the model’s unknown parameters. In such situations, numerical techniques should be considered for evaluating and optimizing this criterion.

Suggested Citation

  • Mina Allami & Mehrdad Niaparast, 2024. "Optimal knots for smoothing splines and adaptive smoothing splines in generalized linear models: Design approach," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(12), pages 3672-3691, September.
  • Handle: RePEc:taf:lstaxx:v:54:y:2024:i:12:p:3672-3691
    DOI: 10.1080/03610926.2024.2401095
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2024.2401095?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:lstaxx:v:54:y:2024:i:12:p:3672-3691. 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/lsta .

    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.