Contents

ABSTRACT:............................................................................................. iv

Domain overview...........................................................1

1.1.2 ARTIFICIAL INTELLIGENCE.........................................2

1.1.3 NATURAL LANGUAGE PROCESSING (NLP):................5

1.1.4 MACHINE LEARNING.................................................6

1.2. OBJECTIVES..................................................................................... 7

1.2.1 PROJECT GOALS........................................................7

1.2.2 SCOPE OF THE PROJECT............................................8

2. EXISTING SYSTEM:...........................................................................8

2.1. DISADVANTAGES:........................................................................9

2.2 PROPOSED SYSTEM:........................................................................9

2.2.1 ADVANTAGES:...........................................................9

2.3. LITERATURE SURVEY:.....................................................................10

General........................................................................10

Review of Literature Survey.........................................11

3. FEASIBILITY STUDY:.......................................................................14

Data Wrangling............................................................14

Data collection.............................................................14

Preprocessing...............................................................14

Building the classification model.................................14

CONSTRUCTION OF A PREDICTIVE MODEL.......................................15

4. PROJECT REQUIREMENTS.........................................................16

4.1. General:............................................................16

4.1.2 Functional requirements:..................................17

4.1.3 Non-Functional Requirements:..........................17

i
 4.2. Environmental Requirements:...........................17

4.3. SOFTWARE DESCRIPTION..............................................................18

4.3.1 ANACONDA NAVIGATOR.........................................18

4.3.2.CONDA :.................................................................................. 21

4.3.3. JUPYTER NOTEBOOK...............................................................21

4.3.4 PYTHON........................................................................................ 26

5. SYSTEM DIAGRAMS........................................................................36

5.1.1. SYSTEM ARCHITECTURE.........................................................36

5.3. USE CASE DIAGRAM..................................................................38

5.4 CLASS DIAGRAM:......................................................................39

5.5 ACTIVITY DIAGRAM:..................................................................40

5.6 SEQUENCE DIAGRAM:..............................................................42

5.7 ENTITY RELATIONSHIP DIAGRAM (ERD)....................................43

6. LIST OF MODULES:........................................................................43

6.1 MODULE DESCRIPTION..................................................................44

6.1.1. DATA PRE-PROCESSING..........................................44

MODULE DIAGRAM...........................................................................46

6.1.2. DATA VALIDATION/ CLEANING/PREPARING PROCESS...............47

6.1.3. EXPLORATION DATA ANALYSIS OF VISUALIZATION..................47

MODULE DIAGRAM...........................................................................49

COMPARING ALGORITHM WITH PREDICTION IN THE FORM OF BEST

ACCURACY RESULT..................................................................50

PREDICTION RESULT BY ACCURACY:................................................51

General Formula:.........................................................53

F1-Score Formula:........................................................53

6.2. ALGORITHM AND TECHNIQUES......................................................53

6.2.1. ALGORITHM EXPLANATION.....................................53

MODULE DIAGRAM...........................................................................56
ii
 6.2.3. RANDOM FOREST CLASSIFIER.................................57

MODULE DIAGRAM...........................................................................59

6.2.4. DECISION TREE CLASSIFIER......................................................59

MODULE DIAGRAM...........................................................................61

6.2.5. NAIVE BAYES ALGORITHM:......................................62

MODULE DIAGRAM...........................................................................63

7. CODING AND OUTPUT SCREENS....................................................64

8. CONCLUSION................................................................................. 70

8.1 FUTURE WORK...............................................................................70

9. REFERENCES:................................................................................ 71

iii
 ABSTRACT:

A credit card is issued by a bank or financial services company that allows

cardholders to borrow funds with which to pay for goods and services with
merchants that accept cards for payment. Nowadays as everything is made
cyber so there is a chance of misuse of cards and the account holder can lose
the money so it is vital that credit card companies are able to identify fraudulent
credit card transactions so that customers are not charged for items that
they did not purchase. This type of problems can be solved through data
science by applying machine learning techniques. It deals with modelling of the
dataset using machine learning with Credit Card Fraud Detection. In machine
learning the main key is the data so modelling the past credit card transactions
with the data of the ones that turned out to be fraud. The built model is then
used to recognize whether a new transaction is fraudulent or not. The objective
is to classify whether the fraud had happened or not. The first step involves
analyzing and pre-processing data and then applying machine learning
algorithm on the credit card dataset and find the parameters of the algorithm
and calculate their performance metrics.

iv
1. INTRODUCTION

Domain overview

1.1 Data Science:

Data science is an interdisciplinary field that uses scientific

methods, processes, algorithms and systems to extract knowledge and
insights from structured and unstructured data, and apply knowledge and
actionable insights from data across a broad range of application domains.

The term "data science" has been traced back to 1974, when
Peter Naur proposed it as an alternative name for computer science. In
1996, the International Federation of Classification Societies became the
first conference to specifically feature data science as a topic. However,
the definition was still in flux.

The term ―data science‖ was first coined in 2008 by D.J. Patil, and
Jeff Hammerbacher, the pioneer leads of data and analytics efforts at
LinkedIn and Facebook. In less than a decade, it has become one of the
hottest and most trending professions in the market.

Data science is the field of study that combines domain expertise,

programming skills, and knowledge of mathematics and statistics to
extract meaningful insights from data.

Data science can be defined as a blend of mathematics, business

acumen, tools, algorithms and machine learning techniques, all of which
help us in finding out the hidden insights or patterns from raw data which
can be of major use in the formation of big business decisions.

Data Scientist:

1
 Data scientists examine which questions need answering and where
to find the related data. They have business acumen and analytical skills
as well as the ability to mine, clean, and present data. Businesses use
data scientists to source, manage, and analyze large amounts of
unstructured data.

Required Skills for a Data Scientist:

 Programming: Python, SQL, Scala, Java, R, MATLAB.

 Machine Learning: Natural Language Processing, Classification, Clustering.

 Data Visualization: Tableau, SAS, D3.js, Python, Java, R libraries.

 Big data platforms: MongoDB, Oracle, Microsoft Azure, Cloudera.

1.1.2 ARTIFICIAL INTELLIGENCE

Artificial intelligence (AI) refers to the simulation of human

intelligence in machines that are programmed to think like humans and
mimic their actions. The term may also be applied to any machine that
exhibits traits associated with a human mind such as learning and
problem-solving.

Artificial intelligence (AI) is intelligence demonstrated by machines,

as opposed to the natural intelligence displayed by humans or animals.
Leading AI textbooks define the field as the study of "intelligent agents"
any system that perceives its environment and takes actions that
maximize its chance of achieving its goals. Some popular accounts use
the term "artificial intelligence" to describe machines that mimic
"cognitive" functions that humans associate with the human mind, such as
"learning" and "problem solving", however this definition is rejected by
major AI researchers.

Artificial intelligence is the simulation of human intelligence

processes by machines, especially computer systems. Specific
applications of AI include expert systems, natural language processing,

2
speech recognition and machine vision.

AI applications include advanced web search engines,

recommendation systems (used by Youtube, Amazon and Netflix),
Understanding human speech (such as Siri or Alexa), self-driving cars
(e.g. Tesla), and competing at the

3
highest level in strategic game systems (such as chess and Go), As
machines become increasingly capable, tasks considered to require
"intelligence" are often removed from the definition of AI, a phenomenon
known as the AI effect. For instance, optical character recognition is
frequently excluded from things considered to be AI, having become a
routine technology.

Artificial intelligence was founded as an academic discipline in 1956,

and in the years since has experienced several waves of optimism,
followed by disappointment and the loss of funding (known as an "AI
winter"), followed by new approaches, success and renewed funding. AI
research has tried and discarded many different approaches during its
lifetime, including simulating the brain, modeling human problem
solving, formal logic, large databases of knowledge and imitating animal
behavior. In the first decades of the 21st century, highly mathematical
statistical machine learning has dominated the field, and this technique
has proved highly successful, helping to solve many challenging problems
throughout industry and academia.

The various sub-fields of AI research are centered around particular

goals and the use of particular tools. The traditional goals
of AI research include reasoning, knowledge representation, planning,
learning, natural language processing, perception and the ability to move
and manipulate objects. General intelligence (the ability to solve an
arbitrary problem) is among the field's long-term goals. To solve these
problems, AI researchers use versions of search and mathematical
optimization, formal logic, artificial neural networks, and methods based
on statistics, probability and economics. AI also draws upon computer
science, psychology, linguistics, philosophy, and many other fields.

The field was founded on the assumption that human intelligence

"can be so precisely described that a machine can be made to simulate
it". This raises philosophical arguments about the mind and the ethics of
creating artificial beings endowed with human-like intelligence.
These issues have been explored by myth, fiction and philosophy

4
since antiquity. Science fiction and futurology have also suggested that,
with its enormous potential and power, AI may become an existential
risk to humanity.

5
 As the hype around AI has accelerated, vendors have been
scrambling to promote how their products and services use AI. Often what
they refer to as AI is simply one component of AI, such as machine
learning. AI requires a foundation of specialized hardware and software for
writing and training machine learning algorithms. No one programming
language is synonymous with AI, but a few, including Python, R and Java,
are popular.

In general, AI systems work by ingesting large amounts of labeled

training data, analyzing the data for correlations and patterns, and using
these patterns to make predictions about future states. In this way, a
chatbot that is fed examples of text chats can learn to produce life like
exchanges with people, or an image recognition tool can learn to identify
and describe objects in images by reviewing millions of examples.

AI programming focuses on three cognitive skills: learning,

reasoning and self-correction.

Learning processes. This aspect of AI programming focuses on

acquiring data and creating rules for how to turn the data into actionable
information. The rules, which are called algorithms, provide computing
devices with step-by-step instructions for how to complete a specific task.

Reasoning processes. This aspect of AI programming focuses on

choosing the right algorithm to reach a desired outcome.

Self-correction processes. This aspect of AI programming is designed to

continually fine-tune algorithms and ensure they provide the most
accurate results possible.

AI is important because it can give enterprises insights into their

operations that they may not have been aware of previously and because,
in some cases, AI can perform tasks better than humans. Particularly
when it comes to repetitive, detail-oriented tasks like analyzing large
6
numbers of legal documents to ensure

7
relevant fields are filled in properly, AI tools often complete jobs quickly
and with relatively few errors.

Artificial neural networks and deep learning artificial intelligence

technologies are quickly evolving, primarily because AI processes large
amounts of data much faster and makes predictions more accurately than
humanly possible.

1.1.3 NATURAL LANGUAGE PROCESSING (NLP):

Natural language processing (NLP) allows machines to read and

understand human language. A sufficiently powerful natural language
processing system would enable natural-language user interfaces and the
acquisition of knowledge directly from human-written sources, such as
newswire texts. Some straightforward applications of natural language
processing include information retrieval, text mining, question answering
and machine translation. Many current approaches use word co-
occurrence frequencies to construct syntactic representations of text.
"Keyword spotting" strategies for search are popular and scalable but
dumb; a search query for "dog" might only match documents with the
literal word "dog" and miss a document with the word "poodle". "Lexical
affinity" strategies use the occurrence of words such as "accident" to
assess the sentiment of a document. Modern statistical NLP approaches
can combine all these strategies as well as others, and often achieve
acceptable accuracy at the page or paragraph level. Beyond semantic
NLP, the ultimate goal of "narrative" NLP is to embody a full
understanding of commonsense reasoning. By 2019, transformer-based
deep learning architectures could generate coherent text.

8
1.1.4 MACHINE LEARNING

Machine learning is to predict the future from past data. Machine

learning (ML) is a type of artificial intelligence (AI) that provides
computers with the ability to learn without being explicitly programmed.
Machine learning focuses on the development of Computer Programs that
can change when exposed to new data and the basics of Machine
Learning, implementation of a simple machine learning algorithm using
python. Process of training and prediction involves use of specialized
algorithms. It feed the training data to an algorithm, and the algorithm
uses this training data to give predictions on a new test data. Machine
learning can be roughly separated in to three categories. There are
supervised learning, unsupervised learning and reinforcement learning.
Supervised learning program is both given the input data and the
corresponding labeling to learn data has to be labeled by a human being
beforehand. Unsupervised learning is no labels. It provided to the learning
algorithm. This algorithm has to figure out the clustering of the input data.
Finally, Reinforcement learning dynamically interacts with its environment
and it receives positive or negative feedback to improve its performance.
Data scientists use many different kinds of machine learning
algorithms to discover patterns in python that lead to actionable insights.
At a high level, these different algorithms can be classified into two
groups based on the way they ―learn‖ about data to make predictions:
supervised and unsupervised learning. Classification is the process of
predicting the class of given data points. Classes are sometimes called as
targets/ labels or categories. Classification predictive modeling is the task
of approximating a mapping function from input variables(X) to discrete
output variables(y). In machine learning and statistics, classification is a
supervised learning approach in which the computer program learns from
the data input given to it and then uses this learning to classify new
observation. This data set may simply be bi- class (like identifying whether
the person is male or female or that the mail is spam or non-spam) or it
may be multi-class too. Some examples of classification problems are:

9
speech recognition, handwriting recognition, bio metric identification,
document classification etc.

10
 Supervised Machine Learning is the majority of practical machine
learning uses supervised learning. Supervised learning is where have
input variables (X) and an output variable (y) and use an algorithm to
learn the mapping function from the input to the output is y = f(X). The
goal is to approximate the mapping function so well that when you have
new input data (X) that you can predict the output variables
(y) for that data. Techniques of Supervised Machine Learning algorithms
include logistic regression, multi-class classification, Decision Trees and
support vector machines etc. Supervised learning requires that the data
used to train the algorithm is already labeled with correct answers.
Supervised learning problems can be further grouped into Classification
problems. This problem has as goal the construction of a succinct model
that can predict the value of the dependent attribute from the attribute
variables. The difference between the two tasks is the fact that the
dependent attribute is numerical for categorical for classification. A
classification model attempts to draw some conclusion from observed
values. Given one or more inputs a classification model will try to predict
the value of one or more outcomes. A classification problem is when the
output variable is a category, such as ―red‖ or
―blue‖.

1.2. OBJECTIVES

The goal is to develop a machine learning model for Credit Card Fraud
Prediction, to potentially replace the updatable supervised machine
learning classification models by predicting results in the form of best
accuracy by comparing supervised algorithm
11
1.2.1 PROJECT GOALS

12
  Exploration data analysis of variable identification
 Loading the given dataset
 Import required libraries packages
 Analyze the general properties
 Find duplicate and missing values
 Checking unique and count values
 Uni-variate data analysis
 Rename, add data and drop the data
 To specify data type
 Exploration data analysis of bi-variate and multi-variate
 Plot diagram of pairplot, heatmap, bar chart and Histogram
 Method of Outlier detection with feature engineering
 Pre-processing the given dataset
 Splitting the test and training dataset
 Comparing the Decision tree and Logistic regression model and
random forest etc.
 Comparing algorithm to predict the result
 Based on the best accuracy

.
1.2.2 SCOPE OF THE PROJECT
The main Scopeis to detect the Fraud Prediction, which is a classic text
classification problem with a help of machine learning algorithm. It is
needed to build a model that can differentiate between Fraud OR not

2. EXISTING SYSTEM:
They proposed a method and named it as Information-
Utilization- Method INUM it was first designed and the accuracy and
convergence of an information vector generated by INUM are analyzed.
The novelty of INUM is illustrated by comparing it with other methods. Two
D-vectors (i.e., feature subsets) a and b, where Ai is the ith feature in a
data set, are dissimilar in decision space, but correspond to the same

13
O-vector y in objective space. Assume that only a is

14
provided to decision-makers, but a becomes inapplicable due to an
accident or other reasons (e.g., difficulty to extract from the data set).
Then, decision-makers are in trouble. On the other hand, if all two feature
subsets are provided to them, they can have other choices to serve their
best interest. In other words, obtaining more equivalent D-vectors in the
decision space can provide more chances for decision- makers to ensure
that their interests are best served. Therefore, it is of great significance
and importance to solve MMOPs with a good Pareto front approximation
and also the largest number of D-vectors given each O-vector.

2.1. DISADVANTAGES:

1. They had proposed a mathematical model and machine learning

algorithms is not used
2. Class Imbalance problem was not addressed and the proper measure
were not taken

2.2 PROPOSED SYSTEM:

The proposed model is to build a classification model to classify

whether its fraud or not. The dataset of previous credit card cases are
collected where it is used to make the machine to learn about the
problem. The first step for involves the analysis of data where each and
every column is analyzed and the necessary measurements are taken for
missing values and other forms of data. Outliers and other values which
are not much impact is dealt. Then preprocessed data is used to build the
classification model where the data will be split into two parts one is for
training and remaining data for testing purpose. Machine learning
algorithms are applied on the training data where the model learns the
pattern from the data and the model will deal with test data or new data
and classify whether its fraud or not .The algorithms are compared and
the performance metric of the algorithms are calculated.

2.2.1 ADVANTAGES:

15
 Performance and accuracy of the algorithms can be calculated and
compared
 Class imbalance can be dealt with machine learning approaches

16
 BANK Dataset

Data Processing
Test
dataset

Classification ML Model
Training Algorithm
dataset

Architecture of Proposed model

2.3. LITERATURE SURVEY:

General
A literature review is a body of text that aims to review the critical
points of current knowledge on and/or methodological approaches to a
particular topic. It is secondary sources and discuss published information
in a particular subject area and sometimes information in a particular
subject area within a certain time period. Its ultimate goal is to bring the
reader up to date with current literature on a topic and forms the basis for
another goal, such as future research that may be needed in the area and
precedes a research proposal and may be just a simple summary of
sources. Usually, it has an organizational pattern and combines both
summary and synthesis.
A summary is a recap of important information about the source,
but a synthesis is a re-organization, reshuffling of information. It might
give a new interpretation of old material or combine new with old
interpretations or it might trace the intellectual progression of the field,
including major debates. Depending on the situation, the literature
review may evaluate the sources and advise the reader on the most
17
pertinent or relevant of them

18
Review of Literature Survey

Title : Credit Card Fraud Detection using Machine Learning: A

Systematic Literature Review
Author: Harish Paruchuri
Year : 2017

Companies want to give more and more facilities to their customers. One
of these facilities is the online mode of buying goods. The customers now
can buy the required goods online but this is also an opportunity for
criminals to do frauds. The criminals can theft the information of any
cardholder and use it for online purchases until the cardholder contacts
the bank to block the card. This paper shows the different algorithms of
machine learning that are used for detecting this kind of transaction. The
research shows the CCF is the major issue of financial sector that is
increasing with the passage of time. More and more companies are
moving towards the online mode that allows the customers to make
online transactions. This is an opportunity for criminals to theft the
information or cards of other persons to make online transactions. The
most popular techniques that are used to theft credit card information are
phishing and Trojan. So a fraud detection system is needed to detect such
activities.

Title : A Research on Credit Card Fraudulent Detection System

Author: Devika S P, Nisarga K S, Gagana P Rao, Chandini S B, Rajkumar N
Year : 2019

Nowadays credit card is more popular among the private and public
employees. By using the credit card, the users purchase the consumable
durable products in online, also transferring the amount from one account
to other. The fraudster is detecting the details of the behavior user
transaction and doing the illegal activities with the card by phishing,
Trojan virus, etc. The fraudulent may threaten the users on their sensitive
information. In this paper, we have discussed various methods of

19
detecting and controlling the fraudulent activities. This will be helpful to
improve the security for card transaction in future. Credit card fraudulent
activities which are faced by the people is one of the major issues. Due to
these fraudulent activities, many credit card users are losing their
money and their sensitive

20
information. In this paper, we have discussed the different fraudulent
detection and controlling techniques in credit card and also it will be
helpful to improve the security from the fraudsters in future to avoid the
illegal activities.

Title : An Efficient Techniques for Fraudulent detection in Credit Card

Dataset: A Comprehensive study
Author: Akanksha Bansal and Hitendra Garg

Year : 2021

Now a day, credit card transaction is one the famous mode for financial
transaction. Increasing trends of financial transactions through credit
cards also invite fraud activities that involve the loss of billions of dollars
globally. It is also been observed that fraudulent transactions have
increased by 35% from 2018. A huge amount of transaction data is
available to analyze the fraud detection activities that require analysis of
behavior/abnormalities in the transaction dataset to detect and ignore the
undesirable action of the suspected person. The proposed paper lists a
compressive summary of various techniques for the classification of fraud
transactions from the various datasets to alert the user for such
transactions. In the last decades, online transactions are growing rapidly
and the most common tool for financial transactions. The increasing
growth of online transactions also increases threats. Therefore, in keeping
in mind the security issue, nature, an anomaly in the credit card
transaction, the proposed work represents the summary of various
strategies applied to identify the abnormal transaction in the dataset of
credit card transaction datasets. This dataset contains a mix of normal
and fraud transactions; this proposed work classifies and summarizes the
various classification methods to classify the transactions using various
Machine Learning-based classifiers. The efficiency of the method depends
on the dataset and classifier used. The proposed summary will be

21
beneficial to the banker, credit card user, and researcher to analyze to
prevent credit card frauds. The future scope of this credit card fraud
detection is to explore the things in each and every associations and
banks to live safe and happily life. The data must be balanced in each
place and we are getting the best results.

22
Title : A Review On Credit Card Fraud Detection Using Machine Learning
Author: Suresh K Shirgave, Chetan J. Awati, Rashmi More, Sonam S. Patil

Year : 2019

In recent years credit card fraud has become one of the growing problem.
A large financial loss has greatly affected individual person using credit
card and also the merchants and banks. Machine learning is considered as
one of the most successful technique to identify the fraud. This paper
reviews different fraud detection techniques using machine learning and
compare them using performance measure like accuracy, precision and
specificity. The paper also proposes a FDS which uses supervised Random
Forest algorithm. With this proposed system the accuracy of detecting
fraud in credit card is increased. Further, the proposed system use
learning to rank approach to rank the alert and also effectively addresses
the problem concept drift in fraud detection. This paper has reviewed
various machine learning algorithm detect fraud in credit card transaction.
The performances of all this techniques are examined based on accuracy,
precision and specificity metrics. We have selected supervised learning
technique Random Forest to classify the alert as fraudulent or authorized.
This classifier will be trained using feedback and delayed supervised
sample. Next it will aggregate each probability to detect alerts. Further
we proposed learning to rank approach where alert will be ranked based
on priority. The suggested method will be able to solve the class
imbalance and concept drift problem. Future work will include applying
semi-supervised learning methods for classification of alert in FDS

Title : Credit Card Fraud Detection and Prevention using Machine Learning
Author: S. Abinayaa, H. Sangeetha, R. A. Karthikeyan, K. Saran Sriram, D. Piyush

Year : 2020

This research focused mainly on detecting credit card fraud in real

world. We must collect the credit card data sets initially for qualified data
set. Then provide queries on the user's credit card to test the data set.
After random forest algorithm classification method using the already

23
evaluated data set and providing current data set[1]. Finally, the accuracy
of the results data is optimised. Then the processing of a number of
attributes will be implemented, so that affecting fraud detection can be
found in viewing the representation of the graphical model. The
techniques efficiency

24
is measured based on accuracy, flexibility, and specificity, precision. The
results obtained with the use of the Random Forest Algorithm have proved
much more effective.

3. FEASIBILITY STUDY:

Data Wrangling
In this section of the report will load in the data, check for
cleanliness, and then trim and clean given dataset for analysis. Make sure
that the document steps carefully and justify for cleaning decisions.

Data collection
The data set collected for predicting given data is split into Training
set and Test set. Generally, 7:3 ratios are applied to split the Training set
and Test set. The Data Model which was created using Random Forest,
logistic, Decision tree algorithms and Support vector classifier (SVC) are
applied on the Training set and based on the test result accuracy, Test set
prediction is done.

Preprocessing
The data which was collected might contain missing values that
may lead to inconsistency. To gain better results data need to be
preprocessed so as to improve the efficiency of the algorithm. The outliers
have to be removed and also variable conversion need to be done.

Building the classification model

The prediction of credit card fraud, A high accuracy prediction model
is effective because of the following reasons: It provides better results in
classification problem.
 It is strong in preprocessing outliers, irrelevant variables, and a mix
of continuous, categorical and discrete variables.
 It produces out of bag estimate error which has proven to be

25
unbiased in many tests and it is relatively easy to tune with.

26
CONSTRUCTION OF A PREDICTIVE MODEL

Machine learning needs data gathering have lot of past data‘s. Data
gathering have sufficient historical data and raw data. Before data pre-
processing, raw data can‘t be used directly. It‘s used to pre-process then,
what kind of algorithm with model. Training and testing this model
working and predicting correctly with minimum errors. Tuned model
involved by tuned time to time with improving the accuracy.

27
 Data Gathering

Data Pre-Processing

Choose model

Train model

Test model

Tune model

Prediction

Process of dataflow diagram

4. PROJECT REQUIREMENTS

4.1. General:

Requirements are the basic constrains that are required to develop

a system. Requirements are collected while designing the system. The
following are the requirements that are to be discussed.

1. Functional requirements

2. Non-Functional requirements

3. Environment requirements

A. Hardware requirements

B. software requirements

28
4.1.2 Functional requirements:

The software requirements specification is a technical specification of

requirements for the software product. It is the first step in the
requirements analysis process. It lists requirements of a particular
software system. The following details to follow the special libraries like
sk-learn, pandas, numpy, matplotlib and seaborn.

4.1.3 Non-Functional Requirements:

Process of functional steps,

1. Problem define
2. Preparing data
3. Evaluating algorithms
4. Improving results
5. Prediction the result

4.2. Environmental Requirements:

1. Software Requirements:

Operating System : Windows

Tool : Anaconda with Jupyter Notebook

2. Hardware requirements:

Processor : Pentium IV/III

Hard disk : minimum 80 GB

RAM : minimum 2 GB

29
4.3. SOFTWARE DESCRIPTION

Anaconda is a free and open-source distribution of the Python and R

programming languages for scientific computing (data science, machine
learning applications, large-scale data processing, predictive analytics,
etc.), that aims to simplify package management and deployment.
Package versions are managed by the package management system
―Conda‖. The Anaconda distribution is used by over 12 million users and
includes more than 1400 popular data-science packages suitable for
Windows, Linux, and MacOS. So, Anaconda distribution comes with more
than 1,400 packages as well as the Conda package and virtual
environment manager called Anaconda Navigator and it eliminates the
need to learn to install each library independently. The open source
packages can be individually installed from the Anaconda repository with
the conda install command or using the pip install command that is
installed with Anaconda. Pip packages provide many of the features of
conda packages and in most cases they can work together. Custom
conda
packages can be made using the command, and can be shared with
build
others by uploading them to Anaconda Cloud, PyPI or other repositories.
The default installation of Anaconda2 includes Python 2.7 and Anaconda3
includes Python 3.7. However, you can create new environments that
include any version of Python packaged with conda.

4.3.1 ANACONDA NAVIGATOR

Anaconda Navigator is a desktop graphical user interface (GUI)

included in Anaconda® distribution that allows you to launch applications
and easily manage conda packages, environments, and channels without
using command-line commands. Navigator can search for packages on
Anaconda.org or in a local Anaconda Repository.

Anaconda. Now, if you are primarily doing data science work,

Anaconda is also a great option. Anaconda is created by Continuum

30
Analytics, and it is a Python distribution that comes preinstalled with lots
of useful python libraries for data science.

31
 Anaconda is a distribution of the Python and R programming
languages for scientific computing (data science, machine learning
applications, large-scale data processing, predictive analytics, etc.), that
aims to simplify package management and deployment.

In order to run, many scientific packages depend on specific

versions of other packages. Data scientists often use multiple versions of
many packages and use multiple environments to separate these different
versions.

The command-line program conda is both a package manager and

an environment manager. This helps data scientists ensure that each
version of each package has all the dependencies it requires and works
correctly.

Navigator is an easy, point-and-click way to work with packages and

environments without needing to type conda commands in a terminal
window. You can use it to find the packages you want, install them in an
environment, run the packages, and update them – all inside Navigator.

The following applications are available by default in Navigator:

 JupyterLab
 Jupyter Notebook
 Spyder
 PyCharm
 VSCode
 Glueviz
 Orange 3 App
 RStudio
 Anaconda Prompt (Windows only)
 Anaconda PowerShell (Windows only)

32
 Anaconda Navigator is a desktop graphical user interface (GUI)
included in Anaconda distribution.

33
 Navigator allows you to launch common Python programs and easily
manage conda packages, environments, and channels without using
command-line commands. Navigator can search for packages on
Anaconda Cloud or in a local Anaconda Repository.

Anaconda comes with many built-in packages that you can easily find
with conda list on your anaconda prompt. As it has lots of
packages (many of which are rarely used), it requires lots of space and
time as well. If you have enough space, time and do not want to burden
yourself to install small utilities like JSON, YAML, you better go for
Anaconda.

4.3.2.CONDA :

Conda is an open source, cross-platform, language-agnostic

package manager and environment management systemthat installs,
runs, and updates packages and their dependencies. It was created for
Python programs, but it can package and distribute software for any
language (e.g., R), including multi-language projects. The conda package
and environment manager is included in all versions of Anaconda,
Miniconda, and Anaconda Repository.

Anaconda is freely available, open source distribution of python and

R programming languages which is used for scientific computations. If you
are doing any machine learning or deep learning project then this is the
best place for you. It consists of many softwares which will help you to
build your machine learning project and deep learning project. these
softwares have great graphical user interface and these will make your
work easy to do. you can also use it to run your python script. These are
the software carried by anaconda navigator.

4.3.3. JUPYTER NOTEBOOK

This website acts as ―meta‖ documentation for the Jupyter

ecosystem. It has a collection of resources to navigate the tools and
34
communities in this ecosystem, and to help you get started.

Project Jupyter is a project and community whose goal is to "develop

open- source software, open-standards, and services for interactive
computing across

35
dozens of programming languages". It was spun off from IPython in 2014
by Fernando Perez.

Notebook documents are documents produced by the Jupyter

Notebook App, which contain both computer code (e.g. python) and rich
text elements (paragraph, equations, figures, links, etc…). Notebook
documents are both human-readable documents containing the analysis
description and the results (figures, tables, etc.) as well as executable
documents which can be run to perform data analysis.

Installation:The easiest way to install the Jupyter Notebook App is

installing a scientific python distribution which also includes scientific
python packages. The most common distribution is called Anaconda

RUNNING THE JUPYTER NOTEBOOK:

Launching Jupyter Notebook App: The Jupyter Notebook App can be

launched by clicking on the Jupyter Notebook icon installed by Anaconda
in the start menu (Windows) or by typing in a terminal (cmd on Windows):
―jupyter notebook‖

This will launch a new browser window (or a new tab) showing the
Notebook Dashboard, a sort of control panel that allows (among other
things) to select which notebook to open.

When started, the Jupyter Notebook App can access only files within
its start- up folder (including any sub-folder). No configuration is necessary
if you place your notebooks in your home folder or subfolders.
Otherwise, you need to choose a Jupyter Notebook App start-up folder
which will contain all the notebooks.

36
Save notebooks:Modifications to the notebooks are automatically saved
every few minutes. To avoid modifying the original notebook, make a
copy of the notebook document (menu file -> make a copy…) and save
the modifications on the copy.

Executing a notebook:Download the notebook you want to execute and put it in

your notebook folder (or a sub-folder of it).
 Launch the jupyter notebook app

 In the Notebook Dashboard navigate to find the notebook: clicking

on its name will open it in a new browser tab.

 Click on the menu Help -> User Interface Tour for an overview of the
Jupyter Notebook App user interface.
 You can run the notebook document step-by-step (one cell a
time) by pressing shift + enter.

 You can run the whole notebook in a single step by clicking on the menu
Cell
-> Run All.
 To restart the kernel (i.e. the computational engine), click on the menu
Kernel
-> Restart. This can be useful to start over a computation from scratch
(e.g. variables are deleted, open files are closed, etc…).

PURPOSE: To support interactive data science and scientific computing

across all programming languages.

FILE EXTENSION: An IPYNB file is a notebook document created by Jupyter

Notebook, an interactive computational environment that helps scientists
manipulate and analyze data using Python.

37
JUPYTER NOTEBOOK APP:

The Jupyter Notebook App is a server-client application that

allows editing and running notebook documents via a web browser.

The Jupyter Notebook App can be executed on a local desktop

requiring no internet access (as described in this document) or can be
installed on a remote server and accessed through the internet.

In addition to displaying/editing/running notebook documents, the

Jupyter Notebook App has a ―Dashboard‖ (Notebook Dashboard), a
―control panel‖ showing local files and allowing to open notebook
documents or shutting down their kernels.

KERNEL: A notebook kernel is a ―computational engine‖ that executes

the code contained in a Notebook document. The ipython kernel,
referenced in this guide, executes python code. Kernels for many other
languages exist (official kernels).
When you open a Notebook document, the associated kernel is
automatically launched. When the notebook is executed (either cell-by-
cell or with menu Cell -> Run All), the kernel performs the computation
and produces the results.

Depending on the type of computations, the kernel may consume

significant CPU and RAM. Note that the RAM is not released until the
kernel is shut-down

NOTEBOOK DASHBOARD:The Notebook Dashboard is the component

which is shown first when you launch Jupyter Notebook App. The Notebook
Dashboard is mainly used to open notebook documents, and
to manage the running kernels (visualize and shutdown).

38
The Notebook Dashboard has other features similar to a file
manager, namely navigating folders and renaming/deleting files

39
WORKING PROCESS:

 Download and install anaconda and get the most useful package for
machine learning in Python.
 Load a dataset and understand its structure using statistical
summaries and data visualization.
 Machine learning models, pick the best and build confidence
that the accuracy is reliable.
Python is a popular and powerful interpreted language. Unlike R,
Python is a complete language and platform that you can use for both
research and development and developing production systems. There are
also a lot of modules and libraries to choose from, providing multiple ways
to do each task. It can feel overwhelming.

The best way to get started using Python for machine learning is to
complete a project.

 It will force you to install and start the Python interpreter (at the very least).
 It will give you a bird‘s eye view of how to step through a small project.
 It will give you confidence, maybe to go on to your own small projects.

When you are applying machine learning to your own datasets, you are
working on a project. A machine learning project may not be linear, but it
has a number of well-known steps:

 Define Problem.
 Prepare Data.
 Evaluate Algorithms.
 Improve Results.
 Present Results.
40
 The best way to really come to terms with a new platform or tool is
to work through a machine learning project end-to-end and cover the key
steps. Namely, from loading data, summarizing data, evaluating
algorithms and making some predictions.

Here is an overview of what we are going to cover:

1. Installing the Python anaconda platform.

2. Loading the dataset.
3. Summarizing the dataset.
4. Visualizing the dataset.
5. Evaluating some algorithms.
6. Making some predictions.

4.3.4 PYTHON

INTRODUCTION:

Python is an interpreted high-level general-purpose programming

language. Its design philosophy emphasizes code readability with its use
of significant indentation. Its language constructs as well as its object-
oriented approach aim to help programmers write clear, logical code for
small and large-scale projects.

Python is dynamically-typed and garbage-collected. It

supports multiple programming paradigms, including
structured (particularly, procedural), object-oriented and functional
programming. It is often described as a "batteries included" language due
to its comprehensive standard library.

Guido van Rossum began working on Python in the late 1980s, as a

successor to the ABC programming language, and first released it in 1991
as Python
41
0.9.0. Python 2.0 was released in 2000 and introduced new features, such
as list comprehensions and a garbage collection system using reference
counting. Python 3.0 was released in 2008 and was a major revision of
the language that is

42
not completely backward-compatible. Python 2 was discontinued with
version 2.7.18 in 2020.

Python consistently ranks as one of the most popular programming

languages

HISTORY:

Python was conceived in the late 1980s by Guido van Rossum at

Centrum Wiskunde & Informatica (CWI) in the Netherlands as a
successor to ABC programming language, which was inspired by SETL,
capable of exception handling and interfacing with the Amoeba
operating system. Its implementation began in December 1989. Van
Rossum shouldered sole responsibility for the project, as the lead
developer, until 12 July 2018, when he announced his
―permanent vacation‖ from his responsibilities as Python's Benevolent
Dictator For Life, a title the Python community bestowed upon him to
reflect his long-term commitment as the project‘s chief decision-maker. In
January 2019, active Python core developers elected a 5-member
―Steering Council‖ to lead the project. As of 2021, the current members
of this council are Barry Warsaw, Brett Cannon, Carol Willing, Thomas
Wouters, and Pablo Galindo Salgado.

Python 2.0 was released on 16 October 2000, with many major new
features, including a cycle-detecting garbage collector and support for
Unicode.

Python 3.0 was released on 3 December 2008. It was a major

revision of the language that is not completely backward-compatible.
Many of its major features were backported to Python 2.6.x and 2.7.x
version series. Releases of Python 3 include the 2 to 3 utility, which
automates (at least partially) the translation of Python 2 code to Python
3.
43
 Python 2.7‘s end-of-life date was initially set at 2015 then
postponed to 2020 out of concern that a large body of existing code could
not easily be forward-ported to Python 3. No more security patches or
other improvements will be released for it. With Python 2‘s end-of-life,
only Python 3.6.x and later are supported.

44
 Python 3.9.2 and 3.8.8 were expeditedas all versions of Python
(including 2.7) had security issues, leading to possible remote code
execution and web cache poisoning.

DESIGN PHILOSOPHY & FEATURE:

Python is a multi-paradigm programming language. Object-

oriented programming and structured programming are fully supported,
and many of its features support functional programming
and aspect-oriented programming (including by meta-
programming and meta-objects (magic methods)). Many other paradigms
are supported via extensions, including design by contract and logic
programming.

Python uses dynamic typing and a combination of reference

counting and a cycle-detecting garbage collector for memory
management. It also features dynamic name resolution (late binding),
which binds method and variable names during program execution.

Python's design offers some support for functional

programming in the Lisp tradition. It has filter, map and reduce
functions; list comprehensions, dictionaries, sets, and generator
expressions. The standard library has two modules (itertools and
functools) that implement functional tools borrowed from Haskell and
Standard ML.

The language's core philosophy is summarized in the document The

Zen of Python (PEP 20), which includes aphorisms such as:

 Beautiful is better than ugly.

 Explicit is better than implicit.
 Simple is better than complex.
 Complex is better than complicated.
 Readability counts.

45
 Rather than having all of its functionality built into its core, Python
was designed to be highly extensible (with modules). This compact
modularity has made it particularly popular as a means of adding
programmable interfaces to existing applications. Van Rossum's vision of
a small core language with a large standard library and easily extensible
interpreter stemmed from his frustrations with ABC, which espoused the
opposite approach.

Python strives for a simpler, less-cluttered syntax and grammar

while giving developers a choice in their coding methodology. In contrast
to Perl's "there is more than one way to do it" motto, Python embraces a
"there should be one— and preferably only one —obvious way to do
it" design philosophy. Alex Martelli, a Fellow at the Python Software
Foundation and Python book author, writes that "To describe something
as 'clever' is not considered a compliment in the Python culture."

Python's developers strive to avoid premature optimization, and

reject patches to non-critical parts of the C-Python reference
implementation that would offer marginal increases in speed at the cost
of clarity. When speed is important, a Python programmer can move time-
critical functions to extension modules written in languages such as C, or
use PyPy, a just-in-time compiler. Cython is also available, which
translates a Python script into C and makes direct C-level API calls into the
Python interpreter.

Python's developers aim to keep the language fun to use. This is

reflected in its name a tribute to the British comedy group Monty Python
and in occasionally playful approaches to tutorials and reference
materials, such as examples that refer to spam and eggs (a reference to
a Monty Python sketch) instead of the standard foo and bar.

A common neologism in the Python community is pythonic, which

can have a wide range of meanings related to program style. To say that
code is pythonic is to say that it uses Python idioms well, that it is natural
or shows fluency in the language, that it conforms with Python's
minimalist philosophy and emphasis on readability. In contrast, code that
46
is difficult to understand or reads like a rough transcription from another
programming language is called unpythonic.

Users and admirers of Python, especially those considered

knowledgeable or experienced, are often referred to as Pythonistas

47
SYNTAX AND SEMANTICS :

Python is meant to be an easily readable language. Its formatting is

visually uncluttered, and it often uses English keywords where other
languages use punctuation. Unlike many other languages, it does not use
curly brackets to delimit blocks, and semicolons after statements are
allowed but are rarely, if ever, used. It has fewer syntactic exceptions and
special cases than C or Pascal.

INDENTATION :

Main article: Python syntax and semantics & Indentation

Python uses whitespace indentation, rather than curly brackets or

keywords, to delimit blocks. An increase in indentation comes after certain
statements; a decrease in indentation signifies the end of the current
block. Thus, the program's visual structure accurately represents the
program's semantic structure. This feature is sometimes termed the off-
side rule, which some other languages share, but in most languages
indentation does not have any semantic meaning. The recommended
indent size is four spaces.

STATEMENTS AND CONTROL FLOW :

Python's statements include:

 The assignment statement, using a single equals sign =.

 The if statement, which conditionally executes a block of code, along
with else and elif (a contraction of else-if).
 The for statement, which iterates over an iterable object, capturing
each element to a local variable for use by the attached block.
 The while statement, which executes a block of code as long as its

48
condition is true.

49
 The Try statement, which allows exceptions raised in its attached code
block to be caught and handled by except clauses; it also ensures that
clean-up code in a finally block will always be run regardless of how the
block exits.
 The raise statement, used to raise a specified exception or re-raise a
caught exception.
 The class statement, which executes a block of code and attaches its
local namespace to a class, for use in object-oriented programming.
 The def statement, which defines a function or method.
 The with statement, which encloses a code block within a context
manager (for example, acquiring a lock before the block of code is run
and releasing the lock afterwards, or opening a file and then closing it),
allowing resource-acquisition-is- initialization (RAII) - like behavior and
replaces a common try/finally idiom.
 The break statement, exits from a loop.
 The continue statement, skips this iteration and continues with the next
item.
 The del statement, removes a variable, which means the reference
from the name to the value is deleted and trying to use that variable
will cause an error. A deleted variable can be reassigned.
 The pass statement, which serves as a NOP. It is syntactically needed
to create an empty code block.
 The assert statement, used during debugging to check for conditions
that should apply.
 The yield statement, which returns a value from a generator function
and yield is also an operator. This form is used to implement co-
routines.
 The return statement, used to return a value from a function.
 The import statement, which is used to import modules whose
functions or variables can be used in the current program.

50
 The assignment statement (=) operates by binding a name as a
reference to a separate, dynamically-allocated object. Variables may be
subsequently rebound at any time to any object. In Python, a variable
name is a generic reference holder and

51
does not have a fixed data type associated with it. However, at a given
time, a variable will refer to some object, which will have a type.
This is referred to as dynamic typing and is contrasted with statically-
typed programming languages, where each variable may only contain
values of a certain type.

Python does not support tail call optimization or first-class

continuations, and, according to Guido van Rossum, it never will. [80][81]
However, better support for co- routine-like functionality is provided, by
extending Python's generators. Before 2.5, generators were lazy iterators;
information was passed uni-directionally out of the generator. From
Python 2.5, it is possible to pass information back into a generator
function, and from Python 3.3, the information can be passed through
multiple stack levels.

EXPRESSIONS :

Some Python expressions are similar to those found in languages

such as C and Java, while some are not:

 Addition, subtraction, and multiplication are the same, but the

behavior of division differs. There are two types of divisions in Python.
They are floor division (or integer division) // and floating-point /
division. Python also uses the ** operator

for exponentiation.
 From Python 3.5, the new @ infix operator was introduced. It is
intended to be used by libraries such as NumPy for matrix
multiplication.
 From Python 3.8, the syntax :=, called the 'walrus operator' was
introduced. It assigns values to variables as part of a larger expression.
 In Python, == compares by value, versus Java, which compares
numerics by value and objects by reference. (Value comparisons in
Java on objects can be performed with the equals() method.) Python's
52
 is operator may be used to compare object identities (comparison by
reference). In Python, comparisons may be chained, for example
A<=B<=C.
 Python uses the words and, or, not for or its boolean operators rather
than the symbolic &&, ||, ! used in Java and C.

53
 Python has a type of expression termed a list comprehension as well as
a more general expression termed a generator expression.
 Anonymous functions are implemented using lambda expressions;
however, these are limited in that the body can only be one
expression.
 Conditional expressions in Python are written as x if c else y (different
in order of operands from the c ? x : y operator common to many other
languages).
 Python makes a distinction between lists and tuples. Lists are written
as [1, 2, 3], are mutable, and cannot be used as the keys of
dictionaries (dictionary keys must be immutable in Python). Tuples are
written as (1, 2, 3), are immutable and thus can be used as the keys of
dictionaries, provided all elements of the tuple are immutable. The +
operator can be used to concatenate two tuples, which does not
directly modify their contents, but rather produces a new tuple
containing the elements of both provided tuples. Thus, given the
variable t initially equal to (1, 2, 3), executing t = t + (4, 5) first
evaluates t + (4, 5), which yields (1, 2, 3, 4, 5), which is then assigned
back to t, thereby effectively "modifying the contents" of t, while
conforming to the immutable nature of tuple objects. Parentheses are
optional for tuples in unambiguous contexts.
 Python features sequence unpacking wherein multiple expressions,
each evaluating to anything that can be assigned to (a variable, a
writable property, etc.), are associated in an identical manner to that
forming tuple literals and, as a whole, are put on the left-hand side of
the equal sign in an assignment statement. The statement expects an
iterable object on the right-hand side of the equal sign that produces
the same number of values as the provided writable expressions when
iterated through and will iterate through it, assigning each of the
produced values to the corresponding expression on the left.
 Python has a "string format" operator %. This functions analogously
ton printf format strings in C, e.g. ―spam=%s eggs=%d‖ %
(―blah‖,2) evaluates to
54
 ―spam=blah eggs=2‖. In Python 3 and 2.6+, this was supplemented
by the format() method of the str class, e.g. ―spam={0}
eggs={1}‖.format(―blah‖,2). Python 3.6 added "f-strings": blah =
―blah‖; eggs = 2; f‗spam={blah} eggs={eggs}‘
 Strings in Python can be concatenated, by "adding" them (same
operator as for adding integers and floats). E.g. ―spam‖ +
―eggs‖returns ―spameggs‖. Even if your

55
 strings contain numbers, they are still added as strings rather than
integers. E.g.
―2‖ + ―2‖ returns ―2‖.
 Python has various kinds of string literals:
o Strings delimited by single or double quote marks. Unlike in
Unix shells, Perl and Perl-influenced languages, single quote marks
and double quote marks function identically. Both kinds of string
use the backslash (\) as an escape character. String interpolation
became available in Python 3.6 as "formatted string literals".
o Triple-quoted strings, which begin and end with a series of three
single or double quote marks. They may span multiple lines and
function like here documents in shells, Perl and Ruby.

o Raw string varieties, denoted by prefixing the string literal with an r .

Escape

sequences are not interpreted; hence raw strings are useful where
literal backslashes are common, such as regular expressions and
Windows-style paths. Compare "@-quoting" in C#.
 Python has array index and array slicing expressions on lists,
denoted as a[Key], a[start:stop] or a[start:stop:step]. Indexes are zero-
based, and negative indexes are relative to the end. Slices take
elements from the start index up to, but not including, the stop index.
The third slice parameter, called step or stride, allows elements to be
skipped and reversed. Slice indexes may be omitted, for example a[:]
returns a copy of the entire list. Each element of a slice is a shallow
copy.

In Python, a distinction between expressions and statements is

rigidly enforced, in contrast to languages such as Common Lisp, Scheme,
or Ruby. This leads to duplicating some functionality. For example:

 List comprehensions vs. for-loops

56
 Conditional expressions vs. if blocks
 The eval() vs. exec() built-in functions (in Python 2, exec is a
statement); the former is for expressions, the latter is for statements.

57
 Statements cannot be a part of an expression, so list and
other comprehensions or lambda expressions, all being
expressions, cannot contain statements. A particular case of this is that
an assignment statement such as a=1 cannot form part of the conditional
expression of a conditional statement. This has the advantage of avoiding
a classic C error of mistaking an assignment operator = for an equality
operator == in conditions: if (c==1) {…} is syntactically valid (but
probably unintended) C code but if c=1: … causes a syntax error in
Python.

METHODS :

Methods on objects are functions attached to the object's class; the

syntax instance.method(argument) is, for normal methods and functions,
syntactic sugar for Class.method(instance, argument). Python methods
have an explicit self parameter access instance data, in contrast to the
implicit self (or this) in some other object- oriented programming
languages (e.g., C++, Java, Objective-C, or Ruby). Apart from this Python
also provides methods, sometimes called d-under methods due to their
names beginning and ending with double-underscores, to extend the
functionality of custom class to support native functions such as print,
length, comparison, support for arithmetic operations, type conversion,
and many more.

TYPING :

Python uses duck typing and has typed objects but untyped variable
names. Type constraints are not checked at compile time; rather,
operations on an object may fail, signifying that the given object is not of
a suitable type. Despite being dynamically-typed, Python is strongly-
typed, forbidding operations that are not well- defined (for example,
adding a number to a string) rather than silently attempting to make
58
sense of them.

Python allows programmers to define their own types using classes,

which are most often used for object-oriented programming. New
instances of classes are constructed by calling the class (for example,
SpamClass() or EggsClass()), and the

59
classes are instances of the metaclass type (itself an instance of itself),
allowing meta-programming and reflection.

Before version 3.0, Python had two kinds of classes: old-style and
new- style.The syntax of both styles is the same, the difference being
whether the class object is inherited from, directly or indirectly (all new-
style classes inherit from object and are instances of type). In versions of
Python 2 from Python 2.2 onwards, both kinds of classes can be used. Old-
style classes were eliminated in Python 3.0.

The long-term plan is to support gradual typing and from Python 3.5, the
syntax of the language allows specifying static types but they are not
checked in the default implementation, CPython. An experimental
optional static type checker named mypy supports compile-time type
checking.

5. SYSTEM DIAGRAMS

5.1.1. SYSTEM ARCHITECTURE

60
5.2 WORK FLOW DIAGRAM

Source Data

Data Processing and Cleaning

Training Testing
Dataset Dataset
61
 Classification ML Best Model by Accuracy

Finding Credit Card fraud or not

Workflow Diagram

5.3. USE CASE DIAGRAM

62
 Use case diagrams are considered for high level requirement
analysis of a system. So when the requirements of a system are analyzed
the functionalities are captured in use cases. So, it can say that uses
cases are nothing but the system functionalities written in an organized
manner.

63
5.4 CLASS DIAGRAM:

64
 Class diagram is basically a graphical representation of the static
view of the system and represents different aspects of the application. So
a collection of class diagrams represent the whole system. The name of
the class diagram should be meaningful to describe the aspect of the
system. Each element and their relationships should be identified in
advance Responsibility (attributes and methods) of each class should be
clearly identified for each class minimum number of properties should be
specified and because, unnecessary properties will make the diagram
complicated. Use notes whenever required to describe some aspect of the
diagram and at the end of the drawing it should be understandable to the
developer/coder. Finally, before making the final version, the diagram
should be drawn on plain paper and rework as many times as possible to
make it correct.

65
5.5 ACTIVITY DIAGRAM:

66
 Activity is a particular operation of the system. Activity diagrams
are not only used for visualizing dynamic nature of a system but they are
also used to construct the executable system by using forward and
reverse engineering techniques. The only missing thing in activity
diagram is the message part. It does not show any message flow from
one activity to another. Activity diagram is some time considered as the
flow chart. Although the diagrams looks like a flow chart but it is not. It
shows different flow like parallel, branched, concurrent and single.

67
5.6 SEQUENCE DIAGRAM:

Sequence diagrams model the flow of logic within your system in a

visual manner, enabling you both to document and validate your logic,
and are commonly used for both analysis and design purposes. Sequence
diagrams are the most popular UML artifact for dynamic modelling, which
focuses on identifying the behaviour within your system. Other dynamic
modelling techniques include activity diagramming, communication
diagramming, timing diagramming, and interaction overview
diagramming. Sequence diagrams, along with class diagrams
and physical data models are in my opinion the most important design-
level models for modern business application development.

68
5.7 ENTITY RELATIONSHIP DIAGRAM (ERD)

An entity relationship diagram (ERD), also known as an entity

relationship model, is a graphical representation of an information system
that depicts the relationships among people, objects, places, concepts or
events within that system. An ERD is a data modeling technique that can
help define business processes and be used as the foundation for a
relational database. Entity relationship diagrams provide a visual starting
point for database design that can also be used to help determine
information system requirements throughout an organization. After a
relational database is rolled out, an ERD can still serve as a referral point,
should any debugging or business process re-engineering be needed
later.

6. LIST OF MODULES:
69
 Data Pre-processing
 Data Analysis of Visualization

70
 Comparing Algorithm with prediction in the form of best accuracy result
 Deployment Using Flask

6.1 MODULE DESCRIPTION

6.1.1. DATA PRE-PROCESSING

Validation techniques in machine learning are used to get the error

rate of the Machine Learning (ML) model, which can be considered as
close to the true error rate of the dataset. If the data volume is large
enough to be representative of the population, you may not need the
validation techniques. However, in real-world scenarios, to work with
samples of data that may not be a true representative of the population of
given dataset. To finding the missing value, duplicate value and
description of data type whether it is float variable or integer. The sample
of data used to provide an unbiased evaluation of a model fit on the
training dataset while tuning model hyper parameters.

The evaluation becomes more biased as skill on the validation

dataset is incorporated into the model configuration. The validation set is
used to evaluate a given model, but this is for frequent evaluation. It as
machine learning engineers use this data to fine-tune the model hyper
parameters. Data collection, data analysis, and the process of addressing
data content, quality, and structure can add up to a time- consuming to-
do list. During the process of data identification, it helps to understand
your data and its properties; this knowledge will help you choose which
algorithm to use to build your model.

A number of different data cleaning tasks using Python‘s Pandas

library and specifically, it focus on probably the biggest data cleaning
task, missing values and it able to more quickly clean data. It wants to
spend lesstime cleaning data, and more time exploring and modeling.

71
 Some of these sources are just simple random mistakes. Other
times, there can be a deeper reason why data is missing. It‘s
important to understand

72
these different types of missing data from a statistics point of view. The
type of missing data will influence how to deal with filling in the missing
values and to detect missing values, and do some basic imputation and
detailed statistical approach for dealing with missing data. Before, joint
into code, it‘s important to understand the sources of missing data. Here
are some typical reasons why data is missing:

 User forgot to fill in a field.

 Data was lost while transferring manually from a legacy database.

 There was a programming error.

 Users chose not to fill out a field tied to their beliefs about how the
results would be used or interpreted.

Variable identification with Uni-variate, Bi-variate and Multi-variate analysis:

 import libraries for access and functional purpose and read the given
dataset
 General Properties of Analyzing the given dataset
 Display the given dataset in the form of data frame
 show columns
 shape of the data frame
 To describe the data frame
 Checking data type and information about dataset
 Checking for duplicate data
 Checking Missing values of data frame
 Checking unique values of data frame
 Checking count values of data frame
 Rename and drop the given data frame
 To specify the type of values
 To create extra columns

73
MODULE DIAGRAM

GIVEN INPUT EXPECTED OUTPUT

input : data
output : removing noisy data

74
6.1.2. DATA VALIDATION/ CLEANING/PREPARING PROCESS
Importing the library packages with loading given dataset. To
analyzing the variable identification by data shape, data type and
evaluating the missing values, duplicate values. A validation dataset is a
sample of data held back from training your model that is used to give
an estimate of model skill while tuning model's and procedures that you
can use to make the best use of validation and test datasets when
evaluating your models. Data cleaning / preparing by rename the given
dataset and drop the column etc. to analyze the uni-variate, bi-variate and
multi-variate process. The steps and techniques for data cleaning will vary
from dataset to dataset. The primary goal of data cleaning is to detect
and remove errors and anomalies to increase the value of data in
analytics and decision making.

6.1.3. EXPLORATION DATA ANALYSIS OF VISUALIZATION

Data visualization is an important skill in applied statistics and machine

learning. Statistics does indeed focus on quantitative descriptions and
estimations of data. Data visualization provides an important suite of tools
for gaining a qualitative understanding. This can be helpful when
exploring and getting to know a dataset and can help with identifying
patterns, corrupt data, outliers, and much more. With a little domain
knowledge, data visualizations can be used to express and demonstrate
key relationships in plots and charts that are more visceral and
stakeholders than measures of association or significance. Data
visualization and exploratory data analysis are whole fields themselves
and it will recommend a deeper dive into some the books mentioned at
the end.

75
 Sometimes data does not make sense until it can look at in a visual
form, such as with charts and plots. Being able to quickly visualize of data
samples and others is an important skill both in applied statistics and in
applied machine learning. It will

76
discover the many types of plots that you will need to know when
visualizing data in Python and how to use them to better understand your
own data.

 How to chart time series data with line plots and categorical
quantities with bar charts.
 How to summarize data distributions with histograms and box plots.

77
MODULE DIAGRAM

GIVEN INPUT EXPECTED OUTPUT

input : data
output : visualized data

Pre-processing refers to the transformations applied to our data

before feeding it to the algorithm.Data Preprocessing is a technique that
is used to convert the raw data into a clean data set. In other words,
whenever the data is gathered from different sources it is collected in raw
format which is not feasible for the analysis. To achieving better results
from the applied model in Machine Learning method of the data has to be
in a proper manner. Some specified Machine Learning model needs
information in a specified format, for example, Random Forest algorithm
does not support null values. Therefore, to execute random forest
algorithm null values have to be managed from the original raw data set.
And another aspect is that data set should be formatted in such a way
that more than one Machine Learning and Deep Learning algorithms are
executed in given dataset.

FALSE POSITIVES (FP):A person who will pay predicted as defaulter. When
actual class is no and predicted class is yes. E.g. if actual class says this

78
passenger did not survive but predicted class tells you that this passenger
will survive.

79
FALSE NEGATIVES (FN):A person who default predicted as payer. When
actual class is yes but predicted class in no. E.g. if actual class value
indicates that this passenger survived and predicted class tells you that
passenger will die.

TRUE POSITIVES (TP):A person who will not pay predicted as defaulter.
These are the correctly predicted positive values which means that the
value of actual class is yes and the value of predicted class is also yes.
E.g. if actual class value indicates that this passenger survived and
predicted class tells you the same thing.

TRUE NEGATIVES (TN):A person who default predicted as payer. These are
the correctly predicted negative values which means that the value of
actual class is no and value of predicted class is also no. E.g. if actual
class says this passenger did not survive and predicted class tells you the
same thing.

COMPARING ALGORITHM WITH PREDICTION IN THE FORM OF BEST

ACCURACY RESULT

It is important to compare the performance of multiple different

machine learning algorithms consistently and it will discover to create a
test harness to compare multiple different machine learning algorithms in
Python with scikit-learn. It can use this test harness as a template on your
own machine learning problems and add more and different algorithms to
compare. Each model will have different performance characteristics.
Using resampling methods like cross validation, you can get an estimate
for how accurate each model may be on unseen data. It needs to be able
to use these estimates to choose one or two best models from the suite of
models that you have created. When have a new dataset, it is a good idea
to visualize the data using different techniques in order to look at the data
from different perspectives. The same idea applies to model selection. You
should use a number of different ways of looking at the estimated
accuracy of your machine learning algorithms in order to choose the one
or two to finalize. A way to do this is to use different visualization methods
to show the average accuracy, variance and other properties of the
80
distribution of model accuracies.

In the next section you will discover exactly how you can do that in
Python with scikit-learn. The key to a fair comparison of machine learning
algorithms is ensuring that each algorithm is evaluated in the same way
on the same data and it

81
can achieve this by forcing each algorithm to be evaluated on a
consistent test harness.

In the example below 4 different algorithms are compared:

 Logistic Regression
 Random Forest
 Decision Tree Classifier
 Naive Bayes

The K-fold cross validation procedure is used to evaluate each

algorithm, importantly configured with the same random seed to ensure
that the same splits to the training data are performed and that each
algorithm is evaluated in precisely the same way. Before that comparing
algorithm, Building a Machine Learning Model using install Scikit-Learn
libraries. In this library package have to done preprocessing, linear model
with logistic regression method, cross validating by KFold method,
ensemble with random forest method and tree with decision tree
classifier. Additionally, splitting the train set and test set. To predicting the
result by comparing accuracy.

PREDICTION RESULT BY ACCURACY:

Logistic regression algorithm also uses a linear equation with
independent predictors to predict a value. The predicted value can be
anywhere between negative infinity to positive infinity. It need the output
of the algorithm to be classified variable data. Higher accuracy predicting
result is logistic regression model by comparing the best accuracy.

True Positive Rate(TPR) = TP / (TP +

82
FN) False Positive rate(FPR) = FP /

(FP + TN)

83
ACCURACY:The Proportion of the total number of predictions that is
correct otherwise overall how often the model predicts correctly
defaulters and non- defaulters.

ACCURACY CALCULATION:

Accuracy = (TP + TN) / (TP + TN + FP + FN)

Accuracy is the most intuitive performance measure and it is simply a

ratio of correctly predicted observation to the total observations. One may
think that, if we have high accuracy then our model is best. Yes, accuracy
is a great measure but only when you have symmetric datasets where
values of false positive and false negatives are almost same.

PRECISION: The proportion of positive predictions that are actually

correct. Precision = TP / (TP + FP)

Precision is the ratio of correctly predicted positive observations to the

total predicted positive observations. The question that this metric answer
is of all passengers that labeled as survived, how many actually survived?
High precision relates to the low false positive rate. We have got 0.788
precision which is pretty good.

RECALL:The proportion of positive observed values correctly predicted.

(The proportion of actual defaulters that the model will correctly predict)

Recall = TP / (TP + FN)

Recall(Sensitivity) - Recall is the ratio of correctly predicted positive

observations to the all observations in actual class - yes.

F1 Score is the weighted average of Precision and Recall. Therefore, this

score takes both false positives and false negatives into account.
84
Intuitively it is not as easy to understand as accuracy, but F1 is
usually more useful than accuracy,

85
especially if you have an uneven class distribution. Accuracy works best if
false positives and false negatives have similar cost. If the cost of false
positives and false negatives are very different, it‘s better to look at both
Precision and Recall.

General Formula:

F- Measure = 2TP / (2TP + FP + FN)

F1-Score Formula:

F1 Score = 2*(Recall * Precision) / (Recall + Precision)

6.2. ALGORITHM AND TECHNIQUES

6.2.1. ALGORITHM EXPLANATION

In machine learning and statistics, classification is a supervised

learning approach in which the computer program learns from the data
input given to it and then uses this learning to classify new observation.
This data set may simply be bi- class (like identifying whether the person
is male or female or that the mail is spam or non-spam) or it may be
multi-class too. Some examples of classification problems are: speech
recognition, handwriting recognition, bio metric identification, document
classification etc. In Supervised Learning, algorithms learn from labeled
data. After understanding the data, the algorithm determines which label
should be given to new data based on pattern and associating the
patterns to the unlabeled new data.

USED PYTHON PACKAGES:

Sklearn:

86
 In python, sklearn is a machine learning package which include a
lot of ML algorithms.
 Here, we are using some of its modules like
train_test_split, DecisionTreeClassifier or Logistic
Regression and accuracy_score.

87
 NUMPY:
 It is a numeric python module which provides fast maths
functions for calculations.
 It is used to read data in numpy arrays and for manipulation purpose.
PANDAS:
 Used to read and write different files.
 Data manipulation can be done easily with data frames.

MATPLOTLIB:
 Data visualization is a useful way to help with identify the
patterns from given dataset.
 Data manipulation can be done easily with data frames.

6.2.2LOGISTIC REGRESSION

It is a statistical method for analysing a data set in which there are

one or more independent variables that determine an outcome. The
outcome is measured with a dichotomous variable (in which there are only
two possible outcomes). The goal of logistic regression is to find the best
fitting model to describe the relationship between the dichotomous
characteristic of interest (dependent variable = response or outcome
variable) and a set of independent (predictor or explanatory) variables.
Logistic regression is a Machine Learning classification algorithm that is
used to predict the probability of a categorical dependent variable. In
logistic regression, the dependent variable is a binary variable that
contains data coded as 1 (yes, success, etc.) or 0 (no, failure, etc.).

In other words, the logistic regression model predicts P(Y=1) as a

function of
X. Logistic regression Assumptions:
88
 Binary logistic regression requires the dependent variable to be binary.

89
 For a binary regression, the factor level 1 of the dependent
variable should represent the desired outcome.

 Only the meaningful variables should be included.

 The independent variables should be independent of each other.

That is, the model should have little.

 The independent variables are linearly related to the log odds.

 Logistic regression requires quite large sample sizes.

90
MODULE DIAGRAM

GIVEN INPUT EXPECTED OUTPUT

input : data
output : getting accuracy

91
6.2.3. RANDOM FOREST CLASSIFIER

Random forests or random decision forests are an ensemble

learning method for classification, regression and other tasks, that
operate by constructing a multitude of decision trees at training time and
outputting the class that is the mode of the classes (classification) or
mean prediction (regression) of the individual trees. Random decision
forests correct for decision trees‘ habit of over fitting to their training set.
Random forest is a type of supervised machine learning algorithm based
on ensemble learning. Ensemble learning is a type of learning where you
join different types of algorithms or same algorithm multiple times to form
a more powerful prediction model. The random forest algorithm combines
multiple algorithm of the same type i.e. multiple decision trees, resulting in
a forest of trees, hence the name "Random Forest". The random forest
algorithm can be used for both regression and classification tasks.
The following are the basic steps involved in performing the random forest
algorithm:

 Pick N random records from the dataset.

 Build a decision tree based on these N records.
 Choose the number of trees you want in your algorithm and repeat
steps 1 and In case of a regression problem, for a new record, each
tree in the forest predicts a value for Y (output). The final value can
be calculated by taking the average of all the values predicted by all
the trees in forest. Or, in case of a classification problem, each tree
in the forest predicts the category to which the new record belongs.
Finally, the new record is assigned to the category that wins the
majority vote.

92
93
MODULE DIAGRAM

GIVEN INPUT EXPECTED OUTPUT

input : data
output : getting accuracy

6.2.4. DECISION TREE CLASSIFIER

It is one of the most powerful and popular algorithm. Decision-tree

algorithm falls under the category of supervised learning algorithms. It
works for both continuous as well as categorical output variables.
Assumptions of Decision tree:

 At the beginning, we consider the whole training set as the root.

 Attributes are assumed to be categorical for information gain,
attributes are assumed to be continuous.
 On the basis of attribute values records are distributed recursively.
 We use statistical methods for ordering attributes as root or internal
node.

Decision tree builds classification or regression models in the form

of a tree structure. It breaks down a data set into smaller and smaller
subsets while at the same time an associated decision tree is
incrementally developed. A decision node has two or more branches and a
leaf node represents a classification or decision. The topmost decision
node in a tree which corresponds to the best predictor called root node.
Decision trees can handle both categorical and numerical data. Decision
tree builds classification or regression models in the form of a tree

94
structure. It utilizes an if-then rule set which is mutually exclusive and
exhaustive for classification. The rules are learned sequentially using the
training data one at a time. Each time a rule is learned, the tuples covered
by the rules are removed.

95
This process is continued on the training set until meeting a termination
condition. It is constructed in a top-down recursive divide-and-conquer
manner. All the attributes should be categorical. Otherwise, they should
be discretized in advance. Attributes in the top of the tree have more
impact towards in the classification and they are identified using the
information gain concept.A decision tree can be easily over-fitted
generating too many branches and may reflect anomalies due to noise or
outliers.

96
MODULE DIAGRAM

GIVEN INPUT EXPECTED OUTPUT

input : data
output : getting accuracy

97
6.2.5. NAIVE BAYES ALGORITHM:

 The Naive Bayes algorithm is an intuitive method that uses the

probabilities of each attribute belonging to each class to make a
prediction. It is the supervised learning approach you would come
up with if you wanted to model a predictive modeling problem
probabilistically.
 Naive bayes simplifies the calculation of probabilities by assuming
that the probability of each attribute belonging to a given class
value is independent of all other attributes. This is a strong
assumption but results in a fast and effective method.
 The probability of a class value given a value of an attribute is called
the conditional probability. By multiplying the conditional
probabilities together for each attribute for a given class value, we
have a probability of a data instance belonging to that class. To
make a prediction we can calculate probabilities of the instance
belonging to each class and select the class value with the highest
probability.
 Naive Bayes is a statistical classification technique based on Bayes
Theorem. It is one of the simplest supervised learning
algorithms.Naive Bayes classifier is the fast, accurate and reliable
algorithm. Naive Bayes classifiers have high accuracy and speed on
large datasets.
 Naive Bayes classifier assumes that the effect of a particular feature
in a class is independent of other features. For example, a loan
applicant is desirable or not depending on his/her income, previous
loan and transaction history, age, and location.
 Even if these features are interdependent, these features are still
considered independently. This assumption simplifies computation,
and that's why it is considered as naive. This assumption is called
class conditional independence.

98
MODULE DIAGRAM

99
7. CODING AND OUTPUT SCREENS

100
101
102
103
104
105
8. CONCLUSION

The analytical process started from data cleaning and processing,

missing value, exploratory analysis and finally model building and

evaluation. The best accuracy on public test set is higher accuracy score

will be find out. This application can help to find the Prediction of credit

card fraud or not.

8.1 FUTURE WORK

 credit card fraud prediction to connect with cloud model.

 To optimize the work to implement in Artificial Intelligence environment.

106
9. REFERENCES:

• Q. Wu, M. Zhou, Q. Zhu, Y. Xia, and J. Wen, ―MOELS:

Multiobjective evolutionary list scheduling for cloud workflows,‖
IEEE Trans. Autom. Sci. Eng., vol. 17, no. 1, pp. 166–176, Jan.
2020.
• L. Huang, M. Zhou, and K. Hao, ―Non-dominated immune-
endocrine short feedback algorithm for multi-robot maritime
patrolling,‖ IEEE Trans. Intell. Transp. Syst., vol. 21, no. 1, pp. 362–
373, Jan. 2020.
• X. Wang, K. Xing, C.-B. Yan, and M. Zhou, ―A novel MOEA/D for
mul tiobjective scheduling of flexible manufacturing systems,‖
Complexity, vol. 2019, pp. 1–14, Jun. 2019.
• J. J. Liang, S. T. Ma, B. Y. Qu, and B. Niu, ―Strategy adaptative
memetic crowding differential evolution for multimodal
optimization,‖ in Proc. IEEE Congr. Evol. Comput., Jun. 2012, pp.
1–7.
• M. M. H. Ellabaan and Y. S. Ong, ―Valley-adaptive clearing
scheme for multimodal optimization evolutionary search,‖ in
Proc. 9th Int. Conf. Intell. Syst. Design Appl., Nov. 2009, pp. 1–6.
• X. Li, ―Efficient differential evolution using speciation for
multimodal function optimization,‖ in Proc. Conf. Genetic Evol.
Comput. - GECCO, Jun. 2005, pp. 873–880.
• Y. Feng et al., ―Target disassembly sequencing and scheme
evaluation for CNC machine tools using improved multiobjective
ant colony algorithm and fuzzy integral,‖ IEEE Trans. Syst., Man,
Cybern. Syst., vol. 49, no. 12, pp. 2438–2451, Dec. 2019.
• L. Ma, X. Wang, M. Huang, Z. Lin, L. Tian, and H. Chen, ―Two-level
master– slave RFID networks planning via hybrid multiobjective
artificial bee colony optimizer,‖ IEEE Trans. Syst., Man, Cybern. Syst.,
vol. 49, no. 5, pp. 861– 880, May 2019.
• X. Zhang, K. Zhou, H. Pan, L. Zhang, X. Zeng, and Y. Jin, ―A
network reduction-based multiobjective evolutionary algorithm for
community detection in large-scale complex networks,‖ IEEE Trans.
Cybern., vol. 50, no. 2, pp. 703–716, Feb. 2020.
• Q. Fan and X. Yan, ―Solving multimodal multiobjective problems
through zoning search,‖ IEEE Trans. Syst., Man, Cybern. Syst., early

107
 access, Oct. 9, 2019, doi: 10.1109/TSMC.2019.2944338.
• K. Deb and S. Tiwari, ―Omni-optimizer: A procedure for single and
multi- objective optimization,‖ in Proc. 3rd Int. Conf. Evol. Criterion
Optim. Optim. (EMO), Mar. 2005, pp. 47–61.

108
• K. Chan and T. Ray, ―An evolutionary algorithm to maintain
diversity in the parametric and the objective space,‖ in Proc. Int.
Conf. Comput. Robot. Auton. Syst. (CIRAS), 2005, pp. 13–16.
• A. Zhou, Q. Zhang, and Y. Jin, ―Approximating the set of Pareto-
optimal solutions in both the decision and objective spaces by an
estimation of distribution algorithm,‖ IEEE Trans. Evol. Comput., vol.
13, no. 5, pp. 1167– 1189, Oct. 2009.
• Y. Hu et al., ―A self-organizing multimodal multi-objective pigeon
inspired optimization algorithm,‖ Sci. China Inf. Sci., vol. 62, no. 7, Jul.
2019, Art. no. 70206.
• Y. Liu, G. G. Yen, and D. Gong, ―A multimodal multiobjective evolu
tionary algorithm using two-archive and recombination strategies,‖
IEEE Trans. Evol. Comput., vol. 23, no. 4, pp. 660–674, Aug. 2019.
• J. Liang, Q. Guo, C. Yue, B. Qu, and K. Yu, ―A self-organizing multi
objective particle swarm optimization algorithm for multimodal
multi objective problems,‖ in Proc. 9th Int. Conf. Advances Swarm Intell.
(ICSI), Shanghai, China, Jun. 2018, pp. 550–560.
• Y. Wang, Z. Yang, Y. Guo, J. Zhu, and X. Zhu, ―A novel multi
objective competitive swarm optimization algorithm for multi-modal
multi objective problems,‖ in Proc. IEEE Congr. Evol. Comput. (CEC),
Jun. 2019, pp. 271– 278.
• R. Shi, W. Lin, Q. Lin, Z. Zhu, and J. Chen, ―Multimodal multi-
objective optimization using a density-based one-by-one
update strategy,‖ in Proc. IEEE Congr. Evol. Comput. (CEC), Jun.
2019, pp. 295–301
• W. Zhang, G. Li, W. Zhang, J. Liang, and G. G. Yen, ―A cluster
based PSO with leader updating mechanism and ring-topology for
multimodal multi- objective optimization,‖ Swarm Evol. Comput., vol.
50, Nov. 2019, Art. no. 100569.
• R. Tanabe and H. Ishibuchi, ―A framework to handle multi-modal
multi objective optimization in decomposition-based evolutionary
algorithms,‖ IEEE Trans. Evol. Comput., vol. 24, no. 4, pp. 720–734,
Aug. 2020.
• J. Sun, S. Gao, H. Dai, J. Cheng, M. Zhou, and J. Wang, ―Bi-objective
elite differential evolution algorithm for multivalued logic networks,‖
IEEE Trans. Cybern., vol. 50, no. 1, pp. 233–246, Jan. 2020.
• W. Gu, Y. Yu, and W. Hu, ―Artificial bee colony algorithmbased
parameter estimation of fractional-order chaotic system with time
delay,‖ IEEE/CAA J. Automatica Sinica, vol. 4, no. 1, pp. 107–113, Jan.
2017.
• G. Wu, X. Shen, H. Li, H. Chen, A. Lin, and P. N. Suganthan,
―Ensemble of differential evolution variants,‖ Inf. Sci., vol. 423, pp.
172–186, Jan. 2018.
• J. Zhang and A. C. Sanderson, ―Self-adaptive multi-objective
differential evolution with direction information provided by
archived inferior solutions,‖ in Proc. IEEE Congr. Evol. Comput. (World
Congr. Comput. Intell.), Jun. 2008,
109
 pp. 2801–2810.
• X. Qiu, J.-X. Xu, K. C. Tan, and H. A. Abbass, ―Adaptive cross
generation differential evolution operators for multiobjective opti
mization,‖ IEEE Trans. Evol. Comput., vol. 20, no. 2, pp. 232–244, Apr.
2016.
• J. J. Liang, B. Y. Qu, D. W. Gong, and C. T. Yue, ―Problemdefinitions
and evaluation criteria for the CEC 2019 specialsession on
multimodal

110
 multiobjective optimization,‖ Comput. Intell. Lab., Zhengzhou Univ.,
Zhengzhou, China, Tech. Rep., 2019.
• C. Yue, B. Qu, K. Yu, J. Liang, and X. Li, ―A novel scalable test
problem suite for multimodal multiobjective optimization,‖ Swarm
Evol. Comput., vol. 48, pp. 62–71, Aug. 2019.
• S. Gao, M. Zhou, Y. Wang, J. Cheng, H. Yachi, and J. Wang, ―Den
dritic neuron model with effective learning algorithms for
classification, approximation, and prediction,‖ IEEE Trans. Neural
Netw. Learn. Syst., vol. 30, no. 2, pp. 601–614, Feb. 2019.
• L. Zheng, G. Liu, C. Yan, and C. Jiang, ―Transaction fraud detection
based on total order relation and behavior diversity,‖ IEEE Trans.
Comput. Social Syst., vol. 5, no. 3, pp. 796–806, Sep. 2018.

111