IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v377y2020ics0096300320301557.html
   My bibliography  Save this article

Robust extreme learning machine in the presence of outliers by iterative reweighted algorithm

Author

Listed:
  • Wang, Kuaini
  • Cao, Jinde
  • Pei, Huimin

Abstract

Extreme learning machine (ELM) is widely used to derive the single-hidden layer feedforward neural networks. However, ELM faces a great challenge in the presence of outliers, which can result in the sensitivity and poor robustness. To overcome this dilemma, a non-convex 2-norm loss function is developed to reduce these negative influences by setting a fixed penalty on any potential outliers. A novel robust ELM is proposed in this paper, and the resultant optimization can be implemented by an iterative reweighted algorithm, called IRRELM. In each iteration, IRRELM solves a weighted ELM. Several artificial datasets, real-world datasets and financial time series datasets are employed in numerical experiments, which demonstrate that IRRELM has superior generalization performance and robustness for modeling datasets in the presence of outliers, especially at the higher outlier levels.

Suggested Citation

  • Wang, Kuaini & Cao, Jinde & Pei, Huimin, 2020. "Robust extreme learning machine in the presence of outliers by iterative reweighted algorithm," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    • Handle: RePEc:eee:apmaco:v:377:y:2020:i:c:s0096300320301557
    DOI: 10.1016/j.amc.2020.125186
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320301557
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125186?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Li & Zhou, Shuisheng & Ma, Jiajun & Xu, Mingliang, 2021. "Fast kernel k-means clustering using incomplete Cholesky factorization," Applied Mathematics and Computation, Elsevier, vol. 402(C).

    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:eee:apmaco:v:377:y:2020:i:c:s0096300320301557. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.