We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2
MACHINE LEARNING (ELECTIVE-III)
M.Tech II Semester: Computer Science & Engineering
Course code Category Hours/week Credits Maximum Marks L T P C CIA SEE TOTAL 20CO204 PE 4 0 0 4 40 60 100 Contact Classes:60 Tutorial Classes: 0 Practical Classes: 0 Total Classes: 70 OBJECTIVES: The course should enable the students to : 1. Understand the human learning aspects and primitives in learning process by computer 2. Analyze the nature of problems solved with machine learning techniques 3. Design and implement suitable machine learning technique for a given application. UNIT-I INTRODUCTION Classes:12 Definition - Types of Machine Learning - Examples of Machine Learning Problems - Training versus Testing - Characteristics of Machine learning tasks - Predictive and descriptive tasks - Machine learning Models: Geometric Models, Logical Models, Probabilistic Models. Features: Feature types - Feature Construction and Transformation - Feature Selection. UNIT-II CLASSIFICATION AND CONCEPT LEARNING Classes:12 Classification: Binary Classification- Assessing Classification performance - Class probability Estimation - Multiclass Classification - Regression: Assessing performance of Regression - Error measures - Overfitting- Theory of Generalization: Effective number of hypothesis - Bounding the Growth function. UNIT-III LINEAR AND PROBABILISTIC MODELS Classes:13 Least Squares method - Multivariate Linear Regression - Perceptron, Multiple Layer Perceptron - Support Vector Machines - Kernel methods for non-Linearity - Probabilistic models for categorical data – Naïve Bayes Classifier UNIT-IV RULE BASED AND TREE BASED MODELS Classes:15 Rule Based Models: Rule learning for subgroup discovery - Association rule mining - Tree Based Models: Decision Trees - Ranking and Probability estimation Trees - Regression trees - Classification and Regression Trees (CART) UNIT-V DISTANCE BASED MODELS &TRENDS IN MACHINE Classes:15 LEARNING Distance Based Models: Neighbors and Examples - Nearest Neighbors Classification - Distance based clustering – K-Means Algorithm - K-Medoids Algorithm - Hierarchical clustering - Ensemble Learning, - Bagging and Boosting - Random Forest - Deep Learning - Reinforcement Learning Text Books: 1. P. Flach, “Machine Learning: The art and science of algorithms that make sense of data”, Cambridge University Press, 2012, ISBN-10: 1107422221, ISBN-13: 978-1107422223. 2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, “The Elements of Statistical Learning: Data Mining, Inference, and Prediction”, Second Edition (Springer Series in Statistics), 2016, ISBN-10: 0387848576, ISBN-13: 978-0387848570 . Reference Books: 1. Christopher Bishop, “Pattern Recognition and Machine Learning (Information Science and Statistics)”, Springer, 2007. 2. Kevin Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012, ISBN- 10: 0262018020, ISBN-13: 978-0262018029 3. Y. S. Abu-Mostafa, M. Magdon-Ismail, and H.-T. Lin, “Learning from Data”, AMLBook Publishers, 2012 ISBN 13: 978-1600490064. 4. Tom Mitchell, “Machine Learning”, McGraw-Hill, 1997, ISBN-10: 0071154671, ISBN- 13: 978-0071154673. Web References: 1. Httd://ww.udemy.com/MachineLearning/Online_Course 2. https://en.wikipedia.org/wiki/Machine_learning Outcomes: At the end of the course students able to 1. Describe the concepts, mathematical background, applicability, limitations of existing machine learning techniques. 2. Identify the performance evaluation criteria of the model developed 3. Analyze and design various machine learning based applications with a modern outlook focusing on recent advances. 4. Build the learning model for a given task 5. Apply some state-of-the-art development frameworks and software libraries for implementation 6. Evaluate the performance of machine learning algorithms using suitable metrics.