MACHINE LEARNING

CHAPTER-1

INTRODUCTION
 Machine Learning

• In the real world, we are surrounded by humans

who can learn everything from their experiences
with their learning capability, and we have
computers or machines which work on our
instructions.

• But can a machine also learn from experiences or

past data like a human does?
 Machine Learning Cont..
• Machine Learning is said as a subset of artificial
intelligence that is mainly concerned with the
development of algorithms which allow a
computer to learn from the data and past
experiences on their own.

• The term machine learning was first introduced

by Arthur Samuel in 1959. We can define it in a
summarized way as:

• “Machine learning enables a machine to

automatically learn from data, improve
performance from experiences, and predict
 How does Machine Learning work
• With the help of sample historical data, which is
known as training data, machine learning algorithms
build a mathematical model that helps in making
predictions or decisions without being explicitly
programmed.

• Machine learning brings computer science and

statistics together for creating predictive models.
Machine learning constructs or uses the algorithms
that learn from historical data.

• The more we will provide the information, the higher

will be the performance.
Well-Posed Learning
Problems
 Well-Posed Learning Problems
In 1997, Tom Mitchell gave a “well-posed” definition that has
proven more useful to engineering types: “A computer program
is said to learn from experience E with respect to some task T
and some performance measure P, if its performance on T, as
measured by P, improves with experience E.”

Examples:

• A checkers learning problem

– Task T : playing checkers
– Performance measure P : percent of games won against
opponents
– Training experience E : playing practice games against itself
• A handwriting recognition learning problem
– Task T : recognizing and classifying handwritten words
within images
– Performance measure P : percent of words correctly
classified
– Training experience E : a database of handwritten words
with given classifications

• A robot driving learning problem

– Task T : driving on public four-lane highways using vision
sensors
– Performance measure P : average distance traveled before
an error (as judged by human overseer)
– Training experience E : a sequence of images and steering
Designing a Learning
System
Designing a Learning System
 1. Choosing the Training Experience
• The first design choice is to choose the type of training
experience from which the system will learn.
• The type of training experience available can have a
significant impact on success or failure of the learner.

Below are the attributes which will impact on Success and

Failure of Data:

1) The training experience will be able to provide direct or

indirect feedback regarding choices. For example: While
Playing chess the training data will provide feedback to itself
like instead of this move if this is chosen the chances of
success increases.
• Second important attribute is the degree to which the
learner will control the sequences of training examples.
For example: when training data is fed to the machine then at
that time accuracy is very less but when it gains experience
while playing again and again with itself or opponent the
machine algorithm will get feedback and control the chess
game accordingly.

• Third important attribute is how it will represent the

distribution of examples over which performance will be
measured.
For example, a Machine learning algorithm will get experience
while going through a number of different cases and different
examples. Thus, Machine Learning Algorithm will get more and
more experience by passing through more and more examples
and hence its performance will increase.
 2. Choosing the Target Function
The next design choice is to determine exactly what
type of knowledge will be learned and how this will
be used by the performance program.

For example : While playing chess with the

opponent, when opponent will play then the
machine learning algorithm will decide what be the
number of possible legal moves taken in order to
get success.
 3. Choosing a Representation for the Target Function
• When the machine algorithm will know all the possible
legal moves the next step is to choose the optimized
move using any representation i.e. using linear
Equations, Hierarchical Graph Representation, Tabular
form etc.
• The Next Move function will move the Target move like
out of these move which will provide more success rate.

For Example : while playing chess machine have 4 possible

moves, so the machine will choose that optimized move
which will provide success to it.
 4. Choosing a Function Approximation Algorithm

• An optimized move cannot be chosen just with the

training data.

• The training data had to go through with set of

example and through these examples the training
data will approximates which steps are chosen and
after that machine will provide feedback on it.
 5. The Final Design

The final design is created at last when system goes from

number of examples , failures and success , correct and
incorrect decision and what will be the next step etc.
Issues in Machine
Learning
 Issues in Machine Learning
• What algorithms exist for learning general target
functions from specific training examples ?
• How does the number of training examples
influence accuracy ?
• When and how can prior knowledge held by the
learner guide the process of generalizing from
examples ?
 Issues in Machine Learning Cont..
• What is the best strategy for choosing a useful
next training experience, and how does the
choice of this strategy alter the complexity of
the learning problem ?
• What is the best way to reduce the learning task
to one or more function approximation
problems ?
• How can the learner automatically alter its
representation to improve its ability to represent
and learn the target function?
 Types
of
Machine Learning
 1. Supervised Learning
• Supervised Learning is the one, where you can
consider the learning is guided by a teacher. We
have a dataset which acts as a teacher and its role
is to train the model or the machine.
• Once the model gets trained it can start making a
prediction or decision when new data is given to
it.
• Supervised machine learning is based on
supervision. It means in the supervised learning
technique, we train the machines using the
"labelled" dataset, and based on the training, the
machine predicts the output.
• The labelled data specifies that some of the inputs are
already mapped to the output.
• More preciously, we can say; first, we train the
machine with the input and corresponding output, and
then we ask the machine to predict the output using
the test dataset.
 2. Unsupervised Learning
• Unsupervised learning is very much the opposite
of supervised learning.
• It features no labels. Instead, our algorithm
would be fed a lot of data and given the tools to
understand the properties of the data.
• From there, it can learn to group, cluster, and/or
organize the data in a way such that a human (or
other intelligent algorithm) can come in and
make sense of the newly organized data.
The main aim of the unsupervised learning algorithm is to group or
categories the unsorted dataset according to the similarities,
patterns, and differences. Machines are instructed to find the hidden
patterns from the input dataset.
 3. Semi-Supervised Learning

• Semi-Supervised learning is a type of Machine

Learning algorithm that lies between Supervised
and Unsupervised machine learning.

• It represents the intermediate ground between

Supervised (With Labelled training data) and
Unsupervised learning (with no labelled training
data) algorithms and uses the combination of
labelled and unlabeled datasets during the
training period.
 3. Semi-Supervised Learning Example:

• We can imagine these algorithms with an

example. Supervised learning is where a student
is under the supervision of an instructor at home
and college.
• Further, if that student is self-analysing the same
concept without any help from the instructor, it
comes under unsupervised learning.
• Under semi-supervised learning, the student has
to revise himself after analyzing the same
concept under the guidance of an instructor at
college.
 4. Reinforcement Learning
• Reinforcement learning works on a feedback-
based process, in which an AI agent (A software
component) automatically explore its surrounding
by hitting & trail, taking action, learning from
experiences, and improving its performance.
• Agent gets rewarded for each good action and get
punished for each bad action; hence the goal of
reinforcement learning agent is to maximize the
rewards.
• In reinforcement learning, there is no labelled data
like supervised learning, and agents learn from
their experiences only.
 Learning Association
• Association rule learning is a type of unsupervised
learning technique that checks for the dependency of
one data item on another data item and maps
accordingly so that it can be more profitable.
• It tries to find some interesting relations or
associations among the variables of dataset.
• It is based on different rules to discover the
interesting relations between variables in the
database.
• The association rule learning is one of the very
important concepts of machine learning, and it is
employed in Market Basket analysis, Web usage
mining, continuous production, etc.
 Learning Association Example:
• Market basket analysis is a technique used by the various big
retailer to discover the associations between items. We can
understand it by taking an example of a supermarket, as in a
supermarket, all products that are purchased together are put
together.
• For example, if a customer buys bread, he most likely can also buy
butter, eggs, or milk, so these products are stored within a shelf or
mostly nearby. Consider the below diagram: