Unit 5

Machine Learning
• Arthur Samuel, an early American leader in
the field of computer gaming and artificial
intelligence, coined the term “Machine
Learning ” in 1959 while at IBM.
• He defined machine learning as “the field of
study that gives computers the ability to learn
without being explicitly programmed “.
• Machine learning is a subfield of artificial
intelligence that involves the development of
algorithms and statistical models that enable
computers to improve their performance in
tasks through experience.
• These algorithms and models are designed to
learn from data and make predictions or
decisions without explicit instructions.
• Is the application of AI that provides systems the
ability to automatically learn and improve
experience without being explicitly programmed.
• Traditional Programming: Data and program is run
on the computer to produce the output.
• Machine Learning: Data and output is run on the
computer to create a program. This program can be
used in traditional programming.
 Features of Machine learning
• Machine learning is data driven technology.
• Large amount of data generated by organizations on
daily bases. So, by notable relationships in data,
organizations makes better decisions.
• Machine can learn itself from past data and
automatically improve.
• From the given dataset it detects various patterns on
data.
• For the big organizations branding is important and it
will become more easy to target relatable customer
base.
• It is similar to data mining because it is also deals with
the huge amount of data.
 Examples of Machine Learning Application

1. Spam filtering: identify email messages as spam or non-spam.

2. Medical diagnosis: diagnose a patient as a sufferer or non-
sufferer of some disease.
3. Customer segmentation: predict, for instance, which
customers will respond to a particular promotion.
4. Face detection: find faces in images (or indicate if a face is
present).
5. Topic spotting(classification): categorizing news articles,
as to whether they are about politics, sports, entertainment,
etc.
6. Weather prediction: predict, for instance, whether or not it will
rain tomorrow.
 Learning
Definition of learning:
• A computer program is said to learn from
experience E with respect to some class of
tasks T and performance measure P, if its
performance at tasks T, as measured by P,
improves with experience E.
• A computer program which learns from
experience is called a machine learning
program or simply a learning program .
Examples
• Handwriting recognition learning problem

– Task T : Recognizing and classifying handwritten words

within images
– Performance P : Percent of words correctly classified
– Training experience E : A dataset of handwritten words
with given classifications
• A robot driving learning problem
– Task T : Driving on highways using vision sensors
– Performance P : Average distance traveled before an
error
– Training experience E : A sequence of images and steering
commands recorded while observing a human driver
 Types of Learning

There are four types of machine learning:

• Supervised learning: (also called inductive learning)
Training data includes desired outputs. This is spam
this is not, learning is supervised.
• Unsupervised learning: Training data does not
include desired outputs. Example is clustering. It is
hard to tell what is good learning and what is not.
• Semi-supervised learning: Training data includes a
few desired outputs.
• Reinforcement learning: Rewards from a sequence
of actions. AI types like it, it is the most ambitious
type of learning.
 Supervised Machine Learning
• The majority of practical machine learning uses supervised learning.
• Supervised learning is where you have input variables (x) and an
output variable (Y) and you use an algorithm to learn the mapping
function from the input to the output.
• 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.
• It is called supervised learning because the process of an algorithm
learning from the training dataset can be thought of as a teacher
supervising the learning process.
• We know the correct answers, the algorithm iteratively makes
predictions on the training data and is corrected by the teacher.
• Learning stops when the algorithm achieves an acceptable level of
performance.
• Example of Supervised Learning
Suppose there is a basket which is filled with
some fresh fruits, the task is to arrange the
same type of fruits at one place.
The fruits are apple, banana, cherry, grape etc.
• Suppose one already knows from
their previous work (or experience) that, the
shape of each and every fruit present in the
basket so, it is easy for them to arrange the
same type of fruits in one place.
• Supervised learning problems can be further grouped into
regression and classification problems.
– Classification: A classification problem is when the output variable is
a category, such as “red” or “blue” or “disease” and “no disease”.
– Regression: A regression problem is when the output variable is a
real value, such as “dollars” or “weight”.
There are various algorithms in supervised learning:
• Linear Regression
• Multiple Linear Regression
• Logistic Regression
• Decision Tree

• Regression Tree
• Time Series Analysis
• KNN
• SVM(Support Vector Machine)
 Unsupervised Machine Learning
• Unsupervised learning is where you only have
input data (X) and no corresponding output
variables.
• The goal for unsupervised learning is to model the
underlying structure or distribution in the data in
order to learn more about the data.
• These are called unsupervised learning because
unlike supervised learning above there is no
correct answers and there is no teacher.
Algorithms are left to their own devises to discover
and present the interesting structure in the data.
 Example of Unsupervised Learning
• Suppose there is a basket and it is filled with some fresh fruits.
The task is to arrange the same type of fruits at one place.
• This time there is no information about those fruits
beforehand, its the first time that the fruits are being seen or
discovered
So how to group similar fruits without any prior knowledge
about those.
• First, any physical characteristic of a particular fruit is
selected. Suppose color.
Then the fruits are arranged on the basis of the color. The
groups will be something as shown below:
• RED COLOR GROUP: apples & cherry fruits.
• GREEN COLOR GROUP: bananas & grapes.
• So now, take another physical character say,
size, so now the groups will be something like
this.
RED COLOR AND BIG SIZE: apple.
RED COLOR AND SMALL SIZE: cherry fruits.
GREEN COLOR AND BIG SIZE: bananas.
GREEN COLOR AND SMALL SIZE: grapes.
The job is done!
• Here, there is no need to know or learn
anything beforehand. That means, no train data
and no response variable. This type of learning
is known as Unsupervised Learning.
• Unsupervised learning problems can be further
grouped into clustering and association problems.
–Clustering: A clustering problem is where you want to
discover the inherent groupings in the data, such as
grouping customers by purchasing behavior.
– Association: An association rule learning problem is
where you want to discover rules that describe large
portions of your data, such as people that buy X also tend
to buy Y.
• Some popular examples of unsupervised learning
algorithms are:
–PCA
–K Means Clustering
– Hierarchical Clustering
– Apriori
 SUPERVISED UNSUPERVISED

Uses Known and

Input Data Labeled Data as input Uses Unknown Data as input

Computational
Complexity Very Complex Less Computational Complexity

Real Time Uses off-line analysis Uses Real Time Analysis of Data

Number of
Classes Classes are known Classes are not known

Accuracy of Accurate and Reliable Moderate Accurate and Reliable

Results Results Results
Sub-domains Classification and Clustering and Association rule
regression mining
 Semi-supervised learning

• Semi-supervised learning falls between

unsupervised learning and supervised learning.
• Semi-supervised learning is an approach to
machine learning that combines small labeled
data with a large amount of unlabeled data
during training
• is particularly useful when there is a large
amount of unlabeled data available, but it’s too
expensive or difficult to label all of it.
• It is similar to where a teacher teaches a few
concepts in class and gives questions as
homework which are based on similar concepts.
• The most basic disadvantage of any
Supervised Learning algorithm is that the dataset
has to be hand-labeled either by a Machine Learning
Engineer or a Data Scientist. This is a very costly
process, especially when dealing with large volumes
of data.
• The most basic disadvantage of any
Unsupervised Learning is that its application
spectrum is limited.
• To counter these disadvantages, the concept of
Semi-Supervised Learning was introduced.
• In this type of learning, the algorithm is trained
upon a combination of labeled and unlabelled data.
● Typically, this combination will contain a very
small amount of labeled data and a very large
amount of unlabelled data.
● The basic procedure involved is that first, the
programmer will cluster similar data using an
unsupervised learning algorithm and then use
the existing labeled data to label the rest of the
unlabelled data.
● The acquisition of unlabelled data is relatively
cheap while labeling the said data is very
expensive.
Examples of Semi-Supervised Learning

● Text classification: In text classification, the goal is to

classify a given text into one or more predefined
categories.
● Image classification: In image classification, the goal is
to classify a given image into one or more predefined
categories.
● Anomaly detection: In anomaly detection, the goal is
to detect patterns or observations that are unusual or
different from the norm
Applications of Semi-Supervised Learning

1. Speech Analysis: Since labeling audio files is a very intensive task,

Semi-Supervised learning is a very natural approach to solve this
problem.
2. Internet Content Classification: Labeling each webpage is an
impractical and unfeasible process and thus uses Semi-Supervised
learning algorithms. Even the Google search algorithm uses a variant
of Semi-Supervised learning to rank the relevance of a webpage for a
given query.
3. Protein Sequence Classification: Since DNA strands are typically very
large in size, the rise of Semi-Supervised learning has been imminent
in this field.
 Reinforcement learning
• Reinforcement learning directly takes inspiration from how human
beings learn from data in their lives.
• It features an algorithm that improves upon itself and learns from
new situations using a trial-and-error method.
• Favourable outputs are encouraged or ‘reinforced’, and non-
favorable outputs are discouraged or ‘punished’.
• Based on the psychological concept of conditioning, reinforcement
learning works by putting the algorithm in a work environment
with an interpreter and a reward system.
• In every iteration of the algorithm, the output result is given to the
interpreter, which decides whether the outcome is favourable or
not.
Machine Learning is the field of study
that gives computers the capability to
learn without Machine-learning tasks
Classification:
• Supervised Task
• When inputs are divided into two or more
classes, the learner must produce a model
that assigns unseen inputs to one or more
(multi-label classification) of these classes.
• Spam filtering is an example of
classification, where the inputs are email (or
other) messages and the classes are
“spam” and “not spam”.
Regression:
• a supervised task.
• To predict the output based on input values
• A case when the outputs are continuous rather
than discrete.
Clustering:
• An unsupervised task.
• When a set of inputs is to be divided into
groups.
• Unlike in classification, the groups are not
known beforehand