IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v26y2023i3p326-337.html
   My bibliography  Save this article

A likelihood swarm whale optimization based LeNet classifier approach for the prediction and diagnosis of patients with atherosclerosis disease

Author

Listed:
  • P. Govindamoorthi
  • P. Ranjith Kumar

Abstract

Coronary Artery Disease (CAD) caused by atherosclerosis is having huge impact and is considered an epidemic one in all over the world. Cardio vascular disease (CVD) in 2019 records is about 32% of global death rate. Among these deaths, 85% were caused by heart attack and stroke. Atherosclerosis is regarded as a condition at which the arteries become hardened and narrowed due to the plaque accumulation around the walls of arteries. The disease growth is slow, asymptomatic, sudden cardiac arrest, myocardial infarction and stroke. At present, medical diagnostic techniques are widely applied for the prediction of disease. However, they are uncommon in the desired sensitivity and resolution for detection. The lack of non-invasive diagnosing tool for the prediction of disease in early stage limits the treatment and prevention of patients having various degrees. This proposed research work focuses on intelligent optimization technique named Maximum Likelihood Swarm Whale Optimization (MLSWO) that is used to extract the crucial features in the Atherosclerosis (STULONG) and Kaggle datasets and predict the disease progression. The outcomes the selected features are classified using LeNet classifier for assorting the individuals. The proposed MLSWO algorithm produces higher accuracy rate of 99.2%, sensitivity rate of 98.36% and specificity of 100% compared with other state-of art techniques.

Suggested Citation

  • P. Govindamoorthi & P. Ranjith Kumar, 2023. "A likelihood swarm whale optimization based LeNet classifier approach for the prediction and diagnosis of patients with atherosclerosis disease," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 26(3), pages 326-337, February.
  • Handle: RePEc:taf:gcmbxx:v:26:y:2023:i:3:p:326-337
    DOI: 10.1080/10255842.2022.2116577
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/10255842.2022.2116577?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:gcmbxx:v:26:y:2023:i:3:p:326-337. 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/gcmb .

    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.