M.E. Computer Science and Engineering - Curriculum - R2019 Page

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

MACHINE LEARNING FOR SOFTWARE 3 0 0 3

ENGINEERS

COA22
Prerequisite NIL

Course The course on Machine Learning For Software Engineers aims to provide the students
Objectives with the following:

1. To introduce the fundamental problems of machine learning    


2. To provide understanding of techniques, mathematical concepts, and algorithms
used in machine learning to facilitate further study in this area.
3. To become familiar with specific, widely used machine learning algorithms.
4. To acquire advanced Data Analysis skills
5. To create machine learning solutions for various business problems.
Course On successful completion of the course, the student will be able to:
Outcomes 1. Understand a wide variety of learning algorithms.
2. Apply the fundamentals of Neural Networks and Genetic Algorithms
3. Understand how to apply a variety of learning algorithms to data.
4. Understand how to perform evaluation of learning algorithms and model
selection
5. Apply the algorithms to a real-world problem; optimize the models learned and
the expected accuracy that can be achieved by applying the models.

UNIT I INTRODUCTION
Learning Problems – Perspectives and Issues – Concept Learning – Version Spaces and Candidate
Eliminations– Inductive bias – Decision Tree learning – Representation – Algorithm – Heuristic Space
Search.

UNIT II NEURAL NETWORKS AND GENETIC ALGORITHMS


Neural Network Representation – Problems – Perceptrons –the perceptron algorithm - Multilayer
perceptrons- Back Propagation Algorithms – introduction to deep neural network- Genetic Algorithms –
Hypothesis Space Search – Genetic Programming – Models of Evalution and Learning.
UNIT III BAYESIAN AND COMPUTATIONAL LEARNING
Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description Length Principle –
Bayes Optimal Classifier – Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief Network – EM
Algorithm – Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces –
Mistake Bound Model

UNIT IV INSTANT BASED LEARNING


K- Nearest Neighbour Learning – Locally weighted Regression – Radial Bases Functions – Case Based
Learning

UNIT V ADVANCED LEARNING


Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules –Sets
of First Order Rules – Induction on Inverted Deduction – Inverting Resolution – Analytical Learning –

M.E. Computer Science and Engineering _Curriculum_R2019 Page


1
Perfect Domain Theories – Explanation Base Learning – FOCL Algorithm – Reinforcement Learning –
Task – Q-Learning – Temporal Difference Learning

REFERENCES
1. Tom M. Mitchell, “Machine Learning”, McGraw-Hill, 1st edition, 1997

2. EthemAlpaydin, “Introduction to Machine Learning (Adaptive Computation and Machine


Learning)”, The MIT Press 2004

3. Hastie. T, Tibshirani. R, Friedman. J. H, “The Elements of Statistical Learning”, Springer,1st


edition, 2001

M.E. Computer Science and Engineering _Curriculum_R2019 Page


2

You might also like

pFad - Phonifier reborn

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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy