BREAST CANCER CLASSIFIER USING MACHINE LEARNING
Abstract-Breast cancer is a fatal disease-causing
high mortality in women. Constant efforts are made
for creating more efficient techniques for early and
accurate diagnosis. The correct diagnosis of BC and
classification of patients into malignant or benign
groups is the subject of must research. BC dataset,
machine learning (ML) is widely recognized as the
methodology of choice in BC pattern classification
and forecast modelling. Classification and data
mining methods are an effective way to classify
data.
Keywords—Breast Cancer, Machine Learning,
Logistic Regression, K Neighbors Classifier, SVC
Linear.
I. INTRODUCTION
Breast cancer is one of the most lethal and
heterogeneous disease in this present era that causes
the death of enormous number of women all over the
world [1].
It is the second leading cause of death among women
worldwide [2]. Early detection is the best way to
increase the chance of treatment and survivability, [2]
as it can provide timely clinical treatments to patients.
Further accurate classification of benign tumors can
prevent patients undergoing unnecessary treatments.
There are various machine learning and data mining
algorithms that are being used for prediction of breast
cancer. Finding the most suitable and the most
appropriate algorithm for the prediction of breast
cancer is one of the important tasks [1]. Breast cancer
is the cancer that develops in breast cells.
Cancer occurs when changes called mutations take
place in genes that regulate cell growth. The mutations
let the cells divide and multiply in an uncontrolled
way. Typically, the cancer forms in either the lobules
or the duct of the breast. Lobules are the glands that
produce milk, and ducts are the pathways that bring the
milk from glands to the nipple. Cancer can also occur
in the fatty tissue or the fibrous connective tissue
within the breast.
The uncontrolled cancer cells often invade other
healthy breast tissue can travel to the lymph nodes
under the arms. The lymph nodes are a primary
pathway that help the cancer cells move to other parts
of the body.
Data mining is the process of discovering the useful
information from a big dataset, data mining techniques
and functions help to discover any kind of disease, data
XXX-X-XXXX-XXXX-X/XX/$XX.00 ©20XX IEEE
mining techniques such as machine learning, statistics,
database, fuzzy set, data warehouse and neural
network help in diagnosis and prognosis of different
cancer diseases [1]. Machine learning process is based
on the three main strategies that consists of
preprocessing, features selection or extraction and
classification. Feature extraction is the main part of
machine learning process and actually helps in
diagnosis and prognosis of cancer, this process can
elaborate the cancer set into benign and malignant
tumors [1].
II. MACHINE LEARNING ALGORITHMS
FOR BREAST CANCER PREDICTION
o Machine Learning is an automatic
learning method, is a branch of
artificial intelligence(AI) focused on
building applications that learn from
data and improve their accuracy over
time without being programmed to do
so.For breast cancer prediction,major
machine learning algorithms are as
follows:[1]
A. LOGISTIC REGRESSION(LR)
Logisti
c Regression is a supervised learning
classification algorithm used to predict the probability of a
target variable.
The nature of the target variable is dichotomous,
which means there would be only two possible classes. The
The dependent variable is binary in nature having
data coded as either 1(stands for success/yes) or 0
(stands for failure/no).
B. RANDOM FOREST
Random forest is a supervised learning algorithm
which is used for both classification as well as
regression. But, however, it is mainly used for
classification problems. Random forest algorithm creates
decision trees on data samples and then gets the
prediction from each of them and finally selects the best
solution by means of voting. It is an ensemble method
which is better than a single decision tree because it
reduces the over-fitting averaging the result.
C. DECISION TREE
Decision Tree algorithm belongs to the family of
supervised learning algorithms. The decision tree
algorithm can be used for solving regression and
classification problems. The goal of using a Decision
Tree is to create a training model that can be used to
predict the class or value of the target variable by
learning simple decision rules inferred from prior data
(training data).
D. K NEAREST NEIGHBOR
K-Nearest Neighbor is one of the simplest Machine
Learning algorithms based on Supervised Learning
technique. It can be used for Regression as well as
Classification but mostly used for Classification
problems. K-NN algorithm assumes the similarity
between the new data and available data into the
category that is most similar to the available
categories. This means when new data appears then it
can be easily classified into a well suite category by
using K-NN algorithm. It is also called a lazy learner
algorithm because it does not learn from training set
immediately instead it stores the dataset and at the time
of classification, it performs an action on the dataset.
E. SUPPORT VECTOR MACHINE
Support vector machines (SVMs) are powerful yet
flexible supervised machine learning algorithms which
are used both for Classification and Regression
problems. However, primarily, it is used for
Classification in Machine Learning. The goal of the
SVM algorithm is to create the best line or decision
boundary that can segregate n-dimensional space into
classes so that we can easily put the new data point in
the correct category in the future. This best decision
boundary is called a hyperplane. SVM chooses the
extreme points/vectors that help in creating the
hyperplane. These extreme cases are called as support
vectors, and hence algorithm is termed as Support
Vector Machine.
F. Proposed Methodology
Fig (1).Typical Machine Learning Process
The data used to build the final model usually
comes from multiple datasets. In particular, three
datasets are commonly used in different stages of the
creation of the model.
Training: The model is trained on the training
dataset using a supervised learning method. In
practice, the training dataset often consists of pairs of
an input vector (or scalar) and the corresponding
output vector (or scalar), where the answer key is
commonly denoted as the target (or label). The current
model is run with the training dataset and produces a
result, which is then compared with the target, for each
input vector is the training dataset. Based on the result
of the comparison and the specific learning algorithm
being used, the parameters of the model are adjusted.
The model fitting can include both variable selection
and parameter estimation.
Validation: Successively, the fitted model is used
to predict the response for the observations in the
second dataset called the validation dataset. The
validation dataset provides an unbiased evaluation of a
model fit on the training dataset while tuning the
model’s hyperparameters. The simple procedure is
complicated in practice by the fact that the validation
dataset’s error may fluctuate during training,
producing multiple local minima. This complication
has led to the creation of many ad-hoc rules for
deciding when overfitting has truly begun.
Testing : Finally, the test dataset is a dataset used
to provide an unbiased evaluation of a final model fit
on the training dataset. If the data in the test dataset has
never been used in training (for example in cross
validation), the test dataset is also called a holdout
dataset. The term “validation set” is sometimes used
instead of “test set” in some literature (e.g., if the
original dataset was partitioned into only two subsets,
the test set might be referred to as the validation set).
G. Pre-Processing Data
Data preprocessing is a process of preparing the
data and making it suitable or a machine learning
model. A real-world data generally contains noises,
missing values, and maybe in an unusable format
which cannot be directly used for machine learning
models. Data preprocessing is required tasks for
cleaning the data and making it suitable for a machine
learning model which also increases the accuracy and
efficiency of a machine learning model.
 o The Data Preprocessing involves the following
steps:
Phase-1 Get the Dataset
To create a machine learning model, the
first thing we required is a dataset as a machine
learning model completely works on data. The
collected data for a particular problem in a proper
format is known as dataset. To use the dataset in our,
we usually put I into a CSV file.
CSV stands for “Comma-Separated Values” files, it is
a file format which allows us to save the tabular such
as spreadsheets. It is usually for huge datasets and can
use these datasets in programs
Phase-2 Importing Libraries
●
In order to perform preprocessing using Python, we
need to import some predefined Python libraries.
These libraries are used to perform some specific
tasks. There are three specific libraries that we will use
for data preprocessing, which are:
⮚ 1.Numpy
Numpy Python library is used for including any type
of mathematical operation in a code. It is the
fundamental package for scientific calculation in
Python.
It also supports to add large, multidimensional arrays
and matrices.
⮚ 2. Matplotlib
The second library is matplotlib, which is a
Python 2D plotting library, and with this
library, we need to import a sub-library pyplot.
This library is used to plot any type of charts
in Python for the code.
Seaborn is a Python data visualization library
based on matplotlib.
⮚ 3.Pandas
The last library is the Pandas library, which is
one of the most famous Python Libraries and used for
importing and managing the datasets. It is an open-
source data manipulation and analysis library.
o Phase-3 Data Preparation
Data Preparation, where we load our data into a
suitable place and prepare it for use in our machine
learning training. We’ll first put all our data together,
and then randomize the ordering.
o Phase-4 Features Selection
In Machine Learning
●
and statistics, feature
selection, also known
as variable selection,
is the process of
selection a subset of
relevant features for
use in model
construction.
Data File and Feature Selection Cancer Wisconsin
(Diagnostic):-
Data Set from Kaggle repository. Our target parameter
is breast cancer diagnosis- Malignant or Benign. The
important features found by the study are:
Concave points worst, Area worst, Area se, Texture
worst, Texture mean, Smoothness worst, Smoothness
mean, Radius mean, Symmetry mean.
Attribute Information :
ID number
Diagnosis = (M= Malignant, B= Benign)
Phase-5 Handling Missing data
The next step of data preprocessing is to handle
missing data in the datasets. If our dataset contains
some missing data, then it may create a huge problem
for our machine learning model. Hence it is necessary
to handle missing values present in the dataset.
Phase-6 Encoding Categorical data
Categorical data are variables that contain label values
rather than numeric values. The number of possible
values is often limited to a fixed set. We will use Label
encoder to label the categorical data. Label Encoder is
the part of SciKit Learn library in Python and used to
convert categorical data, or text data, into numbers,
which our predictive models can better understand.
Phase-7 Splitting the Dataset into the Training set parameters. A confusion matrix including TP, FP, TN
and Test set and FN for actual data and predict data is formed to
evaluate the parameters [SPRING].
The data we use is usually split into training data and
test data. The training set contains a known output, and TP True Positive
the model learns on this data in order to be generalized TN True Negative
to other data later on. FP False Positive
FN False Negative
We have the test dataset (or subset) to test our model’s
prediction on this subset. The comparative study’s performance is evaluated by
We will do this using SciKit-Learn library in Python the following formulas:
using the train_test_split method.
1. Accuracy (Acc) – It represents the number of
correctly classified data instances over the
total number of data instances.
Phase-8 Feature Scaling
Accuracy (Acc) = (TP + TN)
Most of the times, your dataset will contain features (TP+TN+FP+FN)
highly varying in magnitudes, units and range. But
since, most of the machine learning algorithms use
Euclidian distance between two data points in their
computations. We need to bring all features to the 2. Precision (Prec) – It is the number of correct
same level of magnitudes. This can be achieved by positive results divided by the number of
scaling. positive results predicted by the classifier.

Phase-9 Model Selection Precision= TP

(TP + FP)
Supervised learning is the method in which the
machine is trained on the data which the input and 3. F1 score- F1 score is defined as the harmonic
output are well labelled. The model can learn on the mean between precision and sensitivity.
training data and can process the future data to predict
outcome. F1 score= 2TP
(2TP+FP+FN)
Supervised learning problems can be further grouped
into Regression and Classification problems
A Regression problem is when the output variables is a RESULTS AND DISCUSSION OF
real or continuous value. PROPOSED METHODOLOGY.
A Classification problem is when the output variable is
a category. 1. LOGISTIC REGRESSION

Unsupervised learning is giving away information to

the machine that is neither classified nor labelled and
allowing the algorithm to analyze the given
information without providing any directions. In
unsupervised learning algorithm the machine is trained
from the data which is not labelled or classified
making the algorithm to work without proper
instructions. In our dataset we have the outcome
variable or dependent variable i.e. Y having only two 2. KNEAREST NEIGHBORS
set of values, either M (Malignant) or B (Benign). So
Classification algorithm of supervised learning is
applied on it.

Performance Measure Parameters:

The performance of machine learning technique is

measured with respect to a few performance measure
 TABLE1.

METHODOLOGY ACCURACY PRECISION RECALL

LOGISTIC 96.14% 0.95 0.95

REGRESSION

KNEAREST 95.44% 0.96 0.96

3. DECISION TREE NEIGHBORS

DECISION TREE 92.63% 0.94 0.94

SVC LINEAR 96.84% 0.96 0.96

RANDOM 95.09% 0.97 0.97

FOREST
CLASSIFIER
4. SVC LINEAR

RELATED WORK
IN THIS SECTION, SOME OF THE RELATED WORKS
PREVIOUSLY DONE ON BREAST CANCER DIAGNOSIS
BY RESEARCHERS USING DIFFERENT MACHINE
LEARNING APPROACHES ARE DISCUSSED.[LT2]

5. RANDOM FOREST CLASSIFIER

1. Xin Yao [5], 1999 has attempted to implement
neural network for breast cancer diagnosis.
Negative correlation training algorithm was
used to decompose a problem automatically
and solve them. In this article the author has
discussed two approaches such as evolutionary
approach and ensemble approach, in which
evolutionary approach can be used to design
compact neural network automatically. The
ensemble approach was aimed to tackle large
problems but it was in progress.
COMPARISON BETWEEN ALL THE 2. Chih-Lin Chi [5] , 2007 have presented an
FIVE MACHINE LEARNING article on survival analysis of breast cancer on
TECHNIQUES. two breast cancer datasets. This article applies
an Artificial Neural Networks (ANNs) to the
survival analysis problem. Because ANNs can
easily consider variable interactions and create
a non-linear prediction model, they offer more
flexible prediction of survival time than
traditional methods. This study compares
ANN results on two different breast cancer
datasets, both of which use nuclear
morphometric features. The results show that
ANNs can successfully predict recurrence
 probability and separate patients with good
and bad prognosis.
3. Ahmad [3], compared the performance of
decision tree (C4.5), SVM, and ANN. The
dataset used was obtained from the Iranian
center for breast cancer. Simulation results
showed that SVM was the best classifier
followed by ANN and decision tree.
4. Nematzadeh [3], conducted a comparative
study on decision tree, NB, NN and SVM with
three different kernel functions as classifiers to
classify WPBC and Wisconsin Breast Cancer
(WBC). The experimental result showed that
NN (10-fold) had the highest accuracy of
98.09% in WBC dataset, while SVM-RBF
(10-fold) had the highest accuracy of 98.32%
in WPBC dataset.
5. Yue. [4] mainly demonstrated comprehensive
reviews on SVM, K-NNs, ANNs, and
Decision Tree techniques in the application of
predicting breast cancer on benchmark
Wisconsin Breast Cancer Diagnosis (WBCD)
dataset. According to the authors, deep belief
networks (DBNs) approach with ANN
architecture (DBNs-ANNs) has given the more
accurate result. This architecture obtained
99.68% accuracy, whereas for the SVM
method, the two-step clustering algorithm
alongside the SVM technique has achieved
99.10% classification accuracy. They also
reviewed the ensemble technique where SVM,
Naive Bayes, and J48 were implemented using
the voting technique. The ensemble method
acquired 97.13% accuracy.
6. Sakri. [4] focused on the enhancement of the
accuracy value using a feature selection
algorithm named as particle swarm
optimization (PSO) along with machine
learning algorithms K-NNs, Naive Bayes (NB)
and reduced error pruning (REP) tree. Their
work perspective holds the Saudi Arabian
women’s breast cancer problem, and according
to their report, it is one of the major problems
in Saudi Arabia.
Conclusion:
Breast cancer is considered to be one of the
significant causes of death in women. Early detection
of breast cancer plays an essential role to save
women’s life. Breast cancer detection can be done with
the help of modern machine learning algorithms.
This paper presented a comparative study of five
machine learning techniques for the prediction of
breast cancer, namely Logistic Regression, K Nearest
Neighbors, Decision Tree, Support vector machine,
Random Forest Classifier. The basic features and
working principle of each of the five machine learning
techniques were illustrated. The highest accuracy
obtained by SVC LINEAR is 96.84% whereas the
lowest accuracy derived from the DECISION TREE is
92.63%. The diagnosis procedure in the medical field
is very expensive as well as time-consuming. The
system proposed that machine learning technique can
be acted as a clinical assistant for the diagnosis of
breast cancer and will be very helpful for new doctors
or physicians in case of misdiagnosis. From the study,
we can conclude that machine learning techniques are
able to detect the disease automatically with high
accuracy.
REFERENCES
1. PREDICTION OF BREAST
CANCER,COMPARATIVE REVIEW OF
MACHINE LEARNING TECHNIQUES,AND THEIR
ANALYSIS
NOREEN FATIMA 1, LI LIU 1, SHA HONG1, AND
HAROON AHMED 2,
(Student Member, IEEE)1School of Big Data and
Software Engineering, Chongqin University,
Chongqing 400044, China2School of Microelectronics
and Communication Engineering, Chongqing
University, Chongqing 400044, China
2. Analysis of Breast Cancer Detection Using
Different Machine Learning Techniques.
Siham A. Mohammed
Sadeq Darrab
Salah A. Noaman
Gunter Saake
⮚
⮚
3. “Machine Learning Classification Techniques
for Breast Cancer Diagnosis.”David A.
Omondiagbe 1 , Shanmugam Veeramani 1*,
Amandeep S. Sidhu 2 1- Curtin University,
Malaysia, CDT 250, Miri 98009, Sarawak,
Malaysia 2- Curtin University, Kent St,
Bentley WA 6102, Australia.
4. “Breast Cancer Prediction: A Comparative
Study Using Machine Learning Techniques.”
● Md. Milon Islam,
● Md. Rezwanul Haque,
● Hasib Iqbal,
● Md. Munirul Hasan,
● Mahmudul Hasan &
● Muhammad Nomani Kabir
5. BREAST CANCER DIAGNOSIS USING
MACHINE LEARNING ALGORITHMS –A
SURVEY B.M.Gayathri. 1 ,C.P.Sumathi2 and
T.Santhanam3 1Department of Computer
Science, SDNB Vaishnav College for Women,
Chennai, India gayathri_bm2003@yahoo.co.in
2Department of Computer Science, SDNB
Vaishnav College for Women, Chennai, India
drcpsumathi@gmail.com 3Department of
Computer Application, D.G.Vaishnav College
for Men, Arumbakkam, Chennai, India