A Technical Analysis on Data Mining Classification Algorithms for CVD Prediction

Cenitta, D and Vijaya Arjunan, R (2018) A Technical Analysis on Data Mining Classification Algorithms for CVD Prediction. Journal of Advanced Research in Dynamical and Control Systems, 10 (7). pp. 137-142. ISSN 1943023X

[img] PDF
4932.pdf - Published Version
Restricted to Registered users only

Download (193kB) | Request a copy

Abstract

Cardio Vascular Disease (CVD) is seemingly increasing for various reasons including life style modification and heredity. Multiple techniques and research are going for, how to predict and detect CVD’s. Mostly, Blood Pressure, Cholesterol and Pulse rate are some of important parameters involved in these checkouts. However, viewing the age factor of human’s these factors vary in tandem. Research follow up on CVD prediction indicates two main aspects i) Accuracy of CVD prediction is seemingly high if more attributes are taken into consideration and ii) Computer assisted methods are very much required for both observation and exact prediction. Present study on CVD detection dictates the need for computational decision support system for enhancing medical experts to wisely decide on clinical process and also to reduce risk over traditional support system. The present study aims to compare and analyze the different Data Mining classification algorithms such as Decision Tree, J48, Naïve Bayes, Bayes Net, Simple Cart, Artificial Neural Network, Genetic Algorithms, Nearest Neighbour, Associative classification, Generalized Linear Models, Support Vector Machine, C5, K-Means, MPSOK-means, Logistic Regression, ID3, and K-Nearest Neighbour which have been used in the prediction of CVD’s.

Item Type: Article
Uncontrolled Keywords: CVD, Decision Tree, K-Nearest Neighbour, Naïve Bayes.
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 28 Aug 2018 05:48
Last Modified: 28 Aug 2018 05:48
URI: http://eprints.manipal.edu/id/eprint/151864

Actions (login required)

View Item View Item