MACHINE LEARNING
[R17A0534]
LECTURE NOTES
[Link] IV YEAR – I SEM(R17)
(2020-21)
DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
MALLA REDDY COLLEGE OF ENGINEERING &
TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
Recognized under 2(f) and 12 (B) of UGC ACT 1956
(Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2015 Certified)
Maisammaguda, Dhulapally (Post Via. Hakimpet), Secunderabad – 500100, Telangana State, India
IV Year B. Tech. CSE –II Sem L T/P/D C
4 1/- / - 3
(R17A0534) Machine Learning
Objectives:
Acquire theoretical Knowledge on setting hypothesis for pattern recognition.
Apply suitable machine learning techniques for data handling and to gain knowledge from it.
Evaluate the performance of algorithms and to provide solution for various real world
applications.
UNIT I:
Introduction to Machine Learning
Introduction ,Components of Learning , Learning Models , Geometric Models, Probabilistic
Models, Logic Models, Grouping and Grading, Designing a Learning System, Types of
Learning, Supervised, Unsupervised, Reinforcement, Perspectives and Issues, Version Spaces,
PAC Learning, VC Dimension.
UNIT II:
Supervised and Unsupervised 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:
Ensemble and Probabilistic 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, Nearest
neighbour methods - Nearest Neighbour Smoothing, Efficient Distance Computations: the KD-Tree,
Distance Measures.
UNIT IV:
Reinforcement Learning and Evaluating Hypotheses
Introduction, Learning Task, Q Learning, Non deterministic Rewards and actions, temporal-difference
learning, Relationship to Dynamic Programming, Active reinforcement learning, Generalization in
reinforcement learning.
Motivation, Basics of Sampling Theory: Error Estimation and Estimating Binomial Proportions, The
Binomial Distribution, Estimators, Bias, and Variance
UNIT V:
Genetic Algorithms: Motivation, Genetic Algorithms: Representing Hypotheses, Genetic Operator,
Fitness Function and Selection, An Illustrative Example, Hypothesis Space Search, Genetic
Programming, Models of Evolution and Learning: Lamarkian Evolution, Baldwin Effect, Parallelizing
Genetic Algorithms.
TEXT BOOKS:
1. Ethem Alpaydin, ”Introduction to Machine Learning”, MIT Press, Prentice Hall of India, 3 rd
Edition2014.
2. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar ” Foundations of Machine Learning”, MIT
Press,2012.
3. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rdEdition, 1997.
4. MACHINE LEARNING - An Algorithmic Perspective, Second Edition, Stephen Marsland, 2015.
REFERENCE BOOKS:
1. [Link],“DataClassificationAlgorithmsandApplications”,CRCPress,2014.
2. Charu C. Aggarwal, “DATA CLUSTERING Algorithms and Applications”, CRC Press,
2014.
3. Kevin P. Murphy ”Machine Learning: A Probabilistic Perspective”, The MIT Press, 2012
4. Jiawei Han and Micheline Kambers and JianPei, “Data Mining Concepts
andTechniques”,3rd edition, Morgan Kaufman Publications, 2012.
OUTCOMES:
1. Recognize the characteristics of Machine Learning techniques that enable to solve real world
problems
2. Recognize the characteristics of machine learning strategies
3. Apply various supervised learning methods to appropriate problems
4. Identify and integrate more than one techniques to enhance the performance of learning
5. Create probabilistic and unsupervised learning models for handling unknown pattern
6. Analyze the co-occurrence of data to find interesting frequent patterns
INDEX
UNIT NO TOPIC PAGE NO
Introduction 1
Learning Models 3
Designing a Learning System 7
Types of Learning 12
I
Perspectives and Issues 13
Version Spaces 14
PAC Learning 19
VC Dimension 21
Decision Trees 23
Classification and Regression Trees 27
Neural Networks 37
II
Support Vector Machines 45
Introduction to clustering 49
K-means clustering 52
Model Combination Schemes 55
Voting, Error-Correcting Output Codes 57
Bagging, Random Forest Trees 61
III Boosting, Adaboost 65
Gaussian mixture models 68
EM Algorithms 69
Efficient Distance Computations 73
Reinforcement Learning 78
Learning Task 79
IV Q Learning 82
Evaluating Hypotheses 86
Basics of Sampling Theory 88
Genetic Algorithms 92
An Illustrative Example 96
Hypothesis Space Search 98
V
Genetic Programming 101
Models of Evolution and Learning 104
105
Parallelizing Genetic Algorithms.