IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/1649486.html
   My bibliography  Save this article

Deep Network Based on Stacked Orthogonal Convex Incremental ELM Autoencoders

Author

Listed:
  • Chao Wang
  • Jianhui Wang
  • Shusheng Gu

Abstract

Extreme learning machine (ELM) as an emerging technology has recently attracted many researchers’ interest due to its fast learning speed and state-of-the-art generalization ability in the implementation. Meanwhile, the incremental extreme learning machine (I-ELM) based on incremental learning algorithm was proposed which outperforms many popular learning algorithms. However, the incremental algorithms with ELM do not recalculate the output weights of all the existing nodes when a new node is added and cannot obtain the least-squares solution of output weight vectors. In this paper, we propose orthogonal convex incremental learning machine (OCI-ELM) with Gram-Schmidt orthogonalization method and Barron’s convex optimization learning method to solve the nonconvex optimization problem and least-squares solution problem, and then we give the rigorous proofs in theory. Moreover, in this paper, we propose a deep architecture based on stacked OCI-ELM autoencoders according to stacked generalization philosophy for solving large and complex data problems. The experimental results verified with both UCI datasets and large datasets demonstrate that the deep network based on stacked OCI-ELM autoencoders (DOC-IELM-AEs) outperforms the other methods mentioned in the paper with better performance on regression and classification problems.

Suggested Citation

  • Chao Wang & Jianhui Wang & Shusheng Gu, 2016. "Deep Network Based on Stacked Orthogonal Convex Incremental ELM Autoencoders," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-17, June.
  • Handle: RePEc:hin:jnlmpe:1649486
    DOI: 10.1155/2016/1649486
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/1649486.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/1649486.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/1649486?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
    ---><---

    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:hin:jnlmpe:1649486. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.