2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
An improved comparative model for chronic
kidney disease (CKD) prediction
Inayatullah1
Department of Software Engineering
University of Engineering and
Technology Taxila
Taxila, Pakistan
2020 14th International Conference on Open Source Systems and Technologies (ICOSST) | 978-1-7281-9050-1/20/$31.00 ©2020 IEEE | DOI: 10.1109/ICOSST51357.2020.9333097
inayat.ullah@students.uettaxila.edu.pk
Abstract—This paper exploit machine learning (ML) technique
to find and diagnose chronic kidney disease (CKD) at mild
damaged stage. Kidney disease are syndromes that cause the
functions and Glomerular filtration rate (GFR) of the kidney.
Nephrologist caution that the ratio of patients affected by CKD
are significantly increasing. More precise Data mining and ML
methods are required to predict and diagnose CKD successfully.
In this paper we apply different ML classification procedures on
a data set obtained from UCI repository which comprise of 400
instances, 24 features and binary classification labels. The 7-fold
and 10-fold cross-validation procedures are applied on dataset
to evaluate the model. The most familiar ML classification
algorithms are included in this paper are Random Forest (RF),
Discriminant Analysis (DA), Naive Bayes (NB), Support Vector
Machine (SVM), and K-Nearest Neighbor (K-NN). All the
experiments are performed in MATLAB tools. The statistical
results of all algorithms proved that RF performed better then
DA, NB, SVM, and K-NN with accuracies of 99.75%, 98.25%,
98%, 97%, and 92% respectively.
Keywords— Random Forest (RF), Support Vector Machine
(SVM), Discriminant Analysis (DA), Naïve Bayes (NB), K-
Nearest Neighbor (K-NN)
I. INTRODUCTION
Kidneys are organs in the body to stream blood and excrete
waste product from the body, also regulating the blood
pressure, boosting the production of red blood cells. Kidney
disease are syndromes that cause the functions and
glomerular filtration rate (GFR) of the kidney. The Estimated
Glomerular Filtration rate eGFR has five stages. The eGFR
1st stage is in mild kidney damage stage which eGFR ≥ 90
𝑚𝐿⁄𝑚𝑖𝑛 ⁄1.73𝑚2 . The 2nd, 3rd, and 4th stages eGFR is
between 60-89, 30-59, 15-29 𝑚𝐿⁄𝑚𝑖𝑛 ⁄1.73𝑚2 respectively.
The 5th stage eGFR is near to failure or failed stage which
eGFR<15 𝑚𝐿⁄𝑚𝑖𝑛 ⁄1.73𝑚2 . Nephrologists instigate about
the rapid growing kidney disease is due to the high blood
pressure, diabetes, poor sleeping, heart disease, hepatitis C,
ingesting junk food and self-medication. According to the
expert of kidney transplant unit in Pakistan Institute of
Medical Sciences (PIMS), reported in 2019 that 17 million
people suffering from kidney diseases. Hypertension and
978-1-7281-9050-1/20/$31.00 ©2020 IEEE
Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
Huma Qayyum2
Department of Software Engineering
University of Engineering and
Technology Taxila
Taxila, Pakistan
huma.ayub@uettaxila.edu.pk
diabetes are risks influences for CKD and its global
prevalence [1] in adults is 6.4% in 2000 with most cases in
developed countries and likely to be increase 7.7% by 2030
and 26%(972millions) which will be increased to 1.56 billion
by 2025 correspondingly. In diagnosis of CKD predicting
outcomes of patients remain significant for researchers,
individuals, medical, and health care systems. For this
purpose, machine learning algorithms performed an
important rule and applied it to predict chronic kidney
diseases. RF, DA, KNN, SVM, and NB are familiar machine
learning (ML) techniques which assist in classification
problems. These ML techniques are excellent importance in
health care, weather prediction, digital image processing,
stock exchange market analysis. In this paper the above five
techniques are used to classify CKD. The RF give maximum
accuracy 99.75% as compared to other techniques. The
detailed description of these techniques is given in section III.
II. REVIEW OF RELATED WORK
Qing-Guo Wang and Adeola Ogunleye proposed
enhanced Extreme Gradient Boosting (XGBoost) method [2],
with features selection techniques to diagnosis CKD
accurately on time. Dataset raw data are pre-processed and
applied spot-checking ML procedures to rapidly discover
algorithm that perform will. Fuzhe Ma et al. [3] introduced
HMANN model for the early diagnosis of CKD on internet of
medical things (IoMT). The chronic renal disease detection,
segmentation and diagnosis process take place on come in for
raw image. In this technique the irregularity of the kidney can
be checked by segment the kidney area in image and extracts
features from the image. In study [4] the nested ensemble ML
methodology are used to predict patient of breast cancer, for
benign and malignant categories utilizing the Wisconsin
diagnostic breast cancer (WDBC) dataset. In ref. [5], Murat
Koklu and Kemal Tutuncu used most known methods, such
as SVM ,Naïve Bayes, multilayer perceptron and C4.5 for
classification of CKD. By comparing the results of these
algorithms, multilayer perceptron has highest accuracy. In
this study the perceptron algorithm is used for supervised
learning of binary classifiers to decide whether the disease is
CKD or not CKD. Shu Lih Oh, U.Raghavendra et al [6]
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
proposed convolutional neural network (CNN) for parkinson
disease (PD) using Electroencephalogram (EEG) signals.
These signals are usually used to diagnose abnormality in
brain. The proposed CNN network processed on training data,
and model testing. CNN is a type of deep neural networks. It
is experienced that more connected and deeper the network,
the better will be the learning ability, which give the more
accurate results. In a research study [7], authors Hanyu
Zhang, Che-lung Hung et al also used ANN algorithm to
predict CKD survival. Two ANN network models are built,
one is a classical Multilayer perceptron (MLPs) and the other
is integrating LASSO features selection which enhanced the
prediction accuracy by variable selection and regularization
parameters. The LASSO operator is applied in the hidden
layers which automatically pick out the relevant attributes.
The results of this model are good, but the recall and
sensitivity remained inadequate as equated to other models.
The current ML procedures like SVM, NN, DT, regression,
and NB etc. classifiers are applied in different combination on
a dataset to predict disease on time. In this method
ensembling [8] techniques like bagging etc. are used on a
dataset to predict heart disease accurately. Ensembling
technique majority voting used combination of different
algorithms. These techniques can be applied on CKD by
using the kidney disease dataset to predict CKD. In another
study [9] authors predict CKD by using Naïve Bayes, SMO
and J48 as a classification algorithms. From results of these
algorithms J48 give better result. The deep ANN [10]
technique used and compared with other techniques like
SVM, Random forest etc. to analyse CKD. From results it had
been demonstrated that deep neural network has maximum
accuracy 97% as compared to other models. Quan Zou,
Kaiyang Qu et al [11] worked on Diabetes mellitus (DM)
chronic disease. Quan Zou, Kaiyang Qu et al used NN, DT,
and RF ML procedures to predict DM disease. In this study a
dataset of 14 features and 164431 records are used. Decision
tree are implemented in weka tools and neural network
implemented in matlab tools due to its dissimilar features.
Experimental results showed that using principal component
analysis (PCA) give poor results and using all features with
minimum redundancy maximum relevance (mRMR) give
improved results. In Ref. [12] authors outlook and precautions
that most of the models for predicting of the CKD are not
assessable for researchers, clinicians and practitioners, so this
is why conclusion making and resource allocation for the
risky CKD are thought-provoking. They suggested that there
are desired of a model that clinical intuition for CKD
prediction, also the potential of initial prognosis of the disease
and abilities for the risky decision for rehabilitation. The
medical decision support systems (MDSSs) [13] usages are
increasing with time. Expert systems are used in management
of CKD due to some pros in overcoming the complication in
medical data. In CKD, the expert system has three main
applications, like prediction, classification of different stages
of CKD, and modelling the kidney transplantation
surveillances. Inference engine and knowledge base sub
systems make the expert systems. The knowledge base
comprises the rules which uses by the inference engine for
new facts. Diagnosis of the disease by using the expert
978-1-7281-9050-1/20/$31.00 ©2020 IEEE
Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
system, there are required electronic medical record about the
patient [14]. The electronic record of the patient is formed by
medical experts in a healthcare institution like hospital. This
digital record of patient makes the diagnosis process of the
disease easy and precise. Data mining techniques operate in
two concepts’ .i.e. predictive and descriptive models [15].
Predictive model is a supervise learning function which train
from data to predict unknown data label, while descriptive
model is an unsupervised learning technique which assign
unlabelled data to a cluster. In other words the supervise
learning task for regression [16], categorization and
classification while some techniques worked for clustering
[17], correlation analysis, and association. In this era the
advancement of the technologies is rapidly developing for the
health care sector. These innovations make the healthcare
problems easy and more secure in term of individual life risk.
III. PROPOSED TECHNIQUES DESCRIPTION
The five ML techniques proposed in this paper are SVM, DA,
NB, RF and KNN. The data flow diagram (DFD) and
explanation of the five procedures are presented below.
Raw Dada
Data Pre-Processing
10-fold Cross Testing Data
Training Data
Validation of (10%)
(90%)
Dataset
Classification Algorithms
Trained Model
Prediction
Evaluation Metrics or
parameters
Results: in term percent
Accuracy, Precision,
Recall, F1-score
Fig. 1 Data Flow Diagram
A. Random Forest(RF)
1) Overview
RF is a type of ensembling classifiers, which are use
decision trees structure algorithm in a randomized fashion. It
is applied on regression and multiclass categorization
problems. In machine learning methodology, random forest
algorithm generates decision trees and make prediction on a
data samples which finally decide the best solution by
majority voting. The random forest (RF) algorithm was
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
created by a computer scientist Tim Kam Ho [18] in 1995. In I. Training phase
Fig. 2 multiple random datasets (RD1, RD2, RD3, … RDn) • For d = 1 to D (where D is the number of decision trees in
are created in randomize fashion from original dataset (OD). RF) Bootstrapping 𝐿∗ sample of size n (from OD)
• Create trees 𝐷𝑏 from the bootstrap samples
In 2nd step random datasets are used to build multiple decision
• Repeat the following steps for each terminal node of trees
trees. In 3rd step combined all decision trees and make result 𝐷𝑏 until the minimum node size N reached
of the test instances based on majority voting or averaging to i. Select X attributes randomly out of Y attributes
assign the test instance to a specific class. ii. Select the best split up point p out of X
2) Technical description iii. Make split up point into farther binary daughter points
In general a Random Forest (RF) split-up into the iv. Repeat the above three steps until N nodes or split generate
following hierarchical segments [19] (see Fig. 2). v. Repeat the above for D number of trees
II. Testing phase
a) Training Data
• In testing phase make prediction on novel point 𝑥 ∗
In RF training data is in fact the original dataset (OD) 1. Case: For regression problems take average of all the
which contain some attributes and one target or label attribute output trees.
which work as a binary classification based on other attributes 1
𝑅𝐹𝑟 = ∑𝐷𝑑=1 𝐷𝑏 (𝑥 ∗ )
𝐷
of the OD. Let 𝑌 ′ = {𝑦1, 𝑦2 , 𝑦3 , . . . , 𝑦𝑛 } be the training set for 2. Case: In classification problems take majority votes
class 𝐶𝑗 . The subsets of these training set are created in the for most voted class. Let 𝑀𝑣 (𝑥 ∗ ) are majority votes
for a class from the 𝐷𝑏 tress on novel point 𝑥 ∗.
bootstrapping process (see Fig. 2). 𝑅𝐹𝑐 = majority vote[𝑀𝑣 (𝑥 ∗ )]1𝐷
b) Bootstrapping:
Bootstrapping [20] is a statistical resampling procedure
which pick and choose instances randomly of the OD in order
to generate various distinct training set which is called
bootstrapping datasets (BD) or random datasets (RD). In BD,
the duplication of the instances is permitted, but it is better if
the frequency is minimal. Let 𝐿∗ = {𝑅𝐷1 , 𝑅𝐷2 , 𝑅𝐷3 , . . . , 𝑅𝐷𝑛 }
be the number of resampling from OD as shown in Fig. 2.
Then multiple decision trees can create from bootstrapping 𝐿∗ .
c) Decision tree:
Decision tree (DT) is a classification technique [21] for
samples. In RF technique, create multiple decision trees from
each subset of the OD. All DTs randomly select subset of the
variables and provide its prediction for the target label in OD.
Let 𝐷𝑏 = {𝐷𝑇1 , 𝐷𝑇2 , 𝐷𝑇3 , . . . , 𝑇𝐷𝑛 } be the number of decision
trees created from bootstrapping 𝐿∗ .
d) Majority voting:
The majority voting is a weighted procedure that combine the
predictions provided by multiple DTs in a RF. In this
procedure a tuple is associated with all DTs for the target label
on the base of majority voting. In case of classification
majority voting are applied as following.

𝑅𝐹𝑐 = majority vote[𝑀𝑣 (𝑥 ∗ )]1𝐷 (1)

Where 𝑀𝑣 (𝑥 ∗ ) is the majority votes for novel point 𝑥 ∗ to
consider most voted class for final prediction, and over-all
decision trees in RF is represented by D.
e) Bagging:
Bagging also known bootstrap aggregation [22] is an
ensemble meta-algorithm ML procedure, used to improve the
accuracy and decrease the misclassification error of the ML
algorithms. It is a specific case for model averaging. In case
of regression problem, the bagging or averaging of the total
number of decision trees are given as following.
Fig. 2 Random Forest
B. Discriminant Analysis (DA)
1) Overview
Discriminant Analysis (DA) is a procedure, devolved by
Sir Ronald Fisher in 1938 [23, 24], which allows the
researcher to examine the distinction between multiple
clusters of objects with respect to several variables
concurrently. The work of DA is to find a line that best
separates the data points into labels for the binary outcome.

1 2) Technical description
𝑅𝐹𝑟 = 𝐷 ∑𝐷 ∗
𝑑=1 𝐷𝑏 (𝑥 ) (2) a) Linear discriminant analysis (LDA):
LDA is a specialized type of dimensionality
𝐷𝑏 is the number of decision trees created from bootstrap. reduction of DA procedure, which is commonly used for the
f) RF Algorithm: classification problems as shown in Fig. 3. LDA try to expend
the separation of known label and shrink their within-label

978-1-7281-9050-1/20/$31.00 ©2020 IEEE

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
variability. The following steps applied in LDA (see Fig. 3). In
1st phase compute the split-up between the distinct labels. The
2nd step is to compute the gap among the examples and mean
of each label. In 3rd step is to find the lower dimension space
and expands between label variance and decreases the within
label variance. Here we need to minimize scatter within
classes and maximize scatter between classes.
b) Quadratic discriminant analysis (QDA):
QDA is also a statistical learning technique used for
classification of instances to a class like LDA. QDA assumed
that each label has its individual covariance matrix, rather
LDA assumes equal covariance matrix for every class.
Between the different label split-ups
Maximum distance between means and samples (with in class)
variance)
Fig. 3 Linear discriminant analysis
C. Naïve Bayes (NB)
1) Overview
The NB is probabilistic ML procedure, grounded on Bayes
theorem, which is used in classification problems. It is
particular occurrence of the Bayesian network, and a
classifier which work on bases of probability. In this
algorithm if change one feature value, does not change the
value of the other. This classifier used for high dimensional
dataset.
2) Technical description
The Naïve Bayes algorithm accept the existence of pre-
defined features in a specific class which are unrelated to the
existence of the other features. This take on that the features
values conditionally unbiased provided target value [25]. A
few initial steps are taken to build Naïve Bayes model in
mathematical form. 1st of all pre-defined features are given
for a specific class to be identify, in this study the CKD
features are given in a dataset for classes CKD and notCKD.
𝑃(𝛽 ⁄𝛼)𝑃(𝛼)
𝑃(𝛼 ⁄𝛽 ) = 𝑃(𝛽)
P(𝛽⁄𝑌) = P(𝛽1 , 𝛽2 , 𝛽3 , … 𝛽𝑛 ⁄𝑌)
= ∏𝑛𝑖=1 𝑃(𝛽𝑖 ⁄𝑌)
Where P(𝛼⁄𝛽 ) is Posterior probability of the target label c
specified forecaster feature β. Here 𝑃(𝛼) represent Prior
chance of labels, 𝑃(𝛽 ⁄𝛼 ) represent likelihood which give
chance of predictor given label and 𝑃(𝛽) is the prior
possibility of predictor. In 3rd step product of all features
values are find for each instances and choose the highest
probability value for a target value as shown in equation (4)
by Naïve Bayes assumption [26]. The features values give
decision on the highest probability value obtained from the
978-1-7281-9050-1/20/$31.00 ©2020 IEEE
Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
product of the feature’s values for any of two classes that is
disease predicted CKD or notCKD.
D. Support Vector Machine (SVM)
1) Overview
SVM is a supervised ML classifier for data regression and
organization complications. SVM is particularly applied on
binary classification tasks. In 1990s SVM [27] was presented
by Vladimir Vapnik, Cortes and Boser as a clustering
algorithm for unlabelled data. SVM have many real life usages
like, image classification, face recognition, text labelling,
meteorological conditions prediction, stock market analysis
and medical diagnosis [27]. The main operation of the SVM
is to distinct data on the bases of binary labelled, by a line
which getting the maximum distance between the classes
[28]. Almost maximum ML techniques have challenges due
to curse of dimensionality. This issue is occurred when there
are inadequate number of instances and limited experienced
from quite a few attributes. To some extent SVM model shrink
this problem [29]. In combination of distinct data, SVM
utilized the kernel function [30].
2) Technical description
The basic functionality of the SVM is to enhance the
prediction accuracy of the assumption. Some basic
perceptions which absolutely introduced the SVM are the
following [30].
a) Maximum margin hyperplane
Maximum margin hyperplane is the maximal gap
separation from hyperplane of both sides, to the adjacent
data points of both margins of the hyperplane. There can be
multiple options for hyperplane on separation a specific
data, but the hyperplane which give maximum labelled
instances separation is selected [30] which gives the
maximal margin as of both classes. The distance closest to
point which is fit to the upper (red circles) label and the
distance closest to the point which fit to the lower (blue
circles) label must be the same. The mathematical form of
these points are given by the equations bellow [31].
𝜓 ∙ 𝑥𝑖 + 𝜆 ≥ +1 when 𝑦𝑖 = +1 (5)
𝜓 ∙ 𝑥𝑖 + 𝜆 ≤ −1 when 𝑦𝑖 = -1 (6)
where 𝑥𝑖 are the points lie on the hyperplanes (support
vectors), when 𝑥𝑖 positive points are above the hyperplane
and vice versa when 𝑥𝑖 negative. Where 𝜓 is weight vector
which is perpendicular to the hyperplane and λ denote bias,
which is a specific parameter in SVM.
(3)
(4)
Fig. 4 maximal margin
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
b) Soft margin
On linear decision boundary some data points are miss-
classified. The Soft margin established to allow occasionally
miss-classified data points. In this missed classification, it
may be the anomaly of the dataset or the instances may
possibly be placed on false side of the hyperplane.
c) Kernel functions
The kernel functions [32] are used to projects data-
points as of low-dimensional space to higher dimension
space when the data-points are not in simple plane, but in a
complex higher dimension space, which cannot be separate
by simple method.
E. K-Nearest Neighbor (K-NN)
1) Overview
The K-NN is a ML technique which used for the
classification problems, to predict new samples in searching
the whole training set for the K-closest samples by distance
function. The K-NN is a data-points based learning
procedure. K-NN is a supervised ML technique which use
target variable or label dataset for unknown instances. In
classification the K values are the mode or most common
label values. In this algorithm the so-called distance measure
Euclidean function is used. In 1951 Hodges and Fix
introduced the K-NN algorithm as a non-parametric
technique for regression and pattern classification [33]. This
algorithm learning from historical data and new data points
would be put in a class which have maximal data points in
the closest neighbors.
Fig. 5 K-Nearest neighbor
2) Technical description
K-NN algorithm compute the gap between novel instance
and with neighbors of training examples. By the result of K
values the majority voting technique are applied to assign the
new instance to a target label. The mathematical form of the
algorithm for a query data Ǭi whose class is not categorized
can be find by the Euclidean distance method [34].
Dist(Ǭ𝑖 , 𝜌𝑖 )=√∑𝑛𝑖=1(Ǭ𝑖 − 𝜌𝑖 )2
Where 𝜌𝑖 = (𝜌1 , 𝜌2 , 𝜌3 ,…, 𝜌𝑛 ) are points in d-dimensional
space. The distance between query data Ǭi is calculated with
every point of train data set. The decision of the unknown
class instance Ǭi categorization are taken by sorting the
results of kth nearest data points with minimum distances in
978-1-7281-9050-1/20/$31.00 ©2020 IEEE
Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
the training data set. Used simple majority of the
classification of nearest neighbors as prediction value of the
query example.
a) Euclidean distance
The K-NN algorithm find the K nearest neighbors of
black square in the dark red and blue circles which are
examples of the two classes as shown in Fig. 5. In the given
figure we take k=3 points as nearest neighbors to the blue and
dark red circles using the Euclidean distance formula. The
predicted sample are assigning to the class which have
maximum nearest samples. In Fig. 5 dark red circle have two
and blue circle have one nearest neighbors to the black square.
In this case black square is assign to the dark red samples.
IV. THE EXPERIMENTAL STUDIES
In this part of the paper, we explain the conducted
experiments of this study. The statistical analysis and
comprehensive explanation of the dataset will be carrying out
in this section.
A. The dataset specification
The experimentation of this study was executed on the
CKD dataset, obtained from University of California, Irvine
(UCI) ML repository [35]. L.Jerline Rubini a research scholar
proposed this CKD dataset with three algorithms, like logistic
regression, radial based function network and multilayer
perceptron [36]. The dataset accumulated from 400 records
which consist of 24 features and one target label in binary
classification, which collected over a period of two-months.
This dataset consists of 13 nominal and 11 numerical features.
The target label work as a binary classification, either the
patient is CKD or not-CKD. The 250 features assign as a
CKD and 150 features assign as a not-CKD in around 63%
and 37% respectively. In this study we used the most relevant
features and condensed the dimension of the dataset to reduce
the computational power and to get maximum accuracy. The
statistical analysis and detailed description of the dataset is
given in study [37].
B. Experimental arrangement
The experiment was conducted to evaluate the five ML
techniques. The ML techniques were executed in MATLAB
R2017b environment using the CKD dataset. In this study 7-
fold and 10-fold cross-validation technique were applied to
partition the data into training and testing examples. Cross-
validation is also called rotation estimation [38] which process
the available data in several iteration for a single training
model. In 10-fold cross-validation the available data samples
are divided into 10 equal subsets. In 1st iteration the 1st subset
assign to test examples and the remaining nine subsets are
training examples. In the next iterations the tested subsets
examples would be not reassign for testing examples. It
implies that all examples would be considered in testing for
once. The accuracy of all conducted classifiers was analysed
(7) from confusion matrix. The accuracy results in TABLE IV
showed that 10-fold cross-validation give maximum accuracy
as compared to 7-fold cross-validation as shown in TABLE I.
V. RESULTS AND DISCUSSION
In this study we utilized five machine learning (ML)
techniques on CKD relevant dataset which is obtained from
UCI repository and compared all the results as shown in
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
TABLE IV. In this work each classifier gives different results. TABLE II. Confusion matrix values from 10-fold cross-validation
RF has the maximum classification accuracy 99.75% and it is
considered the superlative classification algorithm as Predicted CKD Predicted notCKD
S. Actual CKD TP FP
compared to DA, NB, SVM and KNN. In TABLE III the No
result of this study also compared to the previous models Actual notCKD FN TN
which give maximum performance as equated to prior. The 218 32
results of NB and DA are almost same, but with minor 1 KNN
difference, i.e. NB and DA correctly classified 392 and 393 0 150
instances out of 400, respectively. The results are measured in 247 3
the form of Precision, Recall, Accuracy, and F-score. The 2 NB
results of all models are obtained by using confusion matrix. 5 145
244 6
The statistical measured results and correct predictions of each
3 DA
classifier from confusion matrix are given in detailed in 1 149
TABLE II. 244 6
4 SVM
TABLE I. Different techniques Using 7-fold cross-validation 6 144
250 0
5 RF
S. F1- Accuracy 1 149
Models Precision Recall
No score %

Proposed Techniques Chart

1 K-NN 0.864 0.995 0.925 91.24
105
2 SVM 0.968 0.983 0.975 96.99
100
3 NB 0.972 0.956 0.963 95.50
Percentage (%)

95
4 DA 0.975 0.994 0.979 98.24
90
5 RF 1.00 0.995 0.997 99.74
85
A. Accuracy
As reported by the ISO 5725-1 [39] accuracy is the proximity 80
of trueness of a measurement results to the true value. K-NN SVM NB DA RF
(𝑇𝑃 + 𝑇𝑁 ) Precision% 87.2 97.6 98.8 97.6 100
𝐴𝑐𝑐𝑢𝑟𝑎𝑐𝑦 = (8)
(𝑇𝑃 + 𝑇𝑁 + 𝐹𝑃 + 𝐹𝑁 ) Recall% 100 97.6 98.01 99.59 99.6
F1-score% 93.16 97.6 98.40638 98.5858 99.7996
Here 𝑇𝑃 is the true positive. 𝑇𝑁 is the true negative. 𝐹𝑃 is the
false positive. 𝐹𝑁 is false negative. Accuracy% 92 97 98 98.25 99.75

B. Precision Techniques Data Table

The precision is the intensity of repeated measurement of Fig. 6 Statistical measures column plots of Model
equivalent results under unchanged conditions [40].
TABLE III. Random Forest Comparison with previous technique
𝑇𝑃
Precision = 𝑇 (9)
𝑃 + 𝐹𝑃 S. F1- Accuracy
Models Precision Recall
C. Recall No score %
The recall represent the fraction of the total number of actual 1 [2] 1.00 0.917 0.974 97.6%
positive cases that are accurately predicted positive [41].
𝑇𝑃 2 [4] 0.977 0.977 0.977 98.07%
Recall = 𝑇 (10)
𝑃 + 𝐹𝑁
3 [7] 0.904 0.844 0.872 97.01%
D. F1- score
4 [9] 0.99 0.99 0.99 99%
2∗(𝑃𝑟𝑒𝑐𝑖𝑠𝑖𝑜𝑛)∗(𝑅𝑒𝑐𝑎𝑙𝑙)
F1-score = (𝑃𝑟𝑒𝑐𝑖𝑠𝑖𝑜𝑛) + (𝑅𝑒𝑐𝑎𝑙𝑙)
(11)
5 [10] 1.00 0.925 0.976 97%
Here F1-score is also called F1-measure. The above equation Our
measures the accuracy of the test data. 6 1.00 0.996 0.998 99.75%
Model

978-1-7281-9050-1/20/$31.00 ©2020 IEEE

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
TABLE IV. Results of Different Methods Using Same Dataset (CKD) in MATLAB tools

Correctly Evaluation metrics

Time to build
S. Classified Weighted avg
model Accuracy%
No Classifiers Used instances out
Precision Recall F1-score
of 400
K-Nearest Neighbor
1 368 0.8720 1.0000 0.9316 1.005s 92%
(K-NN)
Support Vector
2 388 0.9760 0.9760 0.9760 0.977s 97%
Machine (SVM)
3 Naïve Bayes (NB) 392 0.9880 0.9801 0.9840 0.523s 98%
Discriminant
4 393 0.9760 0.9959 0.9859 0.471s 98.25%
Analysis (DA)
5 Random Forest (RF) 399 1.0000 0.9960 0.9980 5.611s 99.75%

[9] M. Arora and E. A. Sharma, "Chronic Kidney Disease Detection

VI. CONCLUSIONS
Numerous techniques have been used to predict CKD by using
different datasets and information as an input variable. In this
study we used the CKD dataset obtained from UCI repository.
RF, DA, NB, SVM and K-NN are the familiar ML techniques
used in this study. These techniques have some advantages in
different ML areas. The RF an ensembling technique for
binary classification are proposed in this paper as a prediction
model to accurately predict the CKD. The RF model classified
approximately all instances of the dataset. The dataset was
pre-processed by using the above techniques and used 10-fold
cross validation to split the training and testing dataset into
90% and 10% respectively. The evaluation metrics are used to
find the results of ML techniques used in this study. The
results proved that the performance of RF improved and give
maximum accuracy 99.75% as equated to other classifiers. In
future this method can be applied for other disease like covid-
19.
REFERENCES
[1] V. Jha, G. Garcia-Garcia, K. Iseki, Z. Li, S. Naicker, B. Plattner,
et al., "Chronic kidney disease: global dimension and
perspectives," The Lancet, vol. 382, pp. 260-272, 2013.
[2] A. Ogunleye and Q.-G. Wang, "Enhanced XGBoost-based
automatic diagnosis system for chronic kidney disease," in 2018
IEEE 14th International Conference on Control and Automation
(ICCA), 2018, pp. 805-810.
[3] F. Ma, T. Sun, L. Liu, and H. Jing, "Detection and diagnosis of
chronic kidney disease using deep learning-based heterogeneous
modified artificial neural network," Future Generation Computer
Systems, 2020.
[4] M. Abdar, M. Zomorodi-Moghadam, X. Zhou, R. Gururajan, X.
Tao, P. D. Barua, et al., "A new nested ensemble technique for
automated diagnosis of breast cancer," Pattern Recognition
Letters, vol. 132, pp. 123-131, 2020.
[5] M. Koklu and K. Tutuncu, "Classification of Chronic Kidney
Disease With Most Known data Mining Methods," Int. J. Adv.
Sci. Eng. Technol, vol. 5, pp. 14-18, 2017.
[6] S. L. Oh, Y. Hagiwara, U. Raghavendra, R. Yuvaraj, N.
Arunkumar, M. Murugappan, et al., "A deep learning approach
for Parkinson’s disease diagnosis from EEG signals," Neural
Computing and Applications, pp. 1-7, 2018.
[7] H. Zhang, C.-L. Hung, W. C.-C. Chu, P.-F. Chiu, and C. Y. Tang,
"Chronic kidney disease survival prediction with artificial neural
networks," in 2018 IEEE International Conference on
Bioinformatics and Biomedicine (BIBM), 2018, pp. 1351-1356.
[8] C. B. C. Latha and S. C. Jeeva, "Improving the accuracy of
prediction of heart disease risk based on ensemble classification
techniques," Informatics in Medicine Unlocked, vol. 16, p.
100203, 2019.
by Analyzing Medical Datasets in Weka," International Journal
of Computer Application, vol. 6, pp. 20-26, 2016.
[10] H. Kriplani, B. Patel, and S. Roy, "Prediction of chronic kidney
diseases using deep artificial neural network technique," in
Computer Aided Intervention and Diagnostics in Clinical and
Medical Images, ed: Springer, 2019, pp. 179-187.
[11] Q. Zou, K. Qu, Y. Luo, D. Yin, Y. Ju, and H. Tang, "Predicting
diabetes mellitus with machine learning techniques," Frontiers in
genetics, vol. 9, p. 515, 2018.
[12] M. J. Kadatz, E. S. Lee, and A. Levin, "Predicting progression in
CKD: perspectives and precautions," American Journal of
Kidney Diseases, vol. 67, pp. 779-786, 2016.
[13] A. Yadollahpour, "Applications of expert systems in
management of chronic kidney disease: a review of predicting
techniques," Oriental Journal of Computer Science and
Technology, vol. 7, pp. 306-315, 2014.
[14] J.-J. Yang, J. Li, J. Mulder, Y. Wang, S. Chen, H. Wu, et al.,
"Emerging information technologies for enhanced healthcare,"
Computers in industry, vol. 69, pp. 3-11, 2015.
[15] M. Kantardzic, Data mining: concepts, models, methods, and
algorithms: John Wiley & Sons, 2011.
[16] Z. Wu and C.-h. Li, "L0-constrained regression for data mining,"
in Pacific-Asia Conference on Knowledge Discovery and Data
Mining, 2007, pp. 981-988.
[17] P. Berkhin, "A survey of clustering data mining techniques," in
Grouping multidimensional data, ed: Springer, 2006, pp. 25-71.
[18] T. K. Ho, "Random decision forests," in Proceedings of 3rd
international conference on document analysis and recognition,
1995, pp. 278-282.
[19] A. Farrell, G. Wang, S. A. Rush, J. A. Martin, J. L. Belant, A. B.
Butler, et al., "Machine learning of large‐scale spatial
distributions of wild turkeys with high‐dimensional
environmental data," Ecology and evolution, vol. 9, pp. 5938-
5949, 2019.
[20] B. Efron, "Bootstrap methods: another look at the jackknife," in
Breakthroughs in statistics, ed: Springer, 1992, pp. 569-593.
[21] L. Rokach and O. Z. Maimon, Data mining with decision trees:
theory and applications vol. 69: World scientific, 2008.
[22] T. Hothorn and B. Lausen, "Double-bagging: combining
classifiers by bootstrap aggregation," Pattern Recognition, vol.
36, pp. 1303-1309, 2003.
[23] W. R. Klecka, G. R. Iversen, and W. R. Klecka, Discriminant
analysis vol. 19: Sage, 1980.
[24] S. B. Green and J. Neil, "Salkind. 2008. Using SPSS for Windows
and Macintosh: Analyzing and Understanding Data," ed: Upper
Saddle River, NJ: Pearson.
[25] T. M. Mitchell, "Machine learning," ed: McGraw-hill New York,
1997.
[26] C. Piech, "Logistic Regression," 2017.
[27] R. G. Brereton and G. R. Lloyd, "Support vector machines for
classification and regression," Analyst, vol. 135, pp. 230-267,
2010.
[28] T. S. Furey, N. Cristianini, N. Duffy, D. W. Bednarski, M.
Schummer, and D. Haussler, "Support vector machine
classification and validation of cancer tissue samples using
microarray expression data," Bioinformatics, vol. 16, pp. 906-
914, 2000.

978-1-7281-9050-1/20/$31.00 ©2020 IEEE

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.
 2020 14th International Conference on Open Source Systems and Technologies (ICOSST)
[29] L.-P. Ni, Z.-W. Ni, and Y.-Z. Gao, "Stock trend prediction based
on fractal feature selection and support vector machine," Expert
Systems with Applications, vol. 38, pp. 5569-5576, 2011.
[30] W. S. Noble, "What is a support vector machine?," Nature
biotechnology, vol. 24, pp. 1565-1567, 2006.
[31] C. Cortes and V. Vapnik, "Support-vector networks," Machine
learning, vol. 20, pp. 273-297, 1995.
[32] A. Patle and D. S. Chouhan, "SVM kernel functions for
classification," in 2013 International Conference on Advances in
Technology and Engineering (ICATE), 2013, pp. 1-9.
[33] N. S. Altman, "An introduction to kernel and nearest-neighbor
nonparametric regression," The American Statistician, vol. 46,
pp. 175-185, 1992.
[34] Q. Kuang and L. Zhao, "A practical GPU based kNN algorithm,"
in Proceedings. The 2009 International Symposium on Computer
Science and Computational Technology (ISCSCI 2009), 2009, p.
151.
[35] D. Dua and C. Graff, "UCI machine learning repository. School
of Information and Computer Science, University of California,
Irvine, CA," ed, 2019.
[36] L. J. Rubini and P. Eswaran, "Generating comparative analysis of
early stage prediction of Chronic Kidney Disease," International
Journal of Modern Engineering Research (IJMER), vol. 5, pp.
49-55, 2015.
[37] N. A. Almansour, H. F. Syed, N. R. Khayat, R. K. Altheeb, R. E.
Juri, J. Alhiyafi, et al., "Neural network and support vector
machine for the prediction of chronic kidney disease: A
comparative study," Computers in biology and medicine, vol.
109, pp. 101-111, 2019.
[38] S. Geisser, Predictive inference vol. 55: CRC press, 1993.
[39] I. ISO, "5725-1: 1994, Accuracy (trueness and precision) of
measurement methods and results-Part 1: General principles and
definitions," International Organization for Standardization,
Geneva, 1994.
[40] J. C. f. G. i. Metrology-JCGM, "JCGM 200: 2008. International
vocabulary of metrology: basic and general concepts and
associated terms (VIM)," ed: Working Group 2, France, 2008.
[41] D. M. Powers, "Evaluation: from precision, recall and F-measure
to ROC, informedness, markedness and correlation," 2011.

978-1-7281-9050-1/20/$31.00 ©2020 IEEE

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded on June 17,2021 at 02:28:36 UTC from IEEE Xplore. Restrictions apply.