Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
3 views

MachineLearning

The document outlines the syllabus for the Machine Learning course (23PLC41) offered in the M.C.A. program at The Standard Fireworks Rajaratnam College for Women. It details the course structure, learning outcomes, and topics covered across five units, including supervised and unsupervised learning, reinforcement learning, and genetic algorithms. Additionally, it includes references and suggested learning activities for tutorials.

Uploaded by

sfrcca
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

MachineLearning

The document outlines the syllabus for the Machine Learning course (23PLC41) offered in the M.C.A. program at The Standard Fireworks Rajaratnam College for Women. It details the course structure, learning outcomes, and topics covered across five units, including supervised and unsupervised learning, reinforcement learning, and genetic algorithms. Additionally, it includes references and suggested learning activities for tutorials.

Uploaded by

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

THE STANDARD FIREWORKS RAJARATNAM COLLEGE FOR WOMEN (AUTONOMOUS),

SIVAKASI.
DEPARTMENT OF COMPUTER APPLICATIONS
M. C. A.
SEMESTER IV
PART A - CORE COURSE
23PLC41 –MACHINE LEARNING
(For those admitted in June 2023 and later)

Contact hours per week (Lecture + Tutorial) : 05 (04+01)


Total number of hours per semester (Lecture + Tutorial): 75 (60+15)
Number of credits : 04

Preamble:
The course's goal is to explore the machine learning techniques and methods and design
innovative computational solutions and models.

Course Learning Outcomes (CLO):


On successful completion of the course, the learners should be able to
CLO1[K2]:describe the components of learning and the theories of supervised, unsupervised,
reinforcement and ensemble learning.
CLO2[K3]: solve problems by using supervised and unsupervised learning methods.
CLO3[K4]: classify and analyze the algorithms of machine learning.
CLO4[K5]: evaluate the statistical measures and algorithmic metrics in Machine Learning.
CLO5[K6]: create classifiers and clusters for the input dataset.

CLO-PLO / PSO Mapping table (Course Articulation Matrix)


PLOs / PSOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PSO1 PSO2 PSO3

CLOs

CLO1 9 3 - 1 - - 1 3 - -
CLO2 9 3 - 1 - 1 1 3 3 1
CLO3 9 3 1 - - - 1 3 - -
CLO4 9 3 - - - - 1 3 - -
CLO5 9 3 - 1 - 1 1 3 3 1
Weightage
of the 45 15 1 3 - 2 5 15 6 2
Course
Weighted
percentage
of Course
4.16 2.66 0.29 1.46 - 1.79 3.36 3.69 4.32 2.78
contribution
to PLOs /
PSOs
Based on the level of contribution (9-High, 3-Medium, 1-Low)
Unit – I (12L+3T)
Introduction to Machine Learning: Introduction - Components of Learning - Learning Models
- Geometric Models- ProbabilisticModels- Logic Models- Grouping and Grading- Designing
Learning System- Types of Learning- Supervised- Unsupervised- Reinforcement- Perspectives
and Issues- Version Spaces- PAC Learning- VC Dimension.

Unit – II (12L+3T)
SupervisedandUnsupervised Learning: Decision Trees: ID3- Classification and Regression
Trees- Regression: Linear Regression- Multiple Linear Regression- Logistic Regression- Neural
Networks: Introduction- Perception- Multilayer Perception- Support Vector Machines: Linear
and Non-Linear- Kernel Functions- K Nearest Neighbors.Introduction to clustering: K-means
clustering- K-Mode Clustering.

Unit – III (12L+3T)


Ensemble andProbabilistic Learning: Model Combination Schemes- Voting- Error-Correcting
Output Codes- Bagging: Random Forest Trees. Boosting: Adaboost- Stacking.Gaussian mixture
models - The Expectation-Maximization (EM) Algorithm- Information Criteria–
NearestNeighbour methods - Nearest Neighbour Smoothing- Efficient Distance Computations:
the KD-Tree-DistanceMeasures.

Unit – IV (12L+3T)
ReinforcementLearningandEvaluatingHypotheses: Introduction- Learning Task- Q Learning-
Non deterministic Rewards and actions- temporal-differencelearning-
RelationshiptoDynamicProgramming-Active reinforcement learning
Generalizationinreinforcementlearning. Motivation- Basics of Sampling Theory: Error
Estimation and Estimating Binomial Proportions- TheBinomial Distribution- Estimators- Bias-
andVariance.

Unit – V (12L+3T)
GeneticAlgorithms:Motivation – GeneticAlgorithms: Representing Hypotheses –
GeneticOperator-FitnessFunctionandSelection – AnIllustrativeExample-HypothesisSpaceSearch-
GeneticProgramming- Models of Evolution and Learning: Lamarckian Evolution- Baldwin
Effect- ParallelizingGeneticAlgorithms.

Reference Books:
1. Tom M. Mitchell (2017), Machine Learning, McGraw Hill Education, First Edition.
2. CharuC.Aggarwal (2014),DataClassification: Algorithmsand Applications,CRCPress.
3. Kevin P. Murphy (2012), MachineLearning:AProbabilistic Perspective,MIT Press.
4. JiaweiHanandMichelineKamberandJianPei (2012), DataMiningConceptsandTechniques, 3rd
Edition, Morgan KaufmanPublications.
(Study Material will be provided)
Web References:
1. https://www.javatpoint.com/machine-learning
2. https://www.analyticsvidhya.com/blog/2022/01/machine-learning-algorithms/

Tutorials:
Topic Unit Constructive Alignment -
Learning Activity
Components and Types of Learning I Charts, Assignment
Supervised and Unsupervised II Mindmap
Learning
Ensemble and Probabilistic Learning III Presentation
Reinforcement Learning IV Mind maps
Genetic Algorithms V Group Discussion
Marks are recorded for each student in each learning activity and which can be taken
as assignment marks

You might also like