Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/16081
Title: Machine Learning Model for Heart Disease Prediction
Authors: Sri Varsha, R
Bhargav, C V
Sai Keerthana, M V
Deepak Raj, D M
Keywords: Machine Learning
Artificial Intelligence
Heart Disease
Linear Regression
Support Vector Machine
K Nearest Neighbour
Random Forest
Decision Tree.
Issue Date: 1-May-2024
Publisher: Alliance College of Engineering and Design, Alliance University
Citation: 48p.
Series/Report no.: CSE_G10_2024 [20030141CSE014; 20030141CSE017; 20030141CSE036]
Abstract: In this research paper, as we all know, machine learning is used in various fields including healthcare in this research work. ML plays an important role in determining the presence or absence of various heart conditions that pose a risk, including heart disease, exercise disorders, and other artery-related disorders. Therefore, we performed a comparative analysis on heart disease datasets to understand and explore the application of different algorithms for predicting heart-related conditions. Comprehensive analysis including preprocessing steps for feature selection using correlation matrix and evaluation of several algorithms such as Support Vector Machine (SVM), k Nearest Neighbors (KNN), Logistic Regression, Naive Bayes, Decision Tree to select relevant features. Via Random Forest, XG Boost. The goal is to evaluate the presence or absence of cardiovascular disease using input characteristics in the form of various parameters and evaluate its accuracy. Our results highlight the effectiveness of Random Forest in achieving favorable outcomes with 95% accuracy and provide ideas for improving diagnosis and medical interventions.
URI: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/16081
Appears in Collections:Dissertations - Alliance College of Engineering & Design

Files in This Item:
File SizeFormat 
CSE_G10_2024.pdf
  Restricted Access
1.02 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.