Description_ML_F_SP22
Description_ML_F_SP22
NCEAC NCEAC.FORM.001-C
A. Course Description
Topics Covered in
the Course, with
Number of Lectures
on Each Topic Topics Covered
(assume 15-week
Week Lectu Topic Comments
instruction and one
re
and half -hour
1 Introduction to Machine Learning Course
lectures)
• Course Outline
• Learning Objectives
• Course Learning Outcomes
1 2 Basics of Machine Learning
• Inductive and Deductive Learning
• ML Applications
• Major Challenges in ML
• Machine Learning VS Traditional
Programming
1 Designing a ML problem Assignment
• Learning Input Output Functions General 01 –
Complete
Settings
Python
• Concept Learning / Function Learning Learning
• Learning is a Searching Problem Tutorial
• Representation of Instance/Examples
2 2 Steps to Build Efficient Machine Learning Models
• Data Understanding and preprocessing
• Represent Data into Machine Understandable
Format
• Treating Real World Problems as Learning
Input Output Functions in Machine Learning
• Categorization of Input and Output Data
2
NCEAC.FORM.001.C
National Computer Education Accreditation Council
NCEAC NCEAC.FORM.001-C
1 Types of Learning in Machine Learning
• Supervised Learning
• Unsupervised Learning
• Semi supervised Learning
Machine Learning Cycle
• Training, Testing, and Application Phase
• Balanced and Unbalanced Data
• Data Split Approachs (Class balanced Split
and Random data Split)
Machine Learning Training Regimes
• Batch Method
• Incremental Method
3 • Online Method
2 Basics of Concept Learning
• Instance Space and Computing Size of
Instance Space
• Concept Space and Computing Size of
Concept Space
• Hypothesis Space and Using Search Bias to
Reduce Size of Concept Space
3
NCEAC.FORM.001.C
National Computer Education Accreditation Council
NCEAC NCEAC.FORM.001-C
2 Find S Algorithm Quiz 1
• Representing Training Examples and
Hypothesis for FIND S Machine Learning Algorithm
• FIND-S Algorithm Machine Learning Cycle
4
NCEAC.FORM.001.C
National Computer Education Accreditation Council
NCEAC NCEAC.FORM.001-C
• Methods to avoid overfitting
1
8 2
1
9 2
Mid-Term Exams
1 KNN for Classification
10 2 Bayesian Learning, Naïve Bayes Classifier
1 Introduction to Linear regression, Least Square Method
11 2 Gradiant Descent, Multiple Linear Regression, Logistic
regression
1 Unsupervised Learning, Dimensionality Reduction, PCA Quiz-3
12 2 PCA – with example Assignment #3
1 Support Vector Machine
13 2 Clustering, k-Mean clustering
1 K-Medoid Clustering, CLARA
14 2 Hierarchical Clustering-MST, BIRCH Quiz-4
1 Artificial Neural Networks (ANN) – Introduction, Perceptrons Assignment #4
15 2 Multilayered Networks and Backpropagation Algorithm
1 Backpropagation Algorithm -Examples
16 2 Deep Learning Models
17,18 Final Term Exam
Laboratory
Projects/Experiments Non,
Done in the Course
Programming
Assignments Done in non
the Course
Class Time Spent on Theory Problem Analysis Solution Design Social and Ethical Issues
(in credit hours) 1 1 1 -
Oral and Written N/A
Communications
5
NCEAC.FORM.001.C