Examples of Various Learning Paradigms: Introduction To Machine Learning
Examples of Various Learning Paradigms: Introduction To Machine Learning
Examples of Various Learning Paradigms: Introduction To Machine Learning
Gmail
Paypal
Google Maps
online credit card fraud to soar to a
Uber whopping $32 billion in 2020
Workflow
Categorie
s
• Supervised Learning
• Unsupervised Learning
• Semi-Supervised
Learning
• Reinforcement Learning
Supervised
• Learning
the correct classes of the training data
are known
Credit: http://us.hudson.com/legal/blog/postid/513/predictive-analytics-artificial-intelligence-science-fiction-e-discovery-truth
Unsupervised
• Learning
the correct classes of the training data are
not known
Credit: http://us.hudson.com/legal/blog/postid/513/predictive-analytics-artificial-intelligence-science-fiction-e-discovery-truth
Semi-Supervised
• A MixLearning
of Supervised and Unsupervised
learning
Credit: http://us.hudson.com/legal/blog/postid/513/predictive-analytics-artificial-intelligence-science-fiction-e-discovery-truth
Reinforcement
• allows Learning
the machine or software agent to learn its
behavior based on feedback from the
environment.
• This behavior can be learnt once and for all, or keep
on adapting as time goes by.
Credit: http://us.hudson.com/legal/blog/postid/513/predictive-analytics-artificial-intelligence-science-fiction-e-discovery-truth
Machine Learning
Techniques
Techniques
• classification: predict class from
observations
• clustering: group observations
into “meaningful” groups
• regression (prediction): predict value
from observations
Classificatio
• n into a predefined category.
classify a document
• documents can be text, images
• Popular one is Naive Bayes Classifier.
• Steps:
– Step1 : Train the program (Building a Model) using a
training set with a category for e.g. sports, cricket,
news,
– Classifier will compute probability for each word, the
probability that it makes a document belong to each
of considered categories
– Step2 : Test with a test data set against this Model
• http://en.wikipedia.org/wiki/Naive_Bayes_classifie
r
Regressio
n
• is a measure of the relation between the mean
value of one variable (e.g. output) and
corresponding values of other variables (e.g. time
and cost).
• regression analysis is a statistical process for
estimating the relationships among
variables.
• Regression means to predict the output
value using training data.
• Popular one is Logistic regression (binary
regression)
• http://en.wikipedia.org/wiki/Logistic_regres
sion
Classification vs
• Regression
Classification means • Regression means
to group the output to predict the
into a class. output value using
• classification to training data.
predict the type of • regression to
tumor i.e. harmful or predict the house
not harmful using price from training
training data data
• if it is • if it is a real
discrete/categorical number/continuous
variable, then it is , then it is
classification regression problem.
problem
Clusterin
• g of grouping a set of objects
clustering is the task
in such a way that objects in the same group
(called a cluster) are more similar to each other
• objects are not predefined
• For e.g. these keywords
– “man’s shoe”
– “women’s shoe”
– “women’s t-shirt”
– “man’s t-shirt”
– can be cluster into 2 categories “shoe” and “t-shirt”
or “man” and “women”
• Popular ones are K-means clustering and
Hierarchical clustering
K-means
• Clustering
partition n observations into k clusters in which each observation
belongs to the cluster with the nearest mean, serving as a prototype of
the cluster.
• http://en.wikipedia.org/wiki/K-means_clustering
http://pypr.sourceforge.net/kmeans.html
Hierarchical
• method clustering
of cluster analysis which seeks to
build a hierarchy of clusters.
• There can be two strategies
– Agglomerative:
• This is a "bottom up" approach: each observation starts in its
own cluster, and pairs of clusters are merged as one moves up
the hierarchy.
• Time complexity is O(n^3)
– Divisive:
• This is a "top down" approach: all observations start in one
cluster, and splits are performed recursively as one moves down
the hierarchy.
• Time complexity is O(2^n)
• http://en.wikipedia.org/wiki/Hierarchical_clustering