Department of Computing

Faculty of computing and information Technology (FCIT)

Indus University, Karachi

Machine Learning
ASSIGNMENT NO 2

Name: SAAD YAMEEN

Students I.D: 546-2019
Registration:IU/BSCS/SPRING-19/546-2019
Date of submission: 30thDEC 2021
Submitted to: MISS RAHILA PARVEEN
Teachers Sig:
 Machine Learning
Assignment # 2

Deadline: 30-12-2021
Marks 5

Instructions
1. This is an Individual Assignment
2. Submit both Printed and soft copy
3. Write full Name and Registration/Enrollment number on the tittle
page.
4. No Copied will be accepted

Assignment Tasks:
Q:1What is Gaussian Function? Describe the Gaussian
Discrimination Analysis?
Q:2 Describe Gaussian Mixture Model with diagram?
Q:1What is Gaussian Function? Describe the Gaussian Discrimination
Analysis?

Gaussian processes, we need to understand the mathematical concepts

they are based on. As the name suggests, the Gaussian distribution
(which is often also referred to as normal distribution) is the basic
building block of Gaussian processes. In particular, we are interested in
the multivariate case of this distribution, where each random variable is
distributed normally and their joint distribution is also Gaussian. The
multivariate Gaussian distribution is defined by a mean vector \muμ and
a covariance matrix \SigmaΣ. 

Gaussian Discriminant Analysis is a Generative Learning Algorithm and

in order to capture the distribution of each class, it tries to fit a Gaussian
Distribution to every class of the data separately. The below images
depict the difference between the Discriminative and Generative
Learning Algorithms. The probability of a prediction in the case of the
Generative learning algorithm will be high if it lies near the centre of the
contour corresponding to its class and decreases as we move away from
the centre of the contour.
Generative Learning Algorithm (GDA)

Discriminative Learning Algorithm

Q:2 Describe Gaussian Mixture Model with diagram?

Gaussian Mixture Models (GMMs) assume that there are a certain

number of Gaussian distributions, and each of these distributions
represent a cluster. Hence, a Gaussian Mixture Model tends to group the
data points belonging to a single distribution together.

We have three Gaussian distributions (more on that in the next section) –

GD1, GD2, and GD3. These have a certain mean (μ1, μ2, μ3) and
variance (σ1, σ2, σ3) value respectively. For a given set of data points,
our GMM would identify the probability of each data point belonging to
each of these distributions.

Gaussian Mixture Models are probabilistic models and use the soft
clustering approach for distributing the points in different clusters. I’ll
take another example that will make it easier to understand.
Here, we have three clusters that are denoted by three colors – Blue,
Green, and Cyan. Let’s take the data point highlighted in red. The
probability of this point being a part of the blue cluster is 1, while the
probability of it being a part of the green or cyan clusters is 0.
Now, consider another point – somewhere in between the blue and cyan
(highlighted in the below figure). The probability that this point is a part
of cluster green is 0, right? And the probability that this belongs to blue
and cyan is 0.2 and 0.8 respectively.

Gaussian Mixture Models use the soft clustering technique for assigning
data points to Gaussian distributions.