Scribd
Upload
5 views

Unit 3 Machine learning (1)

Uploaded by

Priti Dhekne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Unit 3 Machine learning (1)

Uploaded by

Priti Dhekne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Machine Learning.

• Human’s knowledge is only obtained by the


experience throughout their life. For
machines those knowledge is need to be fed,
by collecting enormous amount of data on a
certain application and fed to it, machines
also obtains the knowledge in short period of
time.

• There are three types of Machine Learning

 Supervised
 Unsupervised
 Reinforcement
Supervised Learning.
SUPERVISED LEARNING.
CLASSIFICATION PREDICTION/REGRESSION
• Predictive modeling problem where a class • It allow us to predict a continuous outcome
label is predicted for a given example of input variable (y) based on the value of one or
data. multiple predictor variables (x). Briefly, the
• Given an example, classify if it is spam or not. goal of regression model is to build a
Given a handwritten character, classify it as mathematical equation that defines y as a
one of the known characters. function of the x variables.
• Continuous rather than discrete
CLASSIFICATION PREDICTIVE MODELLING - SUPERVISED LEARNING.

Binary Classification - Classification tasks that have


two class labels IMAGE CLASSIFICATION
Multi-Class Classification - Classification tasks that
have more than two class labels. HAND GESTURE & LEAF DISEASE
Multi-Label Classification - classification tasks that
have two or more class labels, where one or more
class labels may be predicted for each example.
OBJECT RECOGNITION

Imbalanced Classification - classification tasks


where the number of examples in each class is
unequally distributed.
ROAD SIGN
REGRESSION -SUPERVISED LEARNING.
Linear regression - Linear regression performs the
task to predict a dependent variable value (y) based
on a given independent variable (x). So, this
regression technique finds out a linear relationship
between x (input) and y(output).

Logistic regression - Logistic regression is a


classification algorithm used to assign
observations to a discrete set of classes.
It has activation Function
Ex: Email spam or not spam, Online transactions
Fraud or not Fraud, Tumor Malignant or Benign.
Logistic regression transforms its output using the
logistic sigmoid function to return a probability
value.
REGRESSION TYPES - SUPERVISED LEARNING.
Linear regression
• Simple Linear-Regression
• Univariate Linear Regression
• Multiple Linear Regression
• Locally weighted Linear Regression

Polynomial regression
• Linear regression
• Relationship between the independent variable x and dependent variable y is
modeled as an nth degree polynomial.
• Polynomial regression fits a nonlinear relationship between the value of x and
the corresponding conditional mean of y, denoted E(y |x)
 Growth rate of tissues.
 Progression of disease epidemics

Softmax regression
• Generalized Logistic regression
• It handles Multiple classes
SUPPORT VECTOR MACHINES SUPERVISED LEARNING.
• An SVM model is a representation of the examples as points
in space, mapped so that the examples of the separate
categories are divided by a clear gap that is as wide as
possible.

• In addition to performing linear classification, SVMs can


efficiently perform a non-linear classification, implicitly
mapping their inputs into high-dimensional feature spaces.

• It is discriminative classifier formally defined by a


separating hyperplane.
DECISION TREE - SUPERVISED LEARNING.
• Decision tree is the most powerful and popular tool for
classification and prediction.

• A Decision tree is a flowchart like tree structure

• Each internal node denotes a test on an attribute, each


branch represents an outcome of the test, and each leaf
node (terminal node) holds a class label.

• A tree can be learned by splitting the source set into


subsets based on an attribute value test.
RANDOM FOREST - SUPERVISED LEARNING.
• Every decision tree has high variance, but when we
combine all of them together in parallel then the resultant
variance is low as each decision tree gets perfectly trained
on that particular sample data

• hence, output doesn’t depend on one decision tree but


multiple decision trees.

• In the case of a classification problem, the final output is


taken by using the majority voting classifier.

• In the case of a regression problem, the final output is the


mean of all the outputs. This part is Aggregation.
Unsupervised Learning.
CLUSTERRING - UNSUPERVISED LEARNING.

• Set of inputs is to be divided into groups.

• The groups are not known beforehand, whereas


classification knows
K-Means CLUSTERRING - UNSUPERVISED LEARNING.
• Randomly select ‘c’ cluster centers.

• Calculate the distance between each data point and


cluster centers.

• Assign the data point to the cluster center whose


distance from the cluster center is minimum of all the
cluster centers..

• Recalculate the new cluster center

• Recalculate the distance between each data point and


new obtained cluster centers.

• If no data point was reassigned then stop, otherwise


repeat from step 3).
Reinforcement Learning.
REINFORCEMENT LEARNING.
• It is about taking suitable action to maximize reward in
a particular situation.

• It is employed by various software and machines to find


the best possible behavior or path it should take in a
specific situation.

• Output depends on the state of the current input and


the next input depends on the output of the previous
input

 Positive
 Negative

You might also like