Heart Disease Prediction

SURAJ YADAV
MR. SASHI KANT, ASSISTANT PROFESSOR
DEPARTMENT OF CSE
GREATER NOIDA INSTITUTE OF TECHNOLOGY

ABSTRACT Thus, this paper presents a relative study

by assaying the performance of different
More Lately, prognosticating Heart Disease machine learning algorithms.
is one of the most complex tasks in the
medical field. At present, about one person
dies a nanosecond from heart complaint.
Data science plays an important part in The exploration results confirm that the
recycling large quantities of data in the Random Forest algorithm achieved a
field of health care. Since prognosticating veritably high delicacy of90.16 compared
heart complaint is a complex task, there's a to other ML algorithms used.
need to automate the prophecies process to
avoid the pitfalls associated with it and to KEYWORDS: Decision Tree, Naive
warn the case in advance. This paper uses Bayes, Logistic Regression, Random Forest,
the heart complaint database set up in the Heart Disease Prediction
UCI machine literacy area. The proposed
work predicts the threat of Heart Disease
and differentiates the case's threat profile
using a variety of data mining ways similar
as Naive Bayes, Decision Tree, Depression
and Random Forest.

INTRODUCTION
The work proposed in this paper focuses
on the various data mining practices
used to predict heart disease. The human
heart is a vibrant part of the human body.
Basically, it controls the flow of blood
throughout our vibrant part of the
human body. Basically, it controls the
flow of blood throughout our body. Any
heart failure can cause stress in other
parts of the body. Any type of
disturbance in the normal functioning of
the heart can be classified as heart
disease. In today's world, heart disease
is one of the major causes of death.
Heart disease can be caused by an
unhealthy lifestyle, smoking, alcohol
and high fat diets that can cause high
blood pressure. According to the World
Health Organization, more than ten
million people die from heart disease
each year. A healthy lifestyle and early
detection are the only ways to prevent
heart-related diseases. Health
Organization, more than ten million
people die from heart disease each year.
A healthy lifestyle and early detection
are the only ways to prevent heart-
related diseases. The work proposed in
this paper focuses on the various data
mining practices used to predict heart
disease. The human heart is a one of the
disease in the today's world, heart disease
is one of the major causes of death.
Heart disease can be caused by an
unhealthy lifestyle, smoking, alcohol
and high fat diets that can cause
high blood pressure. According to the
World body. Any heart failure can cause
stress in other parts of the body. Any
type of disturbance in the normal
functioning of the heart can be classified
as heart disease.
Heart disease is a prevalent health problem
and a leading cause of death worldwide.
Predicting the risk of developing heart
disease is essential for early detection and
effective prevention. Machine learning has
shown great potential in this area, as it can
analyze large amounts of data and identify
complex patterns that may be difficult for
humans to detect.
LITERATURE REVIEW
Important work has been done to
prognosticate heart complaint using the UCI
Machine Learning database. Different
situations of delicacy are achieved using the
colorful data mining styles described as
follows. Avinash Golande et.al.; reads
colorful ML algorithms that can be used to
separate heart complaint. Research was
conducted to study the Decision Tree, KNN
and K- Means algorithms that could be used
for bracket and its delicacy was compared.
The study concluded that the delicacy
attained by the Decision Tree was veritably
high and it was allowed that it could be made
more effective by combining different ways
with parameter tuning. , etal. have proposed a
program that uses data mining ways and the
MapReduce algorithm. The delicacy attained
according to this paper in the 45 cases of the
test set, was lesser than the delicacy attained
using a standard non-standard neural network.
Then, the delicacy of the algorithm used has
been bettered due to the use of flexible
schema and line dimension. Fahd Saleh
Alotaibi designed an ML model that
compares five different algorithms. Rapid
Miner tool used which has redounded in
advanced delicacy compared to the Matlab
and Faka tool. In this study the delicacy of
Decision Tree, Resettlement, Random Forest,
Naïve Bayes and SVM bracket algorithms
are similar. The decision tree algorithm has
the loftiest delicacy.
Techniques to separate the database and
the AES (Advanced Encryption
Standard) data transfer algorithm for
secure data prediction. Theresa Princy.
R, etal, conducted a study that included
a separate classification algorithm used
to predict heart disease. The
classification strategies used were Naive
Bayes, KNN (K Close Neighborhood),
decision tree, Neural network and the
accuracy of the dividers were
anatomized by a different number of
attributes. Nagaraj M Lutimath, etal.,
Made a vaticination for heart
complaint using Naïve bayes bracket
and SVM( Support Vector Machine).
Performance measures used in the
analysis of Mean Absolute Error, Total
Error Square and Root Mean Squared
Error, set up that SVM surfaced as a
much advanced algorithm with delicacy
than Naive Bayes. The main idea behind
the proposed system after reviewing the
below papers was to produce a heart
rate vaticination system grounded on
inputs . We anatomized the Algorithms
of Decision Tree, Random Forest,
Logistic Regression and Naive Bayes
grounded on Accuracy, Accuracy,
Flashing back and Conditions of f and
linked the stylish bracket algorithm that
can be used in prognosticating heart
complaint.
PROPOSED MODEL
The proposed work predicts heart
disease by examining the four
distinctive algorithms mentioned above
and performing a performance analysis.
The purpose of this study was to
successfully predict whether a patient
had a heart condition. The health
professional incorporates incoming
values from the patient's health report.
Data are entered into a model that
predicts the risk of heart disease. Figure
1 shows the whole process involved.
There are several proposed models for heart
disease prediction using machine learning,
and the choice of model depends on the
specific requirements and constraints of the
application. However, a commonly used
approach involves the following steps:
Data collection and pre-processing: This
involves gathering relevant patient data, such
as demographics, medical history, lifestyle
factors, and diagnostic test results. The data is
then pre processed to remove any irrelevant or
missing information and normalized to ensure
consistency.
Feature selection and engineering: This step
involves identifying the most relevant
features or variables that are predictive of
heart disease and engineering new features
based on domain knowledge. Feature
selection can help reduce the dimensionality
of the data and improve the performance of
the model.
Model selection and training: This involves
selecting an appropriate machine learning
algorithm based on the characteristics of the
data and training the model on a subset of the
data. Commonly used algorithms for heart
disease prediction include decision trees,
logistic regression, support vector machines,
and artificial neural networks.
Model evaluation and validation: This step
involves evaluating the performance of the
model using metrics such as accuracy,
precision, recall, and F1 score. The model is
then validated using a separate data set to
ensure that it generalizes well to new data.
A. Data Collection and Preprocessing
The database used was the Heart Database
which is a combination of 4 different
databases, but only the UCI Cleveland
database was used. This site contains a total
of 76 attributes but all published tests refer
to using a set with only 14 features [9].
Therefore, we have used the UCI Cleveland
database that we have reviewed available on
the Kaggle website for analysis. A full
description of the 14 symbols used in the
proposed activity is listed in Table 1 shown
below.
Pre-processing of data for making any machine
learning model is primary step. originally, data
may not be clean or in the needed format for
The model which can beget deceiving issues. Inpre
-processing of data, we transfigure data into
our needed format. It's used to deal with noises,
duplicates, and missing values of the dataset.
B. Classification
The attributes stated in Table 1 are handed as
input to the different ML algorithms
analogous as Random Forest, Decision Tree,
Logistic Retrogression and Naive Bayes type
ways. The input dataset is resolve into 80 of
the training dataset and the residual 20 into
the test dataset. Testing dataset is used to
check the donation of the trained model. For
each of the algorithms the donation is
reckoned and analyzed predicated on
different criteria used analogous as delicacy,
perfection, recall and F- measure scores as
described further. The different algorithms
explored in this paper are listed as below .
Random Forest
Random Forest algorithms are used for
editing and recovery. It creates a data tree
and makes prognostications predicated on
that. The Random Forest algorithm can be
used on large databases and can produce the
same result indeed if large set record values
are not available. Samples generated from
the decision tree can be saved for use in
other data. In a arbitrary timber there are two
stages, first produce a arbitrary timber and
also make a prophecy using arbitrary timber
planning created in the first phase.
Decision Tree
The Decision Tree algorithm is a type of flow
chart where the internal node represents the
data set attributes and the external branches
are the result. Decision Tree is chosen because
it is fast, reliable, easy to define and very little
data adjustment is required. In Decision Tree,
the class label prediction comes from the root
of the tree. The root attribute value is
compared to the record attribute. In the
comparison result, the corresponding branch is
tracked to that number and the jump is
performed to the next node.
Logistic Regression
Logistic Regression is a split algorithm that
is widely used in binary split problems. In
an asset relocation instead of a straight line
or a high plane, the asset back algorithm
uses a moving function to compress the
output of the line number between 0 and 1.
There are 13 independent variants that make
the movement of the movement ideal for
separation.
Naive Bayes
The Naive Bayes algorithm is based on
Bayes law. Independence among databases
is the main and most important guess in
making a distinction. It is easier and faster to
predict and hold better when independent
guesses are in place. Bayes theory calculates
the rear opportunities for event (A) by
providing specific pre-event opportunities
for event B represented by P (A / B) [10] as
shown in equation 1:
P(A|B) = (P(B|A) P(A)) / P(B)
RESULT AND ANALYSIS
Results Attained through Random Forest,
Decision Tree, Naive Bayes and Logistic
Regression are shown in this section. Metrics
are used to dissect the performance of the
algorithm points for Accuracy, Accuracy( P),
Recall( R) and F- measure. The
delicacy( appertained to in equation( 2)) metric
provides a fairly accurate analysis. Flashing
back( appertained to in measure( 3)) describes
the rate of factual positive values. The F
rate( mentioned in measure( 4)) for delicacy
testing.
Precision = (TP) / (TP +FP ) (2)
Recall = (TP) / (TP+FN) (3)
F– Measure =(2 * Precision * Recall) /
(Precision +Recall) (4)
In the test the previously analyzed data is used
to perform the tests and the below- mentioned
algorithms are tested and used. The performance
criteria mentioned over are attained using the
confusion matrix. The calculation done on
matrix will describe the performance of sample.
Logistic Model Tree, and Random Forest
algorithm to develop a system for accurate heart
disease prediction. In this we use tool weka for
implementation purpose. A data set of 303
records of heart patients has been taken from
Cleveland database of UCI repository to train
and test the system. To evaluate the system 10-
fold cross validation technique is used for
model training and testing. Algorithms are
analyzed generally on the basis of three
parameters viz. sensitivity (The sensitivity is
proportion of positive instances that are
correctly classified as positive), specificity
(The specificity is the proportion of negative
instances that are correctly classified as
negative), and the accuracy (The accuracy is
the proportion of instances that are correctly
classified). CONCLUSION
Naïve Bayes, J48, and Artificial Neural With the growing number of deaths due to heart
Network( ANN) to achieve stylish delicacy in complaint, it's imperative that an effective and
heart complaint vaticination for manly cases. A accurate cardiovascular vaticination system be
dataset of 210 records with 8 attributes has been developed. The end of the study was to find the
used in this trial. In order to carry out trials and most effective ML algorithm for diagnosing
executions WEKA was used as the data mining heart complaint. This study compares the
tool. From the trials relative results has been delicacy scores of Decision Tree, Holdback,
drawn in table 8 and from the relative result has Informal Forest and Naive Bayes heart
been set up that Naïve Bayes performed stylish predictor algorithms using a UCI machine
as compared to J48 and ANN to prognosticate learning database database. The results of this
heart complaint with an delicacy of79.9043 and study indicate that the Random Forest
takes lower time0.01 seconds to make a model. algorithm is the most effective algorithm
with90.16 delicacy in prognosticating heart
The confusion matrix attained from the
complaint. In the future the work can be
proposed model of different algorithms is
bettered by creating a web- grounded Random
shown below in Table. The delicacy academe Forest algorithm and using a larger database
set up in Random Forest, Decision Tree, compared to those used in this analysis that will
Logistic Retrogression and Naive Bayes type help give better results and help health
strategies are shown below in Table. professionals in prognosticating heart
complaint. effectively and efficiently.
REFERENCES Sayali Ambekar, Rashmi Phalnikar,
“Disease Risk Predict Through the
Avinash Golande, Pavan Kumar T, ”Heart Convolutional Neural Network”,
Disease Prediction Using Effective Machine Fourth International Conference
Learning Techniques”, International Journal on 2018Computer and Automated
of Recent Technology and Engineering, Vol 8, Communication Management.
pp.944-950,2019.
C. B. Rjeily, G. Badr, E. Hassani, A. H., and
T.Nagamani, S.Logeswari, B.Gomathy, ”Heart E. Andres, ―Medical Data Mining for Heart
Disease Prediction using Data Mining with Diseases and the Future of Successful
Mapreduce Algorithm”, International Journal of Mining in the Medical Sector, ‖ Machine
Innovative Technology and Exploring Learning Paradigms, 2019, pages 71–99.
Engineering (IJITEE) ISSN: 2278- 3075,
Volume-8 Issue-3, January 2019. Jafar Alzubi, Anand Nayyar, Akshi Kumar.
"Machine learning from Theory
Fahd Saleh Alotaibi, “Implementation of the to Algorithms: An
Machine Learning Model for Predicting Heart Overview", Journalof
Failure”, (JACSA) International Journal of Physics: Conference Series, 2018.
Advanced Computer Science and
Applications, Vol. 10, No. 6, 2019. Fajr Ibrahem Alarsan., And Mamoon
Younes 'Analysis and
Anjan Nikhil Repaka, Sai Deepak Ravikanti, Classification of
Ramya G Franklin, “Designing and Cardiovascular Diseases
Implementing Heart Disease Predict using Using Cardiovascular Features
Naives Bayesian”, International Conference and Machine Learning Methods',
on Trends in Electronics and Information Journal Of Big Data, 2019; 6:81
(ICOEI 2019).
Theresa Princy R, J. Thomas, ‘Human Heart
Disease Prediction System using Data Mining
Techniques’, International Conference on
Circuit Power and Computer Technology,
Bangalore, 2016.

Nagaraj M Lutimath, Chethan C, Basavaraj S

Pol., 'Predicting Heart Disease
Using Machine Learning', international
journal of Modern Technology and
Engineering, 8, (2S10), pp 474-477, 2019.

UCI, ―Heart Disease Data Set.[Online].

Available (Accessed on May 1 2020):
https://www.kaggle.com/ronitf/heart- disease-
uci.