0 ratings0% found this document useful (0 votes) 15 views3 pagesML Syllabus
Machine learning syllabus CUSB
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
Importance of Data Visualization-Classification of Visualization
‘Terminology~ Visual data analysis and exploration ~Basie charts and plots—
Principles of perception, color and design-text data visualization — Effective
visualization of big data
39-45 HADOOP AND MAPREDUCE FRAMEWORK
‘The Hadoop Framework — History of Hadoop Advantages and
Disadvantages of Hadoop ~ HDFS architecture Features of HDFS~ Map
Reduce architecture
15 Hours Tutorials =
1. Analytics
Pramod J
Essential Readings:
by Bary Baesens Wiley India
2. Hadoop: The Definitive Guide, 4th Edition by Tom White O'Reilly
3. Designing Data Visualization by Noab I
4. NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence by
5, Big Data and Analytics by Seema Acharya and Subhasini Chellappan Wiley India
in a Big Data World: The Essential guide to data science and its applications
insky, Julie Steele O’REILLY publication
. Martin Flower PEARSON publication
6. Effective Data Visualization From Design Fundamentals to Big Data Techniques by
Jeferry Heer O'Reilly
MACHINE LEARNING
Course Code Credit a
L+T+P 34140 ‘Course Duration | One Semester
‘Semester Odd Contact Hours 45 (L) +15 (1)
_| Hours
Course Type __ | Discipline Based Core Elective
Nature of the Theory
Course
Methods of Lecture, Tutorials, Group discussion, self-study, seminar, —
Content presentations by students, assignments.
Interaction
| Assessment and
Evaluation
‘* 30% - Continuous Internal Assessment (Formative in nature but
also contributing to the final grades)
wo 4
OMe Quen‘© 70% = End Term External Examination (University
Examination)
Course Objectives
© This course will serve as a comprehensive introduction to various topies in machine
learning,
¢ Enabling students to solve various real-life problems using machine learning
techniques.
Course Learning Outcomes
On completion of the course students will be expected to:
Have a good knowledge of the fundamental issues and challenges of machine learning:
data, model selection, model complexity, ete,
© Have an understanding of issues of many popular machine Jearning approaches.
© Appreciate the underlying mathematical relationships within and across Machine
Learning algorithms and the paradigms of supervised and un-supervised learning.
‘© Be able to design and implement various machine learning algorithms in a range of real-
world applications.
Prerequisites: Machine Learning is a mathematical discipline, and students will benefit from
4 good background in probability, linear algebra and calculus. Programming experience is
essential
rse Ci
UNIT-I: [20% Weightage}
Introductory Topies, Linear Regression and Feature Selection
UNIT-I [10% Weightage|
Linear Classification
UNIT-IM: [25% Weightage]
Support Vector Machines, Artificial Neural Networks, Bayes
Learning and Decision Trees,UNIT-IV: [15% Weightage]
Evaluation Measures, Hypothesis Testing, Ensemble Methods
UNIT? [20% Weightage|
Clustering, Graphical Models
UNIT-VI: [10% Weightage]
Learning Theory and Expectation Maximization, Introduction to Reinforcement Learning
Content Interaction Plan:
Lecture cum
Discussion (Each Unit/Topie/s
session of 1 Hour) | >
13 ie Introductory Topics, Linear Regression
+8 Feature Selection
v3 sar Classification
1417 ‘Support Vector Machines , Artificial Neural Networks
18-23 Bayesian Learning and Decision Trees. ea
24-26 Evaluation Measures, Hypothesis Testing
i Ensemble Methods
32-36 Clustering i
37-40 Graphical Models Ea
ai-43 Teaming Theory and Expectation Maximization, Introduction to
Reinforcement Learning
15 Hours Tuaorials im oo
Essential Readings:
1. T. Hastie, R. Tibshirani, J. Friedman. The Elements of Statistical Learning, 2¢, 2008.
2. Christopher Bishop. Pattern Recognition and Machine Learning, 2e.
Further Readings:
1. “Techniques in Computation Learning”- C.J. Thorton, Chapman & Hall
2. “Machine Learning ~ An Al Approach” ~ Michalski, Carbonell, & Mitchell (Eds,)-
vol(1,2,3), Morgan Kaufman
ah se Qn
- .*