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

Sparse-Coding-Based Autoencoder and Its Application for Cancer Survivability Prediction

Author

Listed:
  • Gang Huang
  • Hailun Wang
  • Lu Zhang
  • Muhammad Faisal Nadeem

Abstract

Cancer-survivability prediction is one of the popular research topics, that attracted great attention from both the health service providers and academia. However, one remaining question comes from how to make full use of a large number of available factors (or features). This paper, accordingly, presents a novel autoencoder algorithm based on the concept of sparse coding to address this problem. The main contribution is twofold: the utilization of sparsity coding for input feature selection and a subsequent classification using latent information. Precisely, a typical autoencoder architecture is employed for reconstructing the original input. Then the sparse coding technique is applied to optimize the network structure, with the aim of selecting optimal features and enhancing the generalization capability. In addition, the refined latent information is further cast as alternative features for training a sparse classifier. To evaluate the performance of the proposed autoencoder architecture, we present a comprehensive analysis using a publicly available data repository (i.e., Surveillance, Epidemiology, and End Results, SEER). Experimental study shows that the proposed approach has the ability of extracting important features from high-dimensional inputs and achieves competitive performance than other state-of-the-art classification techniques.

Suggested Citation

  • Gang Huang & Hailun Wang & Lu Zhang & Muhammad Faisal Nadeem, 2022. "Sparse-Coding-Based Autoencoder and Its Application for Cancer Survivability Prediction," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-12, February.
  • Handle: RePEc:hin:jnlmpe:8544122
    DOI: 10.1155/2022/8544122
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8544122.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8544122.xml
    Download Restriction: no

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