0% found this document useful (0 votes)
8 views2 pages

MCA, DCS, IIICT, Indus University: Course Objectives

The document outlines the Machine Learning course for MCA students at Indus University, detailing the teaching and evaluation scheme, course objectives, and outcomes. It covers key topics such as supervised and unsupervised learning, neural networks, Bayesian learning, and practical implementations using Python. Additionally, it includes a list of reference books and practical exercises for students to apply the algorithms learned in class.

Uploaded by

zackbhavsar1209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views2 pages

MCA, DCS, IIICT, Indus University: Course Objectives

The document outlines the Machine Learning course for MCA students at Indus University, detailing the teaching and evaluation scheme, course objectives, and outcomes. It covers key topics such as supervised and unsupervised learning, neural networks, Bayesian learning, and practical implementations using Python. Additionally, it includes a list of reference books and practical exercises for students to apply the algorithms learned in class.

Uploaded by

zackbhavsar1209
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MCA, DCS, IIICT, Indus University

Subject: Machine Learning


Program: MCA Subject Code: MCA-322 Semester: III
Teaching Scheme Examination Evaluation Scheme
Lecture Tutorial Practical Credits University University Continuous Continuous Total
Theory Practical Internal Internal
Examination Examination Evaluation Evaluation
(CIE) - (CIE) -
Theory Practical
4 0 4 6 20/40 20/40 30/60 30/60 200

Course Objectives:
1. To introduce students to the basic concepts and techniques of Machine Learning.
2. To have a thorough understanding of the Supervised and Unsupervised learning
techniques.
3. To study the various probability based learning techniques.
4. To understand graphical models of machine learning algorithms.

Detailed Content
UNIT I
[12 Hours]
Introduction: Introduction to Machine Learning, Why Machine Learning, applications,
Issues in Machine Learning, Supervised learning, Unsupervised learning, Reinforcement
learning, Classification, regression: Linear regression, Logistic regression. Cost function,
gradient descent, overfitting, bias, variance, regularization.
Case Study: Familiarity with R tool and Python programming language and libraries
UNIT II
[12 Hours]
Supervised and Unsupervised learning: Decision Tree Representation, Appropriate
problems for Decision tree learning, ID3 Algorithm, Issues in Decision tree learning. K-
Nearest Neighbor, Clustering-K means algorithm.
UNIT III
[12 Hours]
Neural Network: Neural Network Representation, Perceptron’s, Appropriate problems for
Neural Network Learning, training the network, Multilayer Networks and Back Propagation
Algorithms, Remarks on Back Propagation Algorithms
Case Study: face Recognition.
UNIT IV
Bayesian Learning: Bayes Theorem and Concept Learning, Naive Bayes classifier
Case Study: Learning to classify text.
Support Vector machine: SVM - formulation, SVM - interpretation & analysis, SVMs for
linearly non-separable data, SVM kernels, SVM hinge loss formulation
Overview of typical application areas such as Recommender System

Board of Studies – June 2022 Page 39


MCA, DCS, IIICT, Indus University

Course Outcomes:
Upon completion of the course, the students will be able to:
1. Distinguish between, supervised, and unsupervised learning.
2. Apply the apt machine learning strategy for any given problem
3. Suggest supervised or unsupervised learning algorithms for any given problem
4. Modify existing machine learning algorithms to improve classification efficiency
5. Design and implement various machine learning algorithms in a range of real-world
applications. (BT 1,2,3)
6. Evaluate and Program the various Supervised Learning using appropriate Dataset. (BT
5, 6)

Reference Book:
1. Tom M Mitchell, “Machine Learning”, McGraw Hill 2. Peter Harrington, “Machine
Learning in Action”, DreamTech
2. Peter Harrington, “Machine Learning in Action”, DreamTech
3. I H Witten, Eibe Frank, Mark A Hall, “Data Mining: A practical Machine Learning
Tools and techniques”, Elsevier

Lab of Practical’s:
Practical’s to implement following ten algorithms, using Python:
Sr. TEACHING
No. TOPICS / SUBTOPICS HOURS
1 Classifying with distance measures 4
2 Constructing Decision trees and Classification using Decision 4
Trees
3 K-means 4
4 Classification with k-Nearest Neighbors 4
5 Support vector machines 8
6 Naïve Bayes Classifications 8

Few Examples which apply above algorithms:


1) Handwriting recognition system.
2) Using decision trees to predict contact lens type
3) Classifying text
4) Classifying spam mail with naïve Bayes
5) Recommendation system

Book for Practical:


1. Peter Harrington, “Machine Learning in Action”, DreamTech

Board of Studies – June 2022 Page 40

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