COLLOQUIUM EVALUATION

MACHINE LEARNING

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

TO:KANIKA GUPTA MA’AM

BHAVYA SETHI

16csu082

1
 CONTENTS

S.No. TOPIC PAGE NO.

1 Definition of machine learning 3

2 Types of machine learning 4-8

3 Algorithms in machine learning 9-12

2
What is Machine
Learning? A definition
Machine learning is an application of artificial
intelligence (AI) that provides systems the ability to
automatically learn and improve from experience
without being explicitly programmed. Machine
learning focuses on the development of computer
programs that can access data and use it learn for
themselves.
The process of learning begins with observations or
data, such as examples, direct experience, or
instruction, in order to look for patterns in data and
make better decisions in the future based on the
examples that we provide. The primary aim is to
allow the computers learn automatically without
human intervention or assistance and adjust actions
accordingly.

3
TYPES OF LEARNING
1. Supervised learning as the name indicates the
presence of a supervisor as a teacher. Basically
supervised learning is a learning in which we teach or
train the machine using data which is well labeled that
means some data is already tagged with the correct
answer. After that, the machine is provided with a new
set of examples(data) so that supervised learning
algorithm analyses the training data(set of training
examples) and produces a correct outcome from
labeled data.
For instance, suppose you are given a basket filled with
different kinds of fruits. Now the first step is to train the
machine with all different fruits one by one like this:

 If shape of object is rounded and depression

at top having color Red then it will be
labelled as –Apple.

4
  If shape of object is long curving cylinder having
color Green-Yellow then it will be labelled as –
Banana.
Now suppose after training the data, you have given a new
separate fruit say Banana from basket and asked to identify it.

Since the machine has already learned the things from previous
data and this time have to use it wisely. It will first classify the
fruit with its shape and color and would confirm the fruit name
as BANANA and put it in Banana category. Thus the machine
learns the things from training data(basket containing fruits)
and then apply the knowledge to test data(new fruit).

Supervised learning classified into two categories of algorithms:

 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”.

5
 2. Unsupervised learning is the training of machine using
information that is neither classified nor labeled and
allowing the algorithm to act on that information without
guidance. Here the task of machine is to group unsorted
information according to similarities, patterns and
differences without any prior training of data.

Unlike supervised learning, no teacher is provided that means

no training will be given to the machine. Therefore machine is
restricted to find the hidden structure in unlabeled data by our-
self.
For instance, suppose it is given an image having both dogs and
cats which have not seen ever.

Thus the machine has no idea about the features of dogs and
cat so we can’t categorize it in dogs and cats. But it can
categorize them according to their similarities, patterns, and
differences i.e., we can easily categorize the above picture into
two parts. First first may contain all pics having dogs in it and
second part may contain all pics having cats in it. Here you
didn’t learn anything before, means no training data or
examples.
Unsupervised learning classified into two categories of
algorithms:

6
  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.

3. Semi-supervised machine learning algorithms fall

somewhere in between supervised and unsupervised
learning, since they use both labeled and unlabeled
data for training – typically a small amount of labeled
data and a large amount of unlabeled data. The
systems that use this method are able to considerably
improve learning accuracy. Usually, semi-supervised
learning is chosen when the acquired labeled data
requires skilled and relevant resources in order to train it /
learn from it. Otherwise, acquiringunlabeled data
generally doesn’t require additional resources.

7
4. Reinforcement machine learning
algorithms is a learning method that
interacts with its environment by
producing actions and discovers
errors or rewards. Trial and error
search and delayed reward are the
most relevant characteristics of
reinforcement learning. This method
allows machines and software agents
to automatically determine the ideal
behavior within a specific context in
order to maximize its performance.
Simple reward feedback is required
for the agent to learn which action is
best; this is known as the
reinforcement signal.
8
TYPES OF ALGORITHMS

1. REGRESSION

What is linear regression?

Linear regression looks at the relationship between

the data you have and data you want to predict.

The variable that the equation in your linear

regression model is predicting is called
the dependent variable. We call that one y. The
variables that are being used to predict the
dependent variable are called the independent
variables. We call them X.
In simple linear regression analysis, each
observation consists of two variables. These are
the independent variable and the dependent
variable. Multiple regression analysis looks at
two or more independent variables and how
they correlate to the independent variable.
Y=b1+b2*X (Equation LinearRegression)

9
 2. CLUSTERING
In basic terms, the objective of clustering is to
find different groups within the elements in the
data. To do so, clustering algorithms find the
structure in the data so that elements of the
same cluster (or group) are more similar to each
other than to those from different clusters.

K-Means Clustering
K-Means algorithms are extremely easy to
implement and very efficient computationally
speaking. Those are the main reasons that
explain why they are so popular. But they are
not very good to identify classes when dealing
with in groups that do not have a spherical
distribution shape.

Key Concepts

 Squared Euclidean Distance

10
The most commonly used distance in K-Means is the
squared Euclidean distance.

D(x,y)=(x1-x2)*(x1-x2)

Algorithm Steps

1. First, we need to choose k, the number of clusters

that we want to be finded.
2. Then, the algorithm will select randomly the the
centroids of each cluster.
3. It will be assigned each datapoint to the closest
centroid (using euclidean distance).
4. It will be computed the cluster inertia.
5 .The new centroids will be calculated as the mean of
the points that belong to the centroid of the previous
step. In other words, by calculating the minimum
quadratic error of the datapoints to the center of each
cluster, moving the center towards that point

6. Back to step 3.

11
 3.ASSOCIATION
In this Association rule mining if a person buys a
product then another product that is complement
of first product appears in the wish list.
e.g-if a person buys mobile phone online then he
might get a wish list containing items such as back
cover,earphones,power bank and many more
items.
It is a part of unsupervised learning technique.

An association rule has two parts: an

antecedent (if) and a consequent (then). An
antecedent is an item found within the data. A
consequent is an item found in combination
with the antecedent.

4.CLASSIFICATION

Logistic RegressionWhen it comes to classification, we are

determining the probability of an observation to be part of a
certain class or not. Therefore, we wish to express the
probability with a value between 0 and 1.

12