Scribd
Upload
109 views

Machine Learning Syllabus

This document outlines the syllabus for the course "Advanced Machine Learning". The course aims to provide knowledge in machine learning areas and algorithms for analyzing data. It covers types of machine learning including supervised and unsupervised learning. Major topics include classification algorithms like Bayesian classification and decision trees. Clustering algorithms like K-means and hierarchical clustering are also covered. The syllabus concludes with an introduction to text analytics using techniques like text mining and natural language processing. References for further reading on machine learning concepts are provided.

Uploaded by

Vinodh Gau
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
109 views

Machine Learning Syllabus

This document outlines the syllabus for the course "Advanced Machine Learning". The course aims to provide knowledge in machine learning areas and algorithms for analyzing data. It covers types of machine learning including supervised and unsupervised learning. Major topics include classification algorithms like Bayesian classification and decision trees. Clustering algorithms like K-means and hierarchical clustering are also covered. The syllabus concludes with an introduction to text analytics using techniques like text mining and natural language processing. References for further reading on machine learning concepts are provided.

Uploaded by

Vinodh Gau
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

DOCTOR OF PHILOSOPHY

IN

COMPUTER SCIENCE

COURSE WORK

SYLLABUS

(Applicable for candidates admitted from 2019 – 2010)

DEPARTMENT OF COMPUTER SCIENCE


FACULTY OF SCIENCE AND HUMANITIES
SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
SRM NAGAR, KATTANKULATHUR – 603203
Program Educational Objectives (PEOs)

 PEO1. Graduates will have skills and knowledge to excel in their professional career
in Computer Applications and related disciplines
 PEO2. Graduates will contribute and communicate effectively within the team to
grow into leaders
 PEO3. Graduates will practice lifelong learning for continuing professional
development
 PEO4. Graduates will have the capability to continue their formal education and
successfully complete an advanced degree
 PEO5.Graduates will contribute to the growth of the nation and society by applying
acquired knowledge in technical, computing and managerial skills.

Student outcomes (SOs)

The syllabus conforms to outcome based teaching learning process. In general,


FOURTEEN STUDENT OUTCOMES (a-n) have been identified and the syllabus has been
structured in such a way that each of the courses meets one or more of these outcomes.
Student outcomes describe what students are expected to know and be able to do by the time
of graduation. These relate to the skills, knowledge, and behaviours that students acquire as
they progress through the program. Further each course in the program spells out clear
instructional objectives which are mapped to the student outcomes.

a. An ability to apply knowledge of computing, mathematics, and basic sciences appropriate


to the discipline

b. An ability to analyze a problem, and identify and define the computing requirements
appropriate to its solution

c. An ability to design, implement, and evaluate a computer-based system, process,


component, or program to meet desired needs

d. An ability to function effectively on teams to accomplish a common goal e. An


understanding of professional, ethical, legal, security and social issues and responsibilities

f. An ability to communicate effectively with a range of audiences

g. An ability to analyze the local and global impact of computing on individuals,


organizations, and society.

h. Recognition of the need for and an ability to engage in continuing professional


development

i. An ability to use current techniques, skills, and tools necessary for computing practice.

j. An ability to use and apply current technical concepts and practices in the core information
technologies
k. An ability to identify and analyze user needs and take them into account in the selection,
creation, evaluation, and administration of computer-based systems

l. An ability to effectively integrate IT-based solutions into the user environment

m. An understanding of best practices and standards and their application

n. An ability to assist in the creation of an effective project plan.


COURSE CODE COURSE TITLE L T P C
ADVANCED MACHINE LEARNING 4 1 0 5

INSTRUCTIONAL OBJECTIVES Student Outcomes


At the end of this course the learner is expected:
1. To gain knowledge in the areas of Machine Learning. a c
2. To understand algorithms for analyzing data a c h i
3. To learn advanced algorithms for analytics a c i j

UNIT-I : TYPES OF LEARNING (15 hours)


Definition of learning systems, Goals and applications of machine learning - Types of
learning: Supervised learning, Unsupervised learning, Reinforcement Learning. Overview of
classification: setup, training, test, validation dataset, over fitting.

UNIT II – CLASSIFICATION ALGORITHMS (15 hours)


Issues regarding classification and prediction, Bayesian Classification, Classification by back
propagation, Classification based on concepts from association rule mining, Other
Classification Methods, Classification accuracy.

UNIT III – DECISION TREES (15 hours)


Introduction to Decision trees –Splitting approaches in decision tree - Classification by
decision tree induction – Tree pruning methods (Cost complexity pruning - Chi square
pruning) – Issues in decision trees –Extended Decision Trees (fuzzy decision trees)

UNIT IV – CLUSTERING ALGORITHMS (15 hours)


Distance Measures – Similarity Functions – Error measures – K-Means algorithm – Fuzzy
CMeans algorithm– Hierarchical clustering algorithm– Mixture of Gaussian algorithm–
Expectation & Maximization approach – Probabilistic clustering algorithms

UNIT V– TEXT ANALYTICS (15 hours)


Introduction - Text mining operations -Border increment text mining algorithm -
Preprocessing techniques – Feature selection using dimensionality reduction – Support
Vector Machine (SVM) – Foundations of NLP.

REFERENCES

1. Ethem Alpaydin, Introduction to Machine Learning, Third edition, The MIT Press
Cambridge.
2. Tom M Mitchell, Machine Learning, McGraw Hill Education
3. Jiawei Han and Micheline Kamber, ―Data Mining: Concepts and Techniques‖,
Morgan Kaufmann Publishers, 3rd ed, 2010.
4. Lior Rokach and Oded Maimon, ―Data Mining and Knowledge Discovery
Handbook‖, Springer, 2nd edition, 2010.
5. Ronen Feldman and James Sanger, ―The Text Mining Handbook: Advanced
Approaches in Analyzing Unstructured Data‖, Cambridge University Press, 2006.
COURSE CODE COURSE TITLE L T P C
ADVANCED MACHINE LEARNING 4 1 0 5

UNIT-I : TYPES OF LEARNING (15 hours)


Definition of learning systems, Goals and applications of machine learning - Types of
learning: Supervised learning, Unsupervised learning, Reinforcement Learning. Overview of
classification: setup, training, test, validation dataset, over fitting.

UNIT II – CLASSIFICATION ALGORITHMS (15 hours)


Issues regarding classification and prediction, Bayesian Classification, Classification by back
propagation, Classification based on concepts from association rule mining, Other
Classification Methods, Classification accuracy.

UNIT III – DECISION TREES (15 hours)


Introduction to Decision trees –Splitting approaches in decision tree - Classification by
decision tree induction – Tree pruning methods (Cost complexity pruning - Chi square
pruning) – Issues in decision trees –Extended Decision Trees (fuzzy decision trees)

UNIT IV – CLUSTERING ALGORITHMS (15 hours)


Distance Measures – Similarity Functions – Error measures – K-Means algorithm – Fuzzy
CMeans algorithm– Hierarchical clustering algorithm– Mixture of Gaussian algorithm–
Expectation & Maximization approach – Probabilistic clustering algorithms

UNIT V– TEXT ANALYTICS (15 hours)


Introduction - Text mining operations -Border increment text mining algorithm -
Preprocessing techniques – Feature selection using dimensionality reduction – Support
Vector Machine (SVM) – Foundations of NLP.

REFERENCES

1. Ethem Alpaydin, Introduction to Machine Learning, Third edition, The MIT Press
Cambridge.
2. Tom M Mitchell, Machine Learning, McGraw Hill Education
3. Jiawei Han and Micheline Kamber, ―Data Mining: Concepts and Techniques‖,
Morgan Kaufmann Publishers, 3rd ed, 2010.
4. Lior Rokach and Oded Maimon, ―Data Mining and Knowledge Discovery
Handbook‖, Springer, 2nd edition, 2010.
5. Ronen Feldman and James Sanger, ―The Text Mining Handbook: Advanced
Approaches in Analyzing Unstructured Data‖, Cambridge University Press, 2006.

You might also like