VTU 2022 Scheme  ·  Degree  ·  AIML

Machine Learning - II BAI702

Module-wise notes, PYQs, and a built-in resource explorer — everything you need to crack BAI702 in one focused page.

Browse Resources
CodeBAI702
Credits04
CIE / SEE50 / 50
TypeTheory
Exam3 Hours
Hours / Week3:0:2:0
Save
Last Updated:  15 March 2026

Module Overview

M1

Module 1 Overview

Introduction: Well-Posed Learning Problems, Designing a Learning System, Perspectives and Issues in Machine Learning.

Concept Learning and the General-to-Specific Ordering: A Concept Learning Task, Concept Learning as Search, Find-S: Finding a Maximally Specific Hypothesis, Version Spaces and the Candidate-Elimination Algorithm, Remarks on Version Spaces and Candidate-Elimination, Inductive Bias.

Text Book 1 : Ch 1 & 2

M2

Module 2 Overview

Learning Sets of Rules: Sequential Covering Algorithms, Learning Rule Sets: Example-Based Methods, Learning First-Order Rules, FOIL: A First-Order Inductive Learner.

Analytical Learning: Perfect Domain Theories: Explanation-Based Learning, Explanation-Based Learning of Search Control Knowledge, Inductive-Analytical Approaches to Learning.

Text Book 1 : Ch 10 & 11

M3

Module 3 Overview

Decision by Committee: Ensemble Learning: Boosting: Adaboost, Stumping, Bagging: Subagging, Random Forests, Comparison With Boosting, Different Ways To Combine Classifiers.

Unsupervised Learning: The K-MEANS algorithm: Dealing with Noise, The k-Means Neural Network, Normalisation, A Better Weight Update Rule, Using Competitive Learning for Clustering.

Text Book 2: Chap 13 and 14.1

M4

Module 4 Overview

Unsupervised Learning: Vector Quantisation, the self-organising feature map, The SOM Algorithm, Neighbourhood Connections, Self-Organisation, Network Dimensionality and Boundary Conditions, Examples of Using the SOM.

Markov Chain Monte Carlo (MCMC) Methods: Sampling: Random Numbers, Gaussian Random Numbers, Monte Carlo Or Bust, The Proposal Distribution, Markov Chain Monte Carlo.

Text Book 2: Chap 14.2, 14.3, 15

M5

Module 5 Overview

Graphical Models: Bayesian Networks: Approximate Inference, Making Bayesian Networks, Markov Random Fields, Hidden Markov Models (Hmms), The Forward Algorithm, The Viterbi Algorithm, The Baum - Welch Or Forward - Backward Algorithm, Tracking Methods, The Kalman Filter, The Particle Filter.

Text Book 2 : Chap 16

Machine Learning - II BAI702 is a VTU course covered through module-wise syllabus, notes, and PYQ-driven exam practice available on this page.

Credits for BAI702: 04.

Yes. You can access organized notes, PDFs, and PYQ material from the file explorer/resources section on this page.

Start with module summaries, solve recent PYQs unit-wise, and finish with complete paper practice under time constraints for SEE readiness.

Yes, this page is maintained with current scheme-oriented materials and practical exam-focused resource curation.

Crafted with ❤️ for VTU Students.

Resource Explorer

Browse all BAI702 study materials — notes, PYQs, and revision resources. Navigate folders for module-wise content and preview files before downloading.

Recently Viewed

Open any file to see it here for quick access later.

Need another subject?

Jump to other 7th Semester subjects and complete your study session.

Frequently Asked Questions

What is BAI702 (Machine Learning - II BAI702)?

Machine Learning - II BAI702 is a VTU course covered through module-wise syllabus, notes, and PYQ-driven exam practice available on this page.

How many credits is BAI702?

Credits for BAI702: 04.

Are notes and previous year question papers available for BAI702?

Yes. You can access organized notes, PDFs, and PYQ material from the file explorer/resources section on this page.

How should I prepare Machine Learning - II BAI702 for VTU exams?

Start with module summaries, solve recent PYQs unit-wise, and finish with complete paper practice under time constraints for SEE readiness.

Is this BAI702 page updated for current VTU scheme?

Yes, this page is maintained with current scheme-oriented materials and practical exam-focused resource curation.

Explore More VTU Notes

Was This Helpful?