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

Adaptive distributed support vector regression of massive data

Author

Listed:
  • Shu-na Liang
  • Fei Sun
  • Qi Zhang

Abstract

Massive datasets bring new challenges to traditional statistical inference, particularly in terms of memory restriction and computation time. Support vector regression is a robust and efficient estimation method. We first adopt smoothing techniques to develop smoothed support vector regression (S-SVR) estimation method. Then we propose distributed S-SVR (DS-SVR) algorithm for massive datasets. The proposed method solves the problems of memory restriction and computation time, and the resulting estimate can achieve the same efficiency as the estimator computed on all data. We also establish the asymptotic normality of the resulting estimate. In addition, we propose an adaptive learning process of parameters by using a combination of grid search and k− fold cross-validation, in which the optimal parameters (λ,ϵ) are automatically selected by each data. Finally, the performance of the proposed method is illustrated well by simulation studies.

Suggested Citation

  • Shu-na Liang & Fei Sun & Qi Zhang, 2024. "Adaptive distributed support vector regression of massive data," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(9), pages 3365-3382, May.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:9:p:3365-3382
    DOI: 10.1080/03610926.2022.2153604
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2022.2153604?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:53:y:2024:i:9:p:3365-3382. 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.