Machine Learning 1

MACHINE LEARNING
Group no: 13
Ajudiya Jemin 190220131002

Chavda Sudhir 190220131064
Chaidhari deep 190220131009
Patel Gaurav 190220131006
Patel harsh 190220131066
1.Introduction
2.Use of python in machine learning
3.Types of machine learning and algorithms
4.Concepts of learning in ML system
5.Application of Machine Learning
6.Conclusion
INTRODUCTION OF MACHINE
LEARNING
• Machine learning is application of artificial intelligence that
provides system the ability to automatically learn and improve
from experience without being explicitly programmed. Machine
learning focused on the development of computer programs that
can access data.
AI AND ML
• ML is a subset of AI.
• ML refers to system that can learn by themselves. It is a self learner.
HAW MACHINE LEARNING WORKS
PYTHON IN MACHINE LEARNING
• It’s easy to understand and allows for quick data validation.

• it has great library ecosystem
• Pandas: high level data structure analysis
• Keras: for deep learning
• Matplotlib: to create 2D pots
• State models: statical algorithm, data exploration
• A law entry barrier

• Flexible, versatile, easy to read, popularity, huge community
Types of machine learning
SUPERVISED LEARNING
• Supervised learning uses

classification algorithms and
regression techniques to
develop predictive models
• Classification separate the
data, Regression fits the data
ALGORYTHM OF SUPERVISED
• Linear regression
• Logistic regression
• Decision tree
• Random forest
• Naïve bayes classifier
LINEAR REGRESSION
• Regression models a target prediction

value based on independent variables.
• It is mostly used for finding out the
relationship between variables and
forecasting.
• Different regression model based on
dependent and independent variables,
they are considering and the number
of independent variables being used.
LOGISTIC REGRESSION
• Logistic regression is supervised

classification algorithm to predict
probability of a target variable.
• The nature of target or dependent variable is
dichotomous, which means there would be
only two possible classes
• In simple word the dependent variable in
binary in nature having data coded as either
1 (stand for success/yes) or 0 (stand for
failure/no).
DECISION TREE
• Decision tree uses the tree

representation to solve the problem
in which each leaf node corresponds
to a class label and attributes are
represented on the internal node of
the tree.
• We can represent any Boolean
function on discrete attributes. (Outlook = Rain, Temperature = Hot, Humidity = High,
Wind = Strong )
RANDOM FOREST
• A random forest is an ensemble technique

capable of performing both regression
and classification tasks with the use of
multiple decision tree and a technique
called Bootstrap Aggression, commonly
known as bagging.
• The basic idea behind this is to combine
multiple decision tree in determining the
final output rather than relying on
individual decision tree
• Advantage:
• Random forests is considered as a highly accurate and robust method
because of the number of decision trees participating in the process.
• The algorithm can be used in both classification and regression
problems.
• Disadvantage:
• The model is difficult to interpret compared to a decision tree, where you
can easily make a decision by following the path in the tree.
NAIVE BAYES CLASSIFIER
• Naïve bayes classifiers area a collection of classification algorithm based on

Bayes’ Theorem
• It is not a single algorithm but a family of algorithms where all of them share
a common principle, i.e. every pair of features being classified is independent
of each other.
• Bayes' theorem finds the probability of an event occurring given the
probability of another event that has already occurred.
• Basically we are trying to find probability of event A, given the event Bis
true. Even B is also termed as evidence.
• P(A) is the priori of A (the prior probability, i.e. Probability of event before
evidence is seen). The evidence is attributes value of an unknown instance
(here, it is event B).
• P(A|B) is a posteriori probability of B i.e. probability of event after evidence
is seen.
• P(Yes | Sunny) = P( Sunny | Yes) * P(Yes) / P (Sunny)
• Here we have P (Sunny |Yes) = 3/9 = 0.33, P(Sunny) = 5/14 = 0.36, P( Yes)= 9/14 =
0.64
Now, P (Yes | Sunny) = 0.33 * 0.64 / 0.36 = 0.60, which has higher probability.

UNSUPERVISED LEARNING
• Unsupervised learning is a machine learning technique, where

you do not need to supervise the model. Instead, you ned to
allow the model to work on its own to discover information. It
mainly deals with the unlabelled data.
• Unsupervised learning algorithms allows you to perform more
complex processing tasks compared to supervised learning.
although, unsupervised learning can be more unpredictable
compared other natural learning methods
ALGORITHM OF UNSUPERVISED LEARNING
• Hierarchical clustering
• K-means clustering
• K-NN (k nearest neighbour)
HIERARCHICAL CLUSTERING
• Hierarchical clustering is an algorithm which builds a Hierarchical of clusters.

• It begins with all the data which is assigned to a cluster of their own. Here two
close cluster are going to be in the same cluster.
• This algorithm ends when there is only one cluster left.
K-MEANS CLUSTERING
• K- means it is an iterative clustering algorithm which helps you to find the

highest value for every iteration. Initially the desired number of clusters are
selected.
• In this clustering method you need to cluster the data point into k groups
• A larger k means smaller groups with more granularity in the same way. A
lower k means larger group with less granularity
K-NEAREST NEIGHBOURS
• K-nearest neighbour is the simplest of all machine learning classifier. It differ

from other machine learning techniques, in that it doesn’t produced a model.
It is a simple algorithms which stores all available cases and classifies new
instances based on a similarity measure.
• It works very well when there is a distance between examples. The learning
speed is slow when the training set is large, and the distance calculation is
nontrivial.
REINFORCEMENT LEARNING
• Reinforcement learning is an area of machine learning. It is employed by

various software and machine to find the best possible behaviour or path it
should take in a specific situation.
• Reinforcement learning there is no answer but agent decide what to do
perform the given task.
CONCEPT OF LEARNING ML
• Learning = improving with experience at some task

o improve over task T
o With respect to perform measure P
o Based on experience
APPLICATION OF MACHINE LEARNING
Face recognition
Voice recognition
Self driving technology

CONCLUSION
• As we move foreword into the digital age our technology continuous to leaps
and strides forward. This incredible form of Artificial Intelligence isa already
being used in various industries and professions. From marketing to medicine
and web security. This technology can our lives in several numerous ways.
Thank you

Machine Learning 1

Uploaded by

Copyright:

Available Formats

Machine Learning 1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Machine Learning 1

Uploaded by

Copyright:

Available Formats

MACHINE LEARNING

Ajudiya Jemin 190220131002

• It’s easy to understand and allows for quick data validation.

• A law entry barrier

• Supervised learning uses

• Regression models a target prediction

• Logistic regression is supervised

• Decision tree uses the tree

• A random forest is an ensemble technique

• Naïve bayes classifiers area a collection of classification algorithm based on

• Unsupervised learning is a machine learning technique, where

• Hierarchical clustering is an algorithm which builds a Hierarchical of clusters.

• K- means it is an iterative clustering algorithm which helps you to find the

• K-nearest neighbour is the simplest of all machine learning classifier. It differ

• Reinforcement learning is an area of machine learning. It is employed by

• Learning = improving with experience at some task

Self driving technology

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.