Click on Subject/Paper under Semester to enter.

Professional English Discrete Mathematics Environmental Sciences

Professional English - - II - HS3252 - MA3354 and Sustainability -
I - HS3152 GE3451
Digital Principles and
Statistics and Probability and
Computer Organization
Matrices and Calculus Numerical Methods - Statistics - MA3391
- CS3351
- MA3151 MA3251
3rd Semester
1st Semester

4th Semester
2nd Semester

Database Design and Operating Systems -

Engineering Physics - Engineering Graphics
Management - AD3391 AL3452
PH3151 - GE3251

Physics for Design and Analysis of Machine Learning -

Engineering Chemistry Information Science Algorithms - AD3351 AL3451
- CY3151 - PH3256
Data Exploration and Fundamentals of Data
Basic Electrical and
Visualization - AD3301 Science and Analytics
Problem Solving and Electronics Engineering -
BE3251 - AD3491
Python Programming -
GE3151 Artificial Intelligence
Data Structures Computer Networks
- AL3391
Design - AD3251 - CS3591

Deep Learning -
AD3501

Embedded Systems
Data and Information Human Values and
and IoT - CS3691
5th Semester

Security - CW3551 Ethics - GE3791

6th Semester

7th Semester

8th Semester

Open Elective-1
Distributed Computing Open Elective 2
- CS3551 Project Work /
Elective-3
Open Elective 3 Intership
Big Data Analytics - Elective-4
CCS334 Open Elective 4
Elective-5
Elective 1 Management Elective
Elective-6
Elective 2
 All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering
 www.BrainKart.com
4931_Grace College of Engineering,Thoothukudi

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA

SCIENCE

B.Tech- Artificial Intelligence And Data Science

Anna University Regulation: 2021

AL3391- Artificial Intelligence

II Year/III Semester

Unit- V Probabilistic Reasoning

Prepared By,

Mrs. S. Porkodi, AP/CSE

AL3391_AI

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com
4931_Grace College of Engineering,Thoothukudi

Unit- V Probabilistic Reasoning

PART A

1.Define Reinforcement Learning.

This Learning is rather than being told what to do by teacher, a reinforcement learning agent must learn
from occasional rewards.

Example If taxi driver does not get a tip at the end of journey, it gives him a indication that his behaviour
is undesirable.

2. Define Inductive Learning.

An algorithm for supervised learning is given as input the correct value of the unknown function for
particular inputs and it must try to recover the unknown function.

3. Define Classification Learning.

Learning a discrete valued function is called is called classification learning.

4. Define Regression learning.

Learning a continuous valued function is called regression learning.

5.What are the types of machine learning?

i. Supervised Learning ii. Unsupervised Learning iii. Reinforcement Learning

6. Differentiate Supervised and Unsupervised learning.

Supervised Learning It involves learning a function From examples of its inputs And outputs

Example: Applying Brake on the wet road, we can even skip on the road is a result. Unsupervised
Learning

It involves learning patterns in the input when no specific output values are supplied.

Example: Day by day agent will learn about “Good traffic days” and “Bad traffic days” without any
advice.

7.Define Bayesian Learning.

It calculates the probability of each hypotheses, given the data and makes predictions on that basis, (i.e.)
predictions are made by using all the hypotheses, weighted by their probabilities rather than by using just
single “best” hypotheses.

8. Define MAP.

AL3391_AI

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com
4931_Grace College of Engineering,Thoothukudi

Maximum A Posteriori. A very common approximation is to make predictions based on single most
probable hypotheses. This is MAP.

9. Define MDL.

The MDL (Maximum Description Length), is a learning method which attempts to minimize the size of
the hypotheses and data encodings rather than work with probabilities.

10. What is Maximum – Likelihood hypotheses?

ML – it is reasonable approach when there is no reason to prefer one hypotheses over another a prior. 11.
What are the methods for maximum likelihood parameter learning?

i. Write down an expression for the likelihood of the data as a function of the parameter. ii.
Write down the derivative of the log likelihood with respect to each parameter. iii. Find the
parameter values such that the derivatives are zero.

12. Define Naïve Bayes model.

In this model, the “class” variable C is the root and the “attribute” variable XI are the leaves. This model
assumes that the attributes are conditionally independent of each other, given the class.

13.Define sum of squared errors.

The difference between the actual value yj and the predicated value ( θ1 xj + θ2 ) so E is the sum of
squared errors.

14. Define EM.

Expectation Maximization: the idea of EM is to pretend that we know the parameters of the model and
then to infer the probability that each data point belongs to each component. After that we refit the
components to the data, where each component is fitted to the entire data set with each point weighted by
the probability.

15. What are the 2 steps in mixture model parameters?

i. E – Step ii. M – Step

16. Define Neural Networks.

It consists of nodes or units connected by directed links. A link propagates the activation. Each link has a
numeric weight which determines the strength and sign of the connection.

17. Give Activation function.

n ai = g(ini) = g(Σ Wj,i aj) j=0

18. What are the two functions in Neural network’s Activation functions?

i. Threshold function ii. Sigmoid function

AL3391_AI

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 www.BrainKart.com
4931_Grace College of Engineering,Thoothukudi

19. What are the categories of neural network structures?

i. Acyclic (or) Feed – forward networks ii. Cyclic (or) Recurrent Networks

20. .Define Passive learning.

The agent’s policy is fixed and the task is to learn the utilities of states, this could also involve learning a
model of the environment.

21. Define Active Learning.

The agent must learn what to do. An agent must experience as much as possible of its environment in
order to learn how to behave in it.

22. What are the tasks in probabilistic language model?

i. Information retrieval ii. Information Extraction iii. Machine Translation

23. What are the types of machine translation?

i. Rough translation ii. Restricted source translation iii. Pre edited translation iv. Literacy translation

24. How to use the parameters for machine translation?

i. Segment into sentences ii. Estimate the French language model iii. Align sentences iv. Estimate the
initial fertility model v. Estimate the initial word choice model vi. Estimate the initial offset model vii.
Improve all the estimates.

PART-B

1.Derive Baye’s theorem with suitable example.

2.Explain the probabilistic reasoning.

3.Discuss the Causal networks with example.

4.Explain about the exact inference in Bayesian network.

5.Explain the Steps involved in forward and backward algorithm.

6.Discuss the uncertain knowledge with example.

7.Explain about fuzzy set with example.

AL3391_AI

https://play.google.com/store/apps/details?id=info.therithal.brainkart.annauniversitynotes&hl=en_IN
 Click on Subject/Paper under Semester to enter.
Professional English Discrete Mathematics Environmental Sciences
Professional English - - II - HS3252 - MA3354 and Sustainability -
I - HS3152 GE3451
Digital Principles and
Statistics and Probability and
Computer Organization
Matrices and Calculus Numerical Methods - Statistics - MA3391
- CS3351
- MA3151 MA3251
3rd Semester
1st Semester

4th Semester
2nd Semester

Database Design and Operating Systems -

Engineering Physics - Engineering Graphics
Management - AD3391 AL3452
PH3151 - GE3251

Physics for Design and Analysis of Machine Learning -

Engineering Chemistry Information Science Algorithms - AD3351 AL3451
- CY3151 - PH3256
Data Exploration and Fundamentals of Data
Basic Electrical and
Visualization - AD3301 Science and Analytics
Problem Solving and Electronics Engineering -
BE3251 - AD3491
Python Programming -
GE3151 Artificial Intelligence
Data Structures Computer Networks
- AL3391
Design - AD3251 - CS3591

Deep Learning -
AD3501

Embedded Systems
Data and Information Human Values and
and IoT - CS3691
5th Semester

Security - CW3551 Ethics - GE3791

6th Semester

7th Semester

8th Semester

Open Elective-1
Distributed Computing Open Elective 2
- CS3551 Project Work /
Elective-3
Open Elective 3 Intership
Big Data Analytics - Elective-4
CCS334 Open Elective 4
Elective-5
Elective 1 Management Elective
Elective-6
Elective 2
 All Computer Engg Subjects - [ B.E., M.E., ] (Click on Subjects to enter)
Programming in C Computer Networks Operating Systems
Programming and Data Programming and Data Problem Solving and Python
Structures I Structure II Programming
Database Management Systems Computer Architecture Analog and Digital
Communication
Design and Analysis of Microprocessors and Object Oriented Analysis
Algorithms Microcontrollers and Design
Software Engineering Discrete Mathematics Internet Programming
Theory of Computation Computer Graphics Distributed Systems
Mobile Computing Compiler Design Digital Signal Processing
Artificial Intelligence Software Testing Grid and Cloud Computing
Data Ware Housing and Data Cryptography and Resource Management
Mining Network Security Techniques
Service Oriented Architecture Embedded and Real Time Multi - Core Architectures
Systems and Programming
Probability and Queueing Theory Physics for Information Transforms and Partial
Science Differential Equations
Technical English Engineering Physics Engineering Chemistry
Engineering Graphics Total Quality Professional Ethics in
Management Engineering
Basic Electrical and Electronics Problem Solving and Environmental Science and
and Measurement Engineering Python Programming Engineering