Maharana Pratap Group of Institutions, Mandhana, Kanpur

(Approved By AICTE, New Delhi And Affiliated To AKTU, Luck now)

Digital Notes
[Department of Computer Science Engineering]

Course :B.TECH
Branch : CSE
Semester :7th SEM
Subject Name : Artificial Intelligence
Subject Code : RCS702
Lecture No. /Topic : 05,06 / Classification
Prepared by : Neha Singhal
1
© Copyright, Confidential, Maharana Pratap Group
 Expectation-Maximization algorithm
• Expectation-Maximization algorithm can be used for the latent variables
(variables that are not directly observable and are actually inferred from
the values of the other observed variables) too in order to predict their
values with the condition that the general form of probability distribution
governing those latent variables is known to us. This algorithm is actually
at the base of many unsupervised clustering algorithms in the field of
machine learning.
 Algorithm
• Given a set of incomplete data, consider a set of starting parameters.

• Expectation step (E – step): Using the observed available data of the

dataset, estimate (guess) the values of the missing data.

• Maximization step (M – step): Complete data generated after the

expectation (E) step is used in order to update the parameters.

• Repeat step 2 and step 3 until convergence.

 REINFORCEMENT LEARNING

• Reinforcement learning is an area of Machine Learning. It is about

taking suitable action to maximize reward in a particular situation
• Reinforcement learning differs from the supervised learning in a
way that in supervised learning the training data has the answer
key with it so the model is trained with the correct answer itself
whereas in reinforcement learning, there is no answer but the
reinforcement agent decides what to do to perform the given task.
• In the absence of a training dataset, it is bound to learn from its
experience.