212122, 9:45 AM (ersten UNIVERSITY K L Deemed to be University Department of CSE —- KLVZA Course Handout 2021-2022, Even Sem (Course Title :ALFOR DATA SCI ‘Course Code :20CS2221AA L-T-P-S Structure -0-4a4 27 ‘Course Coordinator chaparala smitha chowdary am of Instructors ‘Teaching Associates Syllabus :Intuition of artificial intelligence, Applications of Al, Search fundamentals, the intuition of planning and searching, Intelligent search, Uninformed search strategies-BFS, DFS, Iterative deepening, bidirectional search. Heuristic Search Techniques: Greedy BFS, A*, AO*, Memory bounded heuristic functions. Local & Adversarial search: Optimization problems, hill climbing search, simulated annealing, Jocal beam search, genetic algorithms. Optimal decisions in games, alpha beta pruning, cutting of search, forward pruning, Constraint satisfaction problems: Inference in CSPs, back tracking search for CSPs, ‘Cannibals and missionaries problem using CSP, Solving puzzles using AT: Tic-tac-toe, Sudoku, Knowledge and reasoning: knowledge-based agents, Logic, propositional logics, and horn clauses, first order logic, Inference in first order logic, Propositional versus first order inference, unification and lifting, forward & ‘backward chaining, resolution, Conceptual dependency, Semantic nets. Handing uncertainty: Quantifying ‘uncertainty, basic probability notation, Bayes’ theorem, Probabilistic reasoning, representation of conditional distributions, probabilistic reasoning overtime, Hidden Markov model, Introduction to Neural Networks: Perceptrons, Back propagation networks. Data Science Process: Introduction to Data Science, ‘Understanding the types of data, Big data overview, Overview of Data Analytics Lifecycle, Discovery, Data Preparation, Model Planning, Model Building, Communicating Results and Findings, Operationalizing. ‘Data Analytics Process, Exploratory Data Analysis (EDA), EDA-Quantitative Technique, EDA - Graphical Technique, Data Analytics Conclusion or Predictions. Big Data Exploration, Importing, Summarizing, and ‘Visualizing Data: Data Analytics Communication, Data Types for Plotting Data Types and Plotting, Simple Line Plots, Simple Scatter Plots, Visualizing Errors, Density and Contour Plots, Histograms, Binnings, and Density, Customizing Plot Legends, Customizing Colour bars, Multiple Subplots. Data analysis and manipulation using Pandas. Probability and Independence-Using independence to find probabilities, Pairwise and mutual independence, Bernoulli Scheme, Law of total probability. Random variables, probability distribution functions, Variance, covariance, and correlation-Linear transformations of random variables, Functions of random variables, Geometric and Poisson distributions Aggregation and Grouping, Pivot Tables, Vectorized String Operations. Data Pre-processing: Feature Selection: Introduction to Feature selection techniques (Filter methods, Wrapper methods, Embedded methods, Hybrid methods). Outlier Detection: What Are Outliers? Types of Outliers, Challenges of Outlier Detection. Introduction to different types of Learning methods, Classification: Introduction to Classification and applications, k-Nearest Neighbours, Decision Trees, Support Vector Machine, Naive Bayes, Random Forest, Gradient Boosting, performance metrics (Precision, Recall, F-Measure). Regression Methods: Linear Regression, Polynomial Regression, Logistic Regression. Association Analysis: Association analysis with the Apriori algorithm. ‘Clustering: Unsupervised Learning and their Techniques. What Is Cluster Analysis. Requirements for ‘Cluster Analysis. Overview of Basic Clustering Methods. Partitioning Methods: k-Means: A Centroid- Based Technique. Text Mining: overview of natural language processing techniques and text representation, mixture models and how they work, Expectation-Maximization (EM) algorithm and how it can be used to estimate parameters of a mixture model. Time Series Forecasting: The fundamentals of Statistical Time Series analysis, the study of correlated random variables over time. Descriptive methods to describe trends, seasonal patterns, and autocorrelation in time series data. Working with Time Series, High-Performance Pandas: eval() and query(). Time Domain Methods of analysis such as Autoregression and ARIMA ‘15921222, 948 AM modelling will be presented. Frequency Domain Methods will also be covered. Anomaly Detection, ‘Recommendation Engines, Introduction to deep Learning- Model Evaluation: goal-based, process-based, and outcomes-based, Efficient Model Execution Text Books :1. Russel and Norvig, ‘Artificial Intelligence’, third edition, Pearson Education, PII, (2015) 2. ‘Deshpande, Balachandre Kotu, Vijay - Data science_ concepts and practice (2019, Elsevier) 3. Data science Hand book — Field cady- wiley Reference Books :1. Statistical inference for data science-Brian Caffo 2. Introducing Data science by Davy cielen, Amo D.B.Meysmen, Mohamed Ali Rishal Hurbans - Grokking Artificial Intelligence Algorithms (2020, Manning Publications) 3. Forecasting: principles and practice by Rob J Hyndman and George Athanasopoulos, 3rd Edition, OTexts. 4. Zacharias Voulgaris, Yunus Emrah Bulut - AI for Data Science_ Artificial Intelligence Frameworks and Functionality for Deep Learning, Optimization, and Beyond (2018, Technics Publications) 5. Usman Qamar, Muhammad Summair Raza - Data Science Concepts and ‘Techniques with Applications (2020, Springer) 6. Elaine Rich & Kevin Knight, ‘Artificial Intelligence’, 3nd Edition, Tata McGrawHill Edition, Reprint(2008) Web Links :1. https:!/www.linkedin.com/leamning/artificial-intelligencefoundations-machine-learning 2. https://www.coursera.org/leam/python-for-datavisualization# MOOCS :1. hiips://www.linkedin.com/learning/artificial-intelligencefoundations-machine-learning 2. https://www.coursera.org/learn/python-foredatavisualization# Course Rationale :Artificial intelligence is the general field of “intelligent-seeming algorithms” of which machine learning is the leading frontier at the moment. AL is just a computer that is able to mimic or simulate human thought or behavior. Within that, there’s a subset called machine learning that is now the ‘underpinning of the most exciting part of AI. By allowing computers to learn how to solve problems on their own, machine learning has made a series of breakthroughs that once seemed nearly impossible. Course Objectives :The objective of Artificial Intelligence for Data Science is that Data scientists should ‘be able to derive real-time actionable insights with AI that is well backed up with data. The objective behind AI is to permeate machines with human-like attributes to make them think, process, and act faster in a volatile market scenario. COURSE OUTCOMES (Cos): Blooms co 5, Taxonomy NO Course Outcome (CO) PO/PSO Level (BTL) Co} [Understand Artificial Intelligence as Representation and Search. | yo) po, 3 Apply Logic Programming Understand Data preprocessing, analysis and manipulation. 'CO2/ Apply Importing, Summarizing, and Visualizing Data, and PO3,PSO2 3 Feature selection Predict outcomes using regression and learn how to classify 'CO3 data. Discover hidden patterns and capture the possible natural | PSO2,PO2 3 groupings in the data Understand Data Science Algorithms for Association a 'CO4/ Anomaly detection, Deep learning, Recommenders, PSO2,PO2 2 forecasting ‘Cos Implement real world applications related to AT and Data S02,P0s 4 Science COURSE OUTCOME INDICATORS (COI: owcome con col2 co13 coLs COl 3 Btl-1 Btl-2 Bu-3 2189212122, 9:45 AM Intuition of artificial intelligence, Applications of Al, Search fundamentals, the intuition of planning and searching, Intelligent search, Uninformed search strategies-BFS, DFS, Genetic Algorithm, ‘Adversarial Search and Games: A +, alpha beta pruning, Game Theory Constraint sfaction Problems: problem using CSP, Solving puzzles using AI: Tic-tac-toe, Sudoku. Knowledge and reasoning, propositional logics and horn clauses. first order logic, Knowledge Representations Probabilistic Reasoning- Bayes’ theorem. Probabilistic Reasoning- Over ‘time, Logic Programming (Matching ‘mathematical expressions, Validating prim Parsing a family tree, Analysing Geography, Building a puzzle solver Bul Data Science Process: Overview of Data Science and Data Analytics Lifecycle. Data Exploration, Importing, Summarizing and Visualizing Data- Simple Btl2 EDA - Graphical +hnique.Data Bt Data Pre- processing. Feature selection: PCA (principal component analysis) filter based. Info gain Text Mining: overview of natural language processing techniques and text representationExpectation- Introduction to Deep Learning : Convolutional, Recurrent. Recommendation coz Line Plots, Simple Scatter |analysis using ° Plots, Visualizing Errors, |Pandas. Data (ter based) Chi- Density and Contour manipulating using ed ier 4 Plots, Histograms, Pandas. Selection Binnings, and Density, wrapper base 2) Customizing Plot Guapper based), Legends, Customizing climination Colour bars, Multiple nF ce Subplots (wrapper- based) BUl-3 Association Bth2 analysis- Apriori, Beet Artificial neural | Clustering: Classification: networks- ‘Unsupervised Introduction to Introduction to. [Learning and their Claceifieation and Neural Networks: | Techniques. What applications, Nearest |PeteePttons. Back [Is Cluster cos Neighbours. Decision | Propagation Analysis, Trees, Naive Bayes networks. Support | Requirements for Random Forest vector machines, | Cluster Analysis Performance exetrios Ensemble models _ | Overview of Basie (Precision, Recall, F- Regression Clustering Measure). 2 Methods: Linear —_|Methods. Regression, artitioning Logistic Regression | Methods: k-Means, A Centro O Based Technique. cod BELL Btl2 3159212122, 9:45 AM Maximization (EM). Time |Engines: series forecasting: Collaborative Decomposition, Filtering - Exponential smoothing, — neighbourhood ARIMA(autoregressive based, Latent integrated moving matrix average), Windowing- _| factorization, ‘based machine learning, | Recommendation Outlier Detection: Types _ | Engines: Content- of Outliers, Anomaly —_ [based filtering, ‘Detection: Distance- Supervised learning ‘based- Density-based, _| models. Model Local outlier factor Evaluation, Efficient Model Execution. COS Btl-4 Implement real world applications related to Al and Data Science PROGRAM OUTCOMES & PROGRAM SP IFIC OUTCOMES (POs/PSOs) Po No. Program Outcome POL Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems, PO2 Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences PO3 Design/Development of Solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations PO Conduct Investigations of Complex Problems:Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions for complex problems that cannot be solved by straightforward application of knowledge, theories and techniques applicable to the engineering discipline. POS Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modem engineering and IT tools including prediction and modelling to complex engineering activities with an understanding of the limitations. PO6 The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice. PO7 Environment and Sustainability:Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development POS Ethies: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice PO9 Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings. PO10 Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions 4159212122, 9:45 AM POLI Project Management and Finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. O12 |bite-long Leatning: Recognize the need for, and have the preparation and ability to engage in independent and lifelong learning in the broadest context of technological change. PSOI | An ability to design and develop software projects as well as Analyze and test user requirements /PSO2| An Ability to gain working Knowledge on emerging software tools and technologies Lecture Course DELIVERY Plan: Book | Teaching- Sess.No. CO | COL Topic No[CH No] | Learning | EvaluationComponents [Page No] | Methods ALM,ATTN, Continuous: Evaluation -Project,End : Semester Course Handout, Intuition of Exam,HA,Hackathon,Home (COL- artificial intelligence, T BOOK : 1 col 1 ‘Applications of AL, Search i PPT,Talk | Assignment,MOOCs fonlamentals. Certification, MOOCs I, Review,Ratings on Global Platforms,SEM- EXAMI,SEP the intuition of planning and 2 01 |©OF | searching, Intelligent search - [Text book 1 |PPT;Talk |E84 Semester Exam,SEM- 1 EXAMI Genetic Algorithm COL- Uninformed search strategies- |T BOOK End Semester Exam,SEM- 3 COl)) | Bes, DES tu, PPT Talk /EXAML \COI-| Adversarial Search and T BOOK End Semester Exam,SEM- 4 CONT Games: A +, alpha beta pruning |[1] PprTalk EXAMI Game Theory, Constraint 5 01 |°F | satisfaction Problems: problem |" BOOK | ppy-parx | End Semester Exam,SEM- 2 if EXAMI using CSP COL- Solving puzzles using Al: Tie- |T BOOK End Semester Exam,SEM- 6 CO1)) | tac-toe, Sudoku. tu, PPT. Talk | eXAMI Knowledge and reasoning: 5 COl- 'T BOOK End Semester Exam,SEM- 7 Co1|7O" propositional logies and horn |, PPT.Talk py eT clauses COI- | First order logic, Knowledge |T BOOK End Semester Exam,SEM- 8 CO1)7 | Representations [. PPT.Talk | EXAML COL- Probabilistic Reasoning» | BOOK End Semester Exam,SEM- 9 C01 Fe eee thom iat pprytak | pad Sem COL- Probabilistic Reasoning-Over_|T BOOK End Semester Exam,SEM- 10 col 3 time . tu. PPT,Talk EXAMI 5159)212122, 9:45 AM Book _ |Teaching- Sess.No. CO | COT Topic No[CHNo] Learning| EvaluationComponents [Page No] | Methods _|Logic Programming- Matching . nl co1/O°F mathematical expressions, | BOOK | pprtarx End Semester Exam,SEM: them i, EXAMI Validating primes. _| Logic Programming -Parsing a _ 12 col cor family tree, Analysing T BOOK | ppryraik | End Semester Exam SEM uy EXAMI Geography COI- T BOOK End Semester Exam,SEM- 13 (cor |$F Buitaing a puzzle solver i pPrytalk Fase ATTN,Continuous Evaluation -Project,End Semester Data Science Process: Exam,HA,Hackathon,Home 4 coz por Overview of Data Science and bs PPT,Talk | Assignment, MOOCs Data Analytics Lifecycle PI Certification, MOOCs Review,Ratings on Global Platforms,SEM- EXAMI,SEP (COL- Data Exploration, Importing, |T BOOK End Semester Exam,SEM- 15 C02} 7 | Summarizing PI PPTTalk | EXAMI Visualizing Data- Simple Line COI-| Plots, Simple Scatter Plots, 'T BOOK End Semester Exam,SEM- 16 €02/ 1" | Visualizing Errors, Density and |[2] PprTalk | EXAML Contour Plots, Histograms Visualizing Data- Binnings, (COF- and Density, Customizing Plot |T BOOK End Semester Exam,SEM- 7 C02)" "| Legends, Customizing Colour |[2] PPTTalk | EXAMI bars, Multiple Subplots, COl- 'T BOOK End Semester Exam,SEM- 18 |c02)9°F EDA Graphical Technique, |) pprytalk |paaser cor , T BOOK End Semester Exam,SEM- 19 C02) 9°F Data analysis using Pandas |) ppryTalk Eason 20 €02|COF | Data manipulating using TBOOK | pprytalk |End Semester Exam 2 Pandas. 2] sop |COF yn “i T BOOK End Semester Exam,SEM- 21 |€02|$°F Data Pre-processing ob pPrstalk pase Feature selection: PCA 22 co2|°F| (principal component analysis) |" BOOK | ppy-rarx | End Semester Exam,SEM- 3 Q EXAMI filter-based i590212122, 9:45 AM Book _ |Teaching- Sess.No. CO | COT Topic No[CHNo] Learning| EvaluationComponents [Page No] | Methods -op|COF T BOOK End Semester Exam,SEM- 23 |co2|$°™ no gain (filter-based) by pprytak |pyaSer col T BOOK End Semester Exam, SEM- 24 |C02|$°"|chiesquare (fiter-based) fA ppryTalk Ea Sem (COL- Forward Selection (wrapper- |T BOOK End Semester Exam,SEM- 25 co2 3 based) I PPT,Talk EXAMI COI-| Backward elimination T BOOK End Semester Exam,SEM- 26 [6002/3 | wrapper based) By PprTalk EXAMI ATTN Continuous Evaluation -Project,End Semester Classification: Introduction to Exam,HA,Hackathon,Home 27 co3 oor Classification and applications, DP PPT,Talk | Assignment, MOOCs ‘k-Nearest Neighbours. PI Certification, MOOCs, Review,Ratings on Global Platforms,SEM- EXAM2,SEP 503 CO | peo: . T BOOK End Semester Exam,SEM- 28 C03] 7°" |Decision Trees, Naive Bayes [5p PPTTalk EX aM? Random Forest, Performance 29 €03]©F |metries (Precision, Recall, F- [7 BOOK | ppryrayg |End Semester ExamSEM- 1 pl EXAM2 Measure). Antificial neural networks- . 30 cos Cor Introduction to Neural eae PPT, Talk Ea Semester Exam,SEM- ‘Networks: Pereeptrons col T BOOK End Semester Exam,SEM- 31 |c03]5°F| Back propagation networks | PPT, Talk |ena Sem 32 03 $F Support vector machines bs PPT;Talk |SEM-EXAMI COI T BOOK End Semester Exam,SEM- 33 |C03|°F Ensemble models ey PPTyTalk Fase (COL- Regression Methods: Linear |T BOOK End Semester Exam,SEM- 34603) |Regression pl PPT.Talk | EXAM? COL- Regression Methods: Logistic. |T BOOK End Semester Exam,SEM- 35 C03)" [Regression 2) PPTTalk ex AM? 7is9212122, 9:45 AM Book | Teaching- Sess.No.| CO | COL Topic No[CH No] Learning | EvaluationComponents [Page No] | Methods =03|COF| peso: se Apriony (7 BOOK End Semester Exam,SEM- 36 [C03] $F Association analysis- Arion’ | PPT,Talk Era COL-| Association analysis-FP- | T BOOK End Semester Exam,SEM- 7 603 !5 [Growth [2] PPDTalk px AM? Clustering: Unsupervised Learning and their Techniques. ‘COI-| What Is Cluster Analysis. 'T BOOK End Semester Exam,SEM- 38 |CO3)3°° Requirements for Cluster | [2] PprTalk EXAM? ‘Analysis Overview of Basic Clustering Methods Partitioning Methods: k- ; 39 |cos|©"|Means, A Centro O Based — | BOOK | ppr-payy. |End Semester Exam.SEM- 3 ‘ 21 EXAM2 Technique ATTN,Continuous Evaluation -Project,End Text Mining: overview of Semester Cor | natural language process T BOOK Exam, HA,Hackathon,Home 40 004 Te hniquecandtet By PPT,Talk | Assignment, MOOCs representation Certification, MOOCs Pres Review,Ratings on Global Platforms,SEM- EXAM2,SEP COI-|Expectation-Maximization | T BOOK, End Semester Exam,SEM- 41 cod OD Ry PPT;Talk | EN ety Time series forecasting: 5 42 c04|©F| Decomposition, Exponential |" BOOK | ppy-payx | End Semester Exam,SEM- 1 BI EXAM2 smoothing soy. Time seties forecasting: B co4|O| ARIMA(autorewressive TBOOK | ppr-qayy [Eid Semester Exam SEM- 2 ‘ BI EXAM2 integrated moving average) sor.| Time series forecasting: col T BOOK End Semester Exam,SEM- 44 cos] $F |windowing- based machine |) PPT;Talk EN ety learning Outlier Detection: Types of 45 co4 or Outliers, Anomaly Detection: bs PPT,Talk Fd Semester Exam,SEM- Distance-based- Density-based ‘COI-| Anomaly Detection : Local 'T BOOK End Semester Exam,SEM- 46 C04) 9 outlier factor BI PPLTalk px AM2 3159212122, 9:45 AM Book _ | Teaching Sess.No.| CO | COT Topic No[CH No] | Learning | EvaluationComponents [Page No] | Methods 4 |COF-|Introduetion to Deep Learning |T BOOK End Semester Exam,SEM- 47 C04). | Convolutional BI PPT.Talk | EXAM? cor . T BOOK End Semester Exam, SEM- 48 |co4]5°F Deep Leaming Recurrent [I pprytatk | fad Sem Recommendation Engines: 49 cos son Collaborative Filtering - rook | ppryTalk End Semester Exam,SEM- neighbourhood based BI Recommendation Engin 50 c04]©F| Coltaborative Filtering - Latent |" BOOK — | ppr-taix | End Semester Exam,SEM- 2 C BI EXAM? mattix factorization Recommendation Engines: 5 51 co4|©F| Content. based filtering, TBOOK — |ppr-tark |End Semester Exam,SEM- 2 } B] EXAM? Supervised leaming models COI Model Evaluation, Efficient |T BOOK End Semester Exam,SEM- i C04) | Model Execution. BI PPT Talk EXAM? Lecture Session wise Teaching — Learning Plan SESSION NUMBER: | Session Outcome: 1 Intuition of artificial intelligence, Applications of AI, Search fundamentals, Teaching- ‘Acti Time(min) Topic BTL) Learning | Learning Methods | Methods ~-- NOT 5 Attendance 1 PPT APPLICABLE ~-- NOT 10 Overview of the Course Handout 1 [PPT APPLICABLE --- NOT 5 Ask for any doubts 1 PPT APPLICABLE Intuition of artificial intelligence, Applications of AI, x Nor 20 'Bence, App mit |ppT APPLICABLE Search fundamentals, . --- NOT 10 Conclusion & Summary 1 [PPT APPLICABLE SESSION NUMBER : 2 Session Outcome: 1 the intuition of planning and searching, Intelligent search - Genetic Algorithm 9159,212122, 9:45 AM Time(min) Topic BIL| Teaching- A Learning | Learning Methods | Methods -- NOT 5 Attendance 1 |PPT APPLICABLE, NOT 20 the intuition of planning and searching, Intelligent search|1__ | PPT APPLICABLE NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, NOT 10 - Genetic Algorithm 1 |PPT APPLICABLE, NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE SESSION NUMBER : 3 Session Outeome: 1 Uninformed search strategies-BFS, DFS ‘Teaching- Active Time(min) Topic BTL) Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE, NOT 20 ‘Uninformed search strategies-BFS 1 |PPT APPLICABLE, NOT. 5 ‘Ask for any doubts 1 |ppT APPLICABLE, NOT 10 DES 1 |ppr APPLICABLE NOT 10 ‘Conclusion & Summary 1 |PPT APPLICABLE, SESSION NUMBER : 4 Session Outcome: 1 Adversarial Search and Games Teaching- Active Time(min) Topic BTL) Learning | Learning Methods | Methods --NOT 5 Attendance 1 |ppT APPLICABLE 20 vversarial Search and Games: A+ 1 [PPT NOT APPLICABLE 1059212122, 9:45 AM NOT. 5 ‘Ask for any doubts 1 |ppr APPLICABLE ~- NOT 10 alpha beta pruning 1 |ppr APPLICABLE ~-- NOT 10 Conclusion & Summary I PPT APPLICABLE SESSION NUMBER : 5 Session Outeome: 1 Game Theory Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods NoT 5 Attendance 1 PPT APPLICABLE Game Theory, Constraint satisfaction Problems: problem ~ NOT 20 7 * 2 |pPT APPLICABLE using CSP. “ ~-- NOT 5 Ask for any doubts I PPT APPLICABLE ‘Game Theory, Constraint satisfaction Problems: problem NOT 10 "y, Constraints ” 2 |ppr APPLICABLE using CSP “ --- NOT 10 Conelusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 6 Session Outcome: 1 Solving puzzles using AI: Tic-tac-toe, Sudoku. Teaching Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE, 20 Solving puzzles using AI: Tic-tac-toe, Sudoku. 2 |PPT One minute 5 Ask for any doubts 1 |PPT 10 Solving puzzles using Al: Tic-tac-toe, Sudoku continued |2. | PPT. APPLICABLE 10 ‘Conclusion & Summary I PPT --- NOT APPLICABLE ‘1180212122, 9:45 AM Session Outi SESSION NUMBER : 7 jcome: 1 Knowledge and reasoning: propositional logics and hom clauses Teaching- Time(min) Topic BTL| Learning | Learning Methods_| Methods ~-NOT 5 Attendance 1 PPT APPLICABLE NOT 20 Knowledge and reasoning: propositional logics 2 [per ‘APPLICABLE NOT 5 Ask for any doubts 1 |ppr APPLICABLE 10 horn clauses 2 |pPT Quiz/Test Questions --- NOT 10 Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER: 8 Session Outcome: I First order logic, Knowledge Representations Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods ~-NOT 5 Attendance 1 PPT APPLICABLE NOT 20 First order logic, 2 [per ‘APPLICABLE NOT 5 Ask for any doubts 1 |ppr APPLICABLE NOT 10 Knowledge Representations 2. PPT APPLICABLE NOT 10 Conclusion & Summary 1 [ppr APPLICABLE SESSION NUMBER : 9 Session Outcome: 1 Probabilistic Reasoning- Bayes’ theorem Teaching- | Active ‘Time(min) Topic BTL| Learning | Learning Methods Methods 5 Attendance 1 PPT --- NOT 12159212122, 9:45 AM APPLICABLE NOT 20 Probabilistic Reasoning 3 PPT APPLICABLE NOT 5 Ask for any doubts 1 |per "APPLICABLE --- NOT 10 = Bayes! theorem 3. [per APPLICABLE NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 10 Session Outcome: 1 Probabilistic Reasoning-Over time . ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE NOT 20 Probabilistic Reasoning-Over time 3. [per APPLICABLE NOT 5 Ask for any doubts 1 PPT APPLICABLE NOT 10 Over time. 3. [per APPLICABLE --- NOT 10 Conclusion & Summary 1 pr APPLICABLE SESSION NUMBER : I Session Outcome: I Logic Programming Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance I PPT APPLICABLE 20 Logic Programming- Matching mathematical 5 [per APPCCABLE expressions, Validating primes.. Al --- NOT s Ask for any doubts, 1 per APPLICABLE 13159212122, 9:45 AM 10 Logic Programming- Matching mathematical 3 |PPT --- NOT expressions, Validating primes.continued APPLICABLE NOT 10 Conelusion & Summary 1 [PPT APPLICABLE SESSION NUMBER : 12 Session Outcome: 1 Logic Programming -Parsing a family tree, Analysing Geography Teaching- ‘Active ‘Time(min) ‘Topic BIL) Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE, --NOT 20 Logic Programming -Parsing a family tree, 3 |PPT APPLICABLE NOT 5 ask for doubts 1 |pPr APPLICABLE, NOT 10 Analysing Geography 3 |PPT APPLICABLE NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE, SESSION NUMBER : 13 Session Outcome: 1 Building a puzzle solver ‘Teaching- Active Time(min) Topic BTL| Learning Learning Methods Methods ---NOT 5 Attendance 1 |pPT APPLICABLE, NOT 20 Building a puzzle solver 3 PPT APPLICABLE NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, NOT 10 Building a puzzle solver continued 3. |PPT APPLICABLE, NOT 10 Conclusion & Summary I PPT APPLICABLE SESSION NUMBER : 14 14i59212122, 9:45 AM Session Outcome: 1 Data Science Process: Overview of Data Seience Teaching- AC Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE --- NOT 20 Data Science Process: Overview of Data Science and [2 | PPT APPLICABLE --- NOT 5 Ask for any doubts I PPT APPLICABLE ---NOT 10 Data Analytics Lifecycle 2 |ppr APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE, SESSION NUMBER : 15 Session Outcome: 1 Data Exploration, Importing, Summarizing Teaching- ‘Active Time(min) Topic BTL) Learning | Learning Methods Methods --- NOT 5 Attendance 1 |PPT APPLICABLE, --- NOT 20 Data Exploration, Importing, 2 |ppr APPLICABLE ~- NOT 5 ‘Ask for any doubts 1 |pPT APPLICABLE, --NOT 10 Summarizing 2 PPT APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 16 Session Outcome: 1 Visualizing Data- ‘Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE 1559212122, 9:45 AM 20 Visualizing Data- Simple Line Plots, Simple Scatter. [2 [PPT NOT Plots, Visualizing Errors, Density and Contour Plots "APPLICABLE NOT 5 Ask for any doubts, 1 pr APPLICABLE NOT 10 Histograms 2 PPT APPLICABLE NOT 10 Conclusion & Summary 1 lpr "APPLICABLE SESSION NUMBER : 17 Session Outcome: 1 Visualizing Data- Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 per APPLICABLE Visualizing Data- Binnings, and Density, Customizing Not 20 Plot Legends, Customizing Colour bars, 2 |PPT APPLICABLE NOT 5 Ask for any doubts 1 lpr APPLICABLE NOT 10 Multiple Subplots, 2 |ppr APPLICABLE NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 18 Session Outcome: 1 EDA - Graphical Technique, ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 pr "APPLICABLE NOT 20 EDA - Graphical Technique, 2 |ppr APPLICABLE NOT 5 ‘Ask for any doubts 1 PPT APPLICABLE 10 EDA - Graphical Technique, 3. [PPT NOT APPLICABLE 16159212122, 9:45 AM NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 19 Session Outeome: 1 Data analysis using Pandas Teaching- A Time(min) Topic BIL) Learning | Learning Methods | Methods NOT 5 Attendance 1 |pPT APPLICABLE NOT 20 Data analysis using Pandas 2 |PPT APPLICABLE, NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, --NOT 10 Data analysis using Pandas continued 3. |PPT APPLICABLE --NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE SESSION NUMBER : 20 Session Outcome: 1 Data manipulating using Pandas. Teaching- Time(min) Topic BTL) Learning | Learning Methods | Methods NOT 5 Attendance 1 |ppr APPLICABLE --- NOT 20 Data manipulating using Pandas. 2 |ppr APPLICABLE --NOT 5 Ask for any doubts 1 |PPT APPLICABLE, ---NOT 10 Data manipulating using Pandas. 3 |ppr APPLICABLE -- NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE SESSION NUMBER : 21 Session Outcome: 1 Data Pre-processing 789212122, 9:45 AM Time(min) Topic BIL| Teaching- A Learning | Learning Methods Methods --- NOT 5 Attendance 1 |PPT APPLICABLE, NOT 20 Data Pre-processing, 2 PPT APPLICABLE NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, 7 Quiz/Test 10 Data Pre-processing 3. |PPT Questions --- NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE, SESSION NUMBER : 22 Session Outcome: | Feature selection Teaching- ‘Active Time(min) Topic BTL| Learning Learning Methods Methods --- NOT 5 Attendance 1 |pPT APPLICABLE Feature selection: PCA Lc anal! x Not 20 ‘ature selection: PCA (prineipal component analysis) |, | ppp APPLICABLE ilter-based “ --- NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, Feature selection: PCA (principal component analysis) ‘One minute 10 3 |pPT filter-based paper --- NOT 10 ‘Conclusion & Summary 1 |pPT APPLICABLE SESSION NUMBER : 23 Session Outcome: 1 Info gain (filter-based) Teaching- Active Time(min) Topic BTL| Learning Learning Methods Methods --- NOT 5 Attendance 1 |pPT APPLICABLE --- NOT 20 Info gain (filter-based) 3 PPT APPLICABLE 5 ‘Ask for any doubts 1 |PPT --NOT 1859212122, 9:45 AM APPLICABLE --NOT 10 Info gain (filter-based) continued 3 PPT APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 24 Session Outcome: 1 Chi-square (filter-based) Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE --- NOT 20 Chi-square (filter-based) 3 PPT APPLICABLE, --- NOT 5 Ask for any doubts 1 PPT APPLICABLE --- NOT 10 Chi-square (filter-based) continued 3. |PPT APPLICABLE --NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 25 Session Outcome: 1 Forward Selection (wrapper- based) Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE --- NOT 20 Forward Selection (wrapper- based) 3. |PPT APPLICABLE --- NOT 5 Ask for any doubts I PPT APPLICABLE --- NOT 10 Forward Selection (wrapper- based) 3 |pPT APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |pPT APPLICABLE, 19159212122, 9:45 AM SESSION NI {UMBER : 26 Session Outcome: 1 Backward elimination (wrapper- based) ‘Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods Methods = NOT 5 Attendance 1 pr "APPLICABLE --- NOT 20 Backward elimination (wrapper- based) 3 PPT APPLICABLE NOT 5 Ask for any doubts 1 per "APPLICABLE -- NOT. 10 Backward elimination (wrappet= based) 3. [per APPLICABLE NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 27 Session Outcome: I Classification: Introduction ‘Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE Classification: Introduction to Classification and Not 60 assification: Introduction to Classification an 3 per TPNCCABLE applications, NOT 5 Ask for any doubts 1 PPT APPLICABLE NOT 10 k-Nearest Neighbours. 3. [per APPLICABLE NOT 10 Conclusion & Summary 1 pr APPLICABLE SESSION NUMBER : 28 Session Outcome: 1 Decision Trees, Naive Bayes Teaching- | Active ‘Time(min) ‘Topic BYL| Learning | Learning Methods | Methods 5 Attendance 1 PPT --- NOT APPLICABLE, 20159212122, 9:45 AM NOT 20 Decision Trees, Naive Bayes 2 |pPr APPLICABLE --NOT 5 ‘Ask for any doubts 1 [PPT APPLICABLE -- NOT, 10 Naive Bayes 2 |pPr APPLICABLE --- NOT 10 (Conclusion & Summary 1 |pPr APPLICABLE SESSION NUMBER : 29 Session Outcome: 1 Random Forest, Performance metrics (Precision, Recall, F-Measure) ‘Teaching- Active Time(min) Topic BTL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 [PPT APPLICABLE --- NOT 20 Random Forest, 2 |pPr APPLICABLE --- NOT, 5 ‘Ask for any doubts 1 |pPr APPLICABLE -- NOT 10 Performance metrics (Precision, Recall, F-Measure). |2— | PPT APPLICABLE --- NOT 10 (Conclusion & Summary 1 |ppr APPLICABLE Session Outi SESSION NUMBER : 30 come: 1 Artificial neural networks- Introduction to Neural Netw forks: Perceptrons Teaching- ‘Acti Time(min) Topic BTL| Learning | Learning Methods | Methods —NOT 5 Attendance 1 PPT APPLICABLE Astificial neural networks- Introduction to Neural Nor 60 Arif neal neworks-nvodutin to Nera > lppr APNCCABLE fetworks: “ --- NOT 5 Ask for any doubts I PPT APPLICABLE 10 Percepirons 2 PPT —NOT 21159212122, 9:45 AM APPLICABLE --NOT 10 Conclusion & Summary I PPT APPLICABLE SESSION NUMBER : 31 Session Outcome: 1 Back propagation networks Teaching- ‘Acti Time(min) Topic BTL) Learning | Learning Methods | Methods ---NOT 5 Attendance 1 PPT APPLICABLE --- NOT 20 Back propagation networks 3. |PPT APPLICABLE --- NOT 5 Ask for any doubts I PPT APPLICABLE --- NOT 10 ‘Back propagation networks continued 3 |PPT APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |pPT APPLICABLE SESSION NUMBER : 32 Session Outcome: 1 Support vector machines Teaching- ‘Active ‘Time(min) ‘Topic BIL) Learning | Learning Methods Methods --- NOT 5 Attendance 1 |pPT APPLICABLE, --- NOT 20 Support vector machines 2 |ppr APPLICABLE ---NOT 5 Ask for any doubts 1 |pPT APPLICABLE --- NOT 10 Support vector machines 2 PPT APPLICABLE --- NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 33 Session Outcome: 1 Ensemble models 22189212122, 9:45 AM Teaching Active Time(min) Topic BTL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 |ppr APPLICABLE 20 Ensemble models 3. |PPT Geue iscussion --- NOT 5 Ask for any doubts 1 |ppr APPLICABLE NOT 10 Ensemble models, 3 |ppr APPLICABLE ‘NOT 10 Conelusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 34 Session Outcome: 1 Regression Methods: Linear Regression Teaching Active Time(min) Topic BIL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 [PPT APPLICABLE 20 Regression Methods: Linear Regression 3 |PPT Cee oon --- NOT 5 Ask for any doubts 1 |pPT APPLICABLE ~-- NOT 10 Regression Methods: Linear Regression 3 PPT APPLICABLE ‘NOT 10 ‘Conelusion & Summary 1 [PPT APPLICABLE SESSION NUMBER : 35 Session Outcome: 1 Regression Methods: Logistic Regression Teaching- ‘Acti Time(min) Topic BIL| Learning | Learning Methods Methods --- NOT 5 ‘Attendance 1 [PPT APPLICABLE 20 Regression Methods: Logistic Regression 3. PPT oe 5 Ask for any doubts I PPT --- NOT APPLICABLE 23159212122, 9:45 AM NOT 10 Regression Methods: Logistic Regression 3 |pPT APPLICABLE --NOT 10 ‘Conclusion & Summary 3. |PPT APPLICABLE SESSION NUMBER : 36 Session Outcome: 1 Association analysis- Apriori Teaching- Active Time(min) Topic BIL) Learning | Learning Methods | Methods NOT 5 Attendance 1 |PPT APPLICABLE, NOT 20 ‘Association analysis- Apriori 3 |ppr APPLICABLE, --NOT 5 ‘Ask for any doubts 1 |pPT APPLICABLE --NOT 10 ‘Association analysis- Apriori 3 |PPT APPLICABLE, --- NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 37 Session Outcome: 1 Association analysis- FP-Growth ‘Teaching- Active Time(min) Topic BTL) Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE --NOT 20 Association analysis- FP-Growth 3 |PPT APPLICABLE, ---NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE -- NOT 10 Association analysis- FP-Growth 3. |PPT APPLICABLE --NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE 24159212122, 9:45 AM SESSION NI {UMBER : 38 Session Outcome: 1 Clustering: Unsupervised Learning and their Techniques ‘Teaching ‘Active Time(min) Topic BTL| Learning | Learning Methods Methods ~- NOT 5 Attendance 1 |ppr APPLICABLE (Clustering: Unsupervised Learning and their Techniques. ~- NOT 20 What Is Cluster Analysis. Requirements for Cluster 3 PPT APPLICABLE [Analysis . _- ~-- NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE --- NOT 10 Overview of Basic Clustering Methods 3 |pPr APPLICABLE ‘NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 39 Session Outcome: 1 Partitioning Methods: k-Means, A Centro O Based Technique ‘Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE Partitioning Methods: k-Means, A Centro O Based Not 60 Patton Methods: k-Means, A Cento Base 3 per TPNCCABLE echnique NOT 5 Ask for any doubts 1 PPT APPLICABLE Partitioning Methods: k-Means, A Centro O Based Not 20 e 7 : 3. [per APPLICABLE ‘Technique NOT 5 Conclusion & Summary 1 per APPLICABLE, Session Outi SESSION NUMBER : 40 jcome: 1 Text Mining: overview of natural language processing t fechniques and text representation ‘Teaching ‘Active Time(min) Topic BTL| Learning | Learning Methods Methods 5 ‘Attendance 1 [PPT ~- NOT 25159212122, 9:45 AM APPLICABLE ‘Text Mi f natural I ss x Nor 10 ext Mining: overview of natural language processing || ppp XPPLICABLE techniques and al NOT 5 Ask for any doubts 1 |per "APPLICABLE --- NOT 10 text representation 2 |ppr APPLICABLE —NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 41 Session Outcome: I Expectation-Maximization (EM) ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods ~NOT 5 Attendance 1 PPT APPLICABLE NOT 20 Expectation-Maximization (EM) 2 |ppr "APPLICABLE NOT 5 ‘Ask for any doubts 1 PPT APPLICABLE NOT 10 Expectation-Maximization (EM) 2 |ppr APPLICABLE --- NOT 10 Conclusion & Summary 1 pr APPLICABLE SESSION NUMBER : 42 Session Outcome: I Time series forecasting: Decomposition, Exponential smoothing Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance I PPT APPLICABLE NOT 20 ‘Time series forecasting: Decomposition 2 |ppr "APPLICABLE --- NOT s Ask for any doubts, 1 per APPLICABLE 26159212122, 9:45 AM 10 Exponential smoothing 2 |PPT --NOT APPLICABLE NOT 10 ‘Conclusion & Summary 1 |PPT APPLICABLE, SESSION NUMBER : 43 Session Outcome: 1 Time series forecasting: ARIMA (autoregressive integrated moving average) Teaching- Active ‘Time(min) ‘Topic BIL) Learning | Learning Methods | Methods --NOT 5 Attendance 1 PPT APPLICABLE, Time series forecasting: ARIMA (autoregressive ~- NOT 20 e 8 2 |ppr APPLICABLE integrated moving average) ‘NOT 5 ‘Ask for any doubts 1 |PPT APPLICABLE ‘Time series forecasting: ARIMA (autoregressive Nor 10 ‘ e er 2 |PPT APPLICABLE integrated moving average) NOT 10 ‘Conclusion & Summary 1 |pPr APPLICABLE, SESSION NUMBER : 44 Session Outcome: 1 Time series forecasting: Windowing- based machine learning ‘Teaching- Active Time(min) Topic BIL) Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE, NOT 20 Time series forecasting: 2 |PPT APPLICABLE NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE NOT 10 ‘Windowing- based machine learning 2 |PPT APPLICABLE, NOT 10 ‘Conclusion & Summary 1 |ppT APPLICABLE SESSION NUMBER : 45 27189212122, 9:45 AM Session Outcome: 1 Outlier Detection: Types of Outliers, Anomaly Detection: Distance-based- Density based Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance I PPT APPLICABLE 0 Outlier Detection: Types of Outliers, Anomaly > per APRUICABLE Detection al --- NOT 5 Ask for any doubts 1 lpr APPLICABLE NOT 10 ‘Distance-based- Density-based 2. PPT APPLICABLE NOT 10 Conclusion & Summary 1 per APPLICABLE SESSION NUMBER : 46 Session Outcome: 1 Anomaly Detection : Local outlier factor Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods Methods = NOT 5 Attendance 1 per "APPLICABLE NOT 20 Anomaly Detection : Local outlier factor 2. PPT APPLICABLE NOT 5 Ask for any doubts 1 lpr "APPLICABLE NOT 10 ‘Anomaly Detection : 2 |ppr APPLICABLE NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE SESSION NUMBER : 47 Session Outcome: 1 Introduction to Deep Learning : Convolutional Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods 5 Attendance 1 [PPT —NOT APPLICABLE 28159212122, 9:45 AM -- NOT 20 Introduction to Deep Learning : Convolutional 2 |pPT APPLICABLE NOT 5 Ask for any doubts 1 |pPT APPLICABLE, NOT 10 Introduction to Deep Learning : Convolutional 2 |ppr APPLICABLE NOT 10 ‘Conclusion & Summary 1 |pPr APPLICABLE SESSION NUMBER : 48 Session Outcome: 1 Deep Learning :Recurrent Teaching- ‘Active ‘Time(min) ‘Topic BIL) Learning | Learning Methods Methods --- NOT 5 Attendance 1 |pPT APPLICABLE, NOT. 20 Deep Learning ‘Recurrent 2 |ppT APPLICABLE ‘NOT 5 ‘Ask for any doubts 1 |pPT APPLICABLE, NOT 10 ‘Deep Learning :Recurrent 2 PPT APPLICABLE NOT 10 ‘Conclusion & Summary 1 |ppr APPLICABLE SESSION NUMBER : 49 Session Outcome: 1 Recommendation Engines: Collaborative Filtering - neighbourhood based ‘Teaching- Active Time(min) Topic BTL| Learning Learning Methods | Methods NOT 5 Attendance 1 |pPT APPLICABLE, NOT 20 Recommendation Engines: Collaborative Filtering - 2 PPT APPLICABLE NOT 5 Ask for any doubts 1 PPT APPLICABLE 10 neighbourhood based 2 PPT --- NOT APPLICABLE 20159212122, 9:45 AM 10 Conclusion & Summary 1 |ppr NOT APPLICABLE, Session Outi SESSION NUMBER : 50 jcome: 1 Recommendation Engines: Collaborative Filtering - Latent matrix factorization Teaching- A Time(min) Topic BIL) Learning | Learning Methods | Methods NOT 5 Attendance 1 |pPT APPLICABLE NOT 20 Recommendation Engines: Collaborative Filtering- — |2_— | PPT APPLICABLE, NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE, --NOT 10 Latent matrix factorization 2 |pPT APPLICABLE --NOT 10 (Conelusion & Summary 1 |pPT APPLICABLE, Session Outi SESSION NUMBER : 51 jcome: 1 Recommendation Engines: Content- based filtering, Supervised learning models Teaching- ‘Act Time(min) Topic BTL) Learning | Learning Methods | Methods NOT 5 Attendance 1 |ppr APPLICABLE --- NOT 20 Recommendation Engines: Content-based filtering, |2_ | PPT APPLICABLE --NOT 5 Ask for any doubts 1 |PPT APPLICABLE, ---NOT 10 Supervised leaming models 2 |ppr APPLICABLE --NOT 10 ‘Conclusion & Summary 1 |pPT APPLICABLE SESSION NUMBER : 52 Session Outcome: 1 Model Evaluation, Efficient Model Execution. 20159212122, 9:45 AM Time(min) Topic BTL| Teaching- A Learning | Learning Methods Methods --- NOT 5 ‘Attendance 1 [PPT APPLICABLE ‘NOT 20 Model Evaluation, Efficient Model Execution. 2 PPT APPLICABLE NOT 5 Ask for any doubts 1 |ppr APPLICABLE NOT 10 Model Evaluation, Efficient Model Execution, 2 |PPT APPLICABLE NOT 10 ‘Conclusion & Summary 1 PPT APPLICABLE Tutorial Course DELIVERY Plan: NO Delivery Plan Exists ‘Tutorial Session wise Teaching — Learning Plan No Session Plans Exists Practical Course DELIVERY Plan: Tutorial Session ‘Topics CO-Mapping no 1 Run BFS and DFS algorithm on the tree and Maze cos 2 A* on MAZE,Greedy_ cos 5 Game theory (Prisoner's dilemma), GA (One Max algorithm), CSP(AC-3 | gg algorithm) 4 Working with propositional logic cos 5 Logic programming: cos 6 Markov model realization cos A Installing various packages: a) Ski-kit learn b) pandas (Completed in cos Pratical 1) c) Numpy d) seaborn Visualization with pandas and seabom a) scatter plot b) line plot c) boxplot 8 4) Bar plot e) Pair plots f) Joint distributions g) Histograms, KDE, and cos densities h) Heat map i) violin plot 9 Exploratory Data Analysis (EDA): (Part 1) cos 31159212122, 9:45 AM Tutorial Session Topics ‘CO-Mapping no 10 Exploratory Data Analysis (EDA): (Part 2) cos ul Data pre-processing, train test split cos 2 1. Encoder (Different types of encoding techniques) 2. PCA- Working with | a5 PCA for dimentionalty reduction 13 Working with Regression techniques: 1) Linear 2) Logistic cos 4 Working with classification techniques: 1) Decission tree, 2) Random forest |COS 15 KNN, Navie bayes cos 16 ‘Support vector machine (SVM), cos 7 ‘working with clustering techniques: K-means, centoroid based cos 18 Hidden mrkov model (HMM) cos 19 Working with NLTK packge for text processing: NLTK, text processing, |ags Parts of speech (Pos) tagging ~ 20 Page rank implementing cos 21 Working with ANN cos 22 ANN application for MINST data digit predition cos 23 ANN application for MINST data digit predition cos 24 Deep learing application for image classification cos Practical Session wise Teaching — Learning Plan SESSION NUMBER : | Session Outcome: 1 Run BFS and DFS algorithm on the tree and Maze Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE NOT 45 Run BFS algorithm on the tree and Maze 4 |ppr APPLICABLE 5 Ask for any doubts 1 PPT 22159212122, 9:45 AM APPLICABLE --NOT 45 DFS algorithm on the tree and Maze 4 PPT APPLICABLE SESSION NUMBER : 2 Session Outcome: 1 A* on MAZE,Greedy Teaching- ‘Acti Time(min) Topic BTL) Learning | Learning Methods | Methods --- NOT 5 Attendance 1 PPT APPLICABLE --- NOT 45 ‘A* on MAZE 4 |pPT APPLICABLE --- NOT 5 Ask for any doubts I PPT APPLICABLE --- NOT 45 Greedy BFS 4 PPT APPLICABLE SESSION NUMBER : 3 Session Outcome: 1 Game theory (Prisoner’s dilemma), GA (One Max algorithm), CSP(AC -3 algorithm) ‘Teaching Acti Time(min) Topic BTL| Learning Learning Methods | Methods ~-- NOT 5 Attendance 1 |ppr APPLICABLE Game theory (Prisoner's dilemma), GA (One Ma ~ NOT 45 ory (risoner's dilemma), ax 4 |PPT APPLICABLE, algorithm), ~-- NOT 5 ‘Ask for any doubts 1 |ppr APPLICABLE ~- NOT 45 CSP(AC-3 algorithm) 4 |PPT APPLICABLE SESSION NUMBER : 4 Session Outcome: 1 Working with propositional logic Teaching Active Time(min) ‘Topic BIL| Learning | Learning Methods Methods 5 Attendance I PPT --- NOT APPLICABLE, 33159212122, 9:45 AM NOT 45 ‘Working with propositional logic 4 |ppT APPLICABLE ~- NOT 5 Ask for any doubts 4 |pPT APPLICABLE, --- NOT 45 ‘Working with propositional logic continued 4 |PPT APPLICABLE SESSION NUMBER : 5 Session Outcome: 1 Logic programming: Teaching- A Time(min) Topic BTL) Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE --NOT 45 Logic programming: 4 |pPT APPLICABLE --NOT 5 Ask for any doubts 4 PPT APPLICABLE --- NOT 45 Logic programming: 4 |ppr APPLICABLE SESSION NUMBER : 6 Session Outcome: 1 Markov model realization ‘Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE, --- NOT 45 Markov model realization 4 |PPT APPLICABLE, --- NOT 5 Ask for any doubts 4 PPT APPLICABLE --- NOT 45 Markov model realization continuation 4 |pPT APPLICABLE SESSION NUMBER : 7 Session Outi jcome: 1 Installing various packages: 34159212122, 9:45 AM Time(min) Topic BTL| Teaching: | A Learning | Learning Methods Methods --- NOT 5 Attendance 1 pr APPLICABLE stalling various packages: a) Skickit learn b) pandas Nor 45 (Completed in Pratical 1) 4 |pPT APPLICABLE NOT 5 Ask for any doubts 4 |ppr "APPLICABLE NOT 45 c) Numpy d) seaborn 4 |ppr APPLICABLE SESSION NUMBER : 8 Session Outcome: 1 Visualization with pandas and seaborn ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance I PPT APPLICABLE ‘Visualization with pandas and seaborn a) seatter plot b) NOT 45 line plot e) boxplot d) Bar plot e) Pair plots f) Joint = |4_— | PPT APPLICABLE distributions g) Histograms, KDE, and densities NOT 5 Ask for any doubts, 4 |ppr APPLICABLE NOT 45 ‘h) Heat map i) violin plot 4 PPT APPLICABLE SESSION NUMBER : 9 Session Outcome: 1 Exploratory Data Analysis (EDA): (Part 1) ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 |per APPLICABLE NOT 45 Exploratory Data Analysis (BDA): (Part 1) 4 |ppr APPLICABLE NOT 5 Ask for any doubts 4 PPT APPLICABLE 45 Exploratory Data Analysis (EDA): (Part Ieontinued [4 [PPT NOT APPLICABLE 35159212122, 9:45 AM SESSION NUMBER : 10 Session Outcome: 1 Exploratory Data Analysis (EDA): (Part 2) Teaching- Time(min) Topic BTL| Learning | Learning Methods | Methods ~- NOT 5 Attendance I PPT APPLICABLE ‘NOT 45 Exploratory Data Analysis (EDA): (Part 2) 4 |PPT APPLICABLE NOT 5 Ask for any doubts 4 |pPT APPLICABLE NoT 45 Exploratory Data Analysis (EDA): (Part 2) continued [4 | PPT APPLICABLE, SESSION NUMBER : 1 Session Outeome: 1 Data pre-processing, train test split Teaching- A Time(min) Topic BTL| Learning Learning Methods | Methods ‘NOT 5 Attendance 1 |ppr APPLICABLE NOT 45 Data pre-processing 4 |PPT APPLICABLE ‘NOT 5 Ask for any doubts 4 PPT APPLICABLE ~-- NOT 45 «train test split 4 |ppr APPLICABLE, Session Outi SESSION NUMBER : 12 jcome: 1 1, Encoder (Different types of encoding techniques) 2. PCA- Working with PCA for dimentionalty reduction Teaching- Acti Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT, 5 Attendance 1 |pPr APPLICABLE 45 1. Encoder (Different types of encoding techniques) [4 | PPT. --- NOT, APPLICABLE, 26159212122, 9:45 AM NOT 5 ask for doubts 4 |ppr APPLICABLE ~- NOT 45 2, PCA- Working with PCA for dimentionalty reduction |4 | PPT APPLICABLE, SESSION NUMBER : 13 Session Outcome: 1 Working with Regression techniques: 1) Linear 2) Logistic Teaching Active Time(min) Topic BTL| Learning | Learning Methods Methods NOT 5 Attendance 1 |ppr APPLICABLE NoT 45 Working with Regression techniques: 1) Linear 4 PPT APPLICABLE ~- NOT 5 ‘Ask for any doubts 4 |PPT APPLICABLE ~- NOT 45 2) Logistic 4 PPT APPLICABLE SESSION NUMBER : 14 Session Outeome: 1 Working with classification techniques: 1) Decissi ion tree, 2) Random forest Teaching- ‘Act Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE Working with classification techniques: 1) Decission NOT. 45 ee ques: 4 |ppr "APPLICABLE --- NOT 5 Ask for any doubts, 4 |ppr APPLICABLE —NOT 45 2) Random forest 4 PPT APPLICABLE SESSION NUMBER : 15 Session Outcome: 1 KNN, Navie bayes Teaching- | Acti Time(min) Topic BTL| Learning | Learning Methods | Methods a7i59212122, 9:45 AM 5 Attendance 1 |pPT --- NOT APPLICABLE NOT 45 KNN, 4 |PPT APPLICABLE ‘NOT 5 Ask for any doubts 4 PPT APPLICABLE NOT 45 Navie bayes 4 |ppr APPLICABLE SESSION NUMBER : 16 Session Outcome: 1 Support vector machine (SVM), Teaching ‘Active Time(min) Topic BTL| Learning | Learning Methods Methods ~- NOT 5 ‘Attendance 1 |ppr APPLICABLE NOT 45 Support vector machine (SVM), 4 PPT APPLICABLE ‘NOT 5 ‘Ask for any doubts 4 |ppr APPLICABLE NOT 45 Support vector machine (SVM), continued 4 |PPT APPLICABLE SESSION NUMBER: 17 Session Outcome: 1 working with clustering techniques: K-means, centoroid based Teaching- Active Time(min) Topic BTL| Learning | Learning Methods Methods ~-- NOT 5 Attendance I PPT APPLICABLE NOT 45 ‘working with clustering techniques: K-means, 4 |ppr APPLICABLE NOT 5 Ask for any doubts 4 |pPT APPLICABLE ‘NOT 45 centoroid based 4 PPT APPLICABLE SESSION NUMBER : 18 38159212122, 9:45 AM Session Outi jcome: 1 Hidden mrkov model (HMM) Teaching- AC Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE --- NOT 45 Hidden mrkov model (HMM) 4 |pPT APPLICABLE --- NOT 5 Ask for any doubts 4 PPT APPLICABLE ---NOT 45 Hidden mrkov model (HMM) 4 |ppr APPLICABLE Session Outi SESSION NUMBER : 19 fcome: 1 Working with NLTK packge for text processing: NLTK, , text processing, Parts of speech (Pos) tagging ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE Working with NLTK packge for text processing: NLTK, ~ NOT 45 BNLTK, |g |ppr "APPLICABLE text processing, = NOT 5 Ask for any doubts 4 PPT APPLICABLE NOT 45 Parts of speech (Pos) tagging 4 |ppr "APPLICABLE SESSION NUMBER : 20 Session Outcome: 1 Page rank implementing Teaching- | Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 per "APPLICABLE --- NOT 45 Page rank implementing 4 |ppr APPLICABLE 5 Ask for any doubts 4 [PPT —NOT APPLICABLE 39159212122, 9:45 AM ~-NOT 45 Page rank implementing 4 |PPT APPLICABLE SESSION NUMBER : 21 Session Outcome: 1 Working with ANN Teaching ‘Active Time(min) Topic BIL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 |ppr APPLICABLE ‘NOT 45 Working with ANN 4 PPT APPLICABLE NOT 5 ‘Ask for any doubts 4 |ppr APPLICABLE NOT 45 ‘Working with ANN 4 |PPT APPLICABLE SESSION NUMBER : 22 Session Outcome: 1 ANN application for MINST data digit predition Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods ~- NOT 5 Attendance I PPT APPLICABLE ‘NOT 45 ANN application for MINST data digit predition, 4 |ppr APPLICABLE NOT 5 Ask for any doubts 4 |PPT APPLICABLE ‘NOT 45 ANN application for MINST data digit predition 4 PPT APPLICABLE SESSION NUMBER : 23 Session Outeome: 1 ANN application for MINST data digit predition Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods ~-- NOT 5 Attendance 1 |ppr APPLICABLE 45 ANN application for MINST data digit predition 4 [PPT 40/89212122, 9:45 AM APPLICABLE --NOT 5 Ask for any doubts 4 PPT APPLICABLE --- NOT 45 ANN application for MINST data digit predition 4 |ppr APPLICABLE SESSION NUMBER : 24 Session Outcome: 1 Deep learing application for image classification Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |pPT APPLICABLE --- NOT 45 ‘Deep learing application for image classification 4 |PPT APPLICABLE, --- NOT 5 Ask for any doubts 1 PPT APPLICABLE --- NOT 35 Deep learing application for image classification 4 |PPT APPLICABLE Skilling Course DELIVERY Plan: Skilling session Topics/Experiments CO-Mapping no 1 Practicing Python’s most noteworthy features to get good idea of the cos language's flavor and style. Getting acquainted with the widely used array-processing library in Python, 2 cos NumPy, 3 Creating Pandas Dataframes and practice Basics of Pandas Dataframes cos 4 Reading and Writing Files in Python with Pandas cos 5 Working with Missing Data in Pandas cos Practice Pandas Groupby, Pandas Merge, Frequency Distribution of Pandas 6 As cos Dataframe Column 7 Finding and removing duplicate rows in Pandas DataFrame, Sort the Pandas | as DataFrame 4189212122, 9:45 AM Skilling session no Topics/Experiments CO-Mapping plotting with matplotlib cos plotting with pandas, Practice additional plot types available in pandas plotting cos 10 plotting with seaborn, formatting and labeling plots, Practice various functions for working with colors in Python, Visualizations for illustrating seaborn, reference lines, and itertools cos u Plot customizations including reference lines, annotations, and custom colormaps, plotting data on a map using COVID-19 cases worldwide cos 12 Implementation of data science algorithms in GUI using RapidMiner. Feature selection: Selection of most important attributes. a) PCA (principal component analysis) filter-based b) Info gain (filter-based) c) Chi-square (filter-based) Backward elimination (wrapper- based) cos 1B Implementation of data science algorithms in GUI using RapidMiner. Classification: Predicting a categorical target variable. a) Decision trees b) Rule induction c) k-Nearest neighbors Develop Nearest-neighbors classifier with Exploratory data analysis and Preprocessing 14 Implementation of data science algorithms in GUI using R: Classification: Predicting a categorical target variable. a) Naive Bayesian b) ‘Support vector machines c) Ensemble randomforest Develop Naive Bayes classifiers with Exploratory data analysis and Preprocessing cos 15 Implementation of data science algorithms in GUI using RapidMiner. Regression: Predicting a numeric target variable. a) Linear regression b) Logistic regression Develop linear regression models using the planet data with Exploratory data analysis and Preprocessing cos 16 Implementation of data science algorithm in GUI using RapidMiner. Clustering: An unsupervised process for finding meaningful groups in data, a) k-Means Develop a clustering model using the planet data with Exploratory data analysis and Preprocessing cos 7 Implementation of data science algorithm in GUI using RapidMiner. Association analysis: Unsupervised process for finding relationships between items. a) FP-Growth and Apriori Develop a classification model to predict red wine quality with Exploratory data analysis and Preprocessing cos 18, Ilustrate how unstructured data can be mined using web mining features of RapidMiner by implementing a) Keyword Clustering b) Predicting the Gender of Blog Authors cos 42189212122, 9:45 AM Skilling session no Topics/Experiments CO-Mapping 19 Implementation of data science algorithms in GUI using RapidMiner. Time series forecasting: Predicting future value of a variable. a) Decomposition b) Exponential smoothing c) ARIMA (autoregressive integrated moving cos average) d) Windowing- based machine learning Analysing financial time series data using pandas 20 Implementation of data science algorithms in GUI using RapidMiner. Anomaly detection: Supervised and unsupervised techniques to find outliers | yg in data. a) Anomaly detection b) Distance-based c) Density-based Local outlier factor 21 To test a classification model’s quality using RapidMiner - Model Evaluation: confusion matrices (or truth tables), lift charts, ROC (receiver operator characteristic) curves, arca under the curve (AUC). Making Better Predictions by Optimizing Models: a) Illustrate How to use grid search to tune model hyperparameters, gather feature importances, and use cos regularization with the linear regression model. b) Generating polynomial and interaction features, creating feature unions, and building ensemble models with the red wine quality classifier c) Dimensionality reduction, decision trees, and error analysis using the white or red wine classifier 22 Develop a Convolutional Neural Network from Scratch for MNIST. Handwritten Digit Classification using RapidMiner. Handwritten Digit cos Recognition using Convolutional Neural Networks in Python with Keras 23 Implementation of data science algorithms in GUI using RapidMiner. Recommenders: Finding the user’s preference of an item. a) Collaborative | Gas Filtering - neighborhood based b) Collaborative Filtering - Latent matrix factorization c) Content- based filtering 24 Financial Analysis — Bitcoin and the Stock Market: creation of the stock_analysis Python package. creation of classes for collecting stock data, | yg visualizing asset performance, performing technical analysis on financial instruments, and modeling performance using historical data Skilling Session wise Teaching — Learning Plan SESSION NUMBER : 1 Session Outeome: 1 Practicing Python's most noteworthy features to get good idea of the language’s flavor and style. Teaching- Active Time(min) Topic BIL) Learning | Learning Methods Methods --- NOT 5 Attendance I PPT APPLICABLE 45 Practicing Python’s most noteworthy features to get [4 | PPT --- NOT ‘good idea of the language’s flavor and style. APPLICABLE, 4259212122, 9:45 AM NOT. 5 ‘Ask for any doubts 1 |ppr APPLICABLE ~- NOT 45 Experiment continued 4 |PPT APPLICABLE Session Outi SESSION NUMBER : 2 jcome: 1 Getting acquainted with the widely used array-processing library in Python, NumPy. Teaching Active Time(min) Topic BIL| Learning | Learning Methods | Methods NOT 5 Attendance 1 |ppT APPLICABLE Getting acquainted with the widely used array- Nor 45 8 acquainted y y 4 |ppr APPLICABLE processing library in Python, NumPy. “ ~- NOT 5 Ask for any doubts 1 [PPT APPLICABLE ~-- NOT 45 Experiment continued 4 |PPT APPLICABLE, Session Outi SESSION NUMBER : 3 ‘come: 1 Creating Pandas Dataframes and practice Basics of Pandas Dataframes Teaching- Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 PPT APPLICABLE Creating Pandas Dataframes and practice Basics of NOT. 45 ® 4 |ppr "APPLICABLE Pandas Dataframes = —-NOT 5 Ask for any doubts, 1 per APPLICABLE —NOT 45 Experiment continued 4 PPT APPLICABLE SESSION NUMBER : 4 Session Outcome: 1 Reading and Writing Files in Python with Pandas Teaching» | Acti Time(min) Topic BTL| Learning | Learning Methods | Methods 4189212122, 9:45 AM 5 Attendance 1 |pPr NOT "APPLICABLE NOT 45 Reading and Writing Files in Python with Pandas 4 |ppr APPLICABLE NOT 5 Ask for any doubts 1 PPT APPLICABLE NOT 45 Experiment continued 4 |ppr APPLICABLE SESSION NUMBER : 5 Session Outcome: 1 Working with Missing Data in Pandas Teaching» | Active Time(min) Topic BTL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 per APPLICABLE NOT 45 Working with Missing Data in Pandas 4 PPT APPLICABLE NOT 5 Ask for any doubts 1 lpr APPLICABLE NOT 45 Experiment continued 4 |ppr APPLICABLE SESSION NUMBER : 6 Session Outcome: I Practice Pandas Groupby, Pandas Merge, Frequency Distribution of Pandas Dataftame Column Teaching- | Active Time(min) ‘Topic BTL| Learning | Learning Methods Methods —- NOT 5 Attendance 1 per "APPLICABLE Practice Pandas Groupby, Pandas Merge, Frequency Nor 45 Distribution of Pandas Dataframe Column per APPLICABLE NOT 5 Ask for any doubts pr APPLICABLE NOT 45 Experiment continued PPT APPLICABLE SESSION NUMBER : 7 45/59212122, 9:45 AM Session Outcome: 1 Finding and removing duplicate rows in Pandas DataFrame, Sort the Pandas DataFrame Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 [pr APPLICABLE . . ~-- NOT Finding and removing duplicate rows in Pandas 45 DataFrame, Sort the Pandas DataFrame 4 Per APPLICABLE ~-- NOT 5 ‘Ask for any doubts 1 |ppT APPLICABLE ~-- NOT 45 Experiment continued 4 |ppr APPLICABLE SESSION NUMBER : 8 Session Outeome: 1 plotting with matplotlib ‘Teaching Acti Time(min) Topic BTL| Learning | Learning Methods | Methods ~-- NOT 5 Attendance 1 [PPT APPLICABLE ~- NOT 45 plotting with matplotlib 4 |pPT APPLICABLE ~-- NOT 5 ‘Ask for any doubts 4 |ppr APPLICABLE ~- NOT 45 Experiment continued 4 |pPT APPLICABLE SESSION NUMBER : 9 Session Outcome: 1 plotting with pandas, Practice additional plot types available in pandas plotting Teaching Active Time(min) Topic BIL| Learning | Learning Methods | Methods ~- NOT 5 Attendance 1 [PPT APPLICABLE lotting with pandas, Practice additional plot types x Nor 45 plowing with panes, Plot typ 4 |Talk APPLICABLE available in pandas.plotting “ ~-- NOT 5 Ask for any doubts 1 [PPT APPLICABLE 465/69212122, 9:45 AM 45 Experiment continued 4 |PPT --- NOT. APPLICABLE Session Outi SESSION NUMBER : 10 come: 1 plotting with seaborn, formatting and labeling plots, Practice various functions for working with colors in Python, Visualizations for illustrating seaborn, reference lines, and itertools ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 pr APPLICABLE plotting with seabom, formatting and labeling plots, NOT Practice various functions for working with colors in 45 Python, Visualizations for illustrating seaborn, reference PPT APPLICABLE lines, and itertools 7 NOT 5 Ask for any doubts, 4 |ppr APPLICABLE NOT 45 Experiment continued 4 PPT APPLICABLE Session Out. plotting data SESSION NUMBER : 11 ‘on a map using COVID-19 cases worldwide jcome: 1 Plot customizations including reference lines, annotations, and custom colormaps, Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods ~-- NOT 5 Attendance I PPT APPLICABLE Plot customizations including reference lines, ~-- NOT 45 annotations, and custom colormaps, plotting dataona |4_— | PPT APPLICABLE map using COVID-19 cases worldwide — --- NOT 5 Ask for any doubts 4 |pPT APPLICABLE ~-- NOT 45 Experiment continued 4 PPT APPLICABLE Session Outi Selection of SESSION NUMBER : 12 ‘come: 1 Implementation of data science algorithms in GUI ‘most important attributes. 1 using RapidMiner. Feature selection: Time(min) Topic Teaching- Active BTL) Learning | Learning Methods | Methods 47189212122, 9:45 AM 5 Attendance 1 [PPT --NOT ‘APPLICABLE Implementation of data science algorithms in GUI using RapidMiner. Feature selection: Selection of most _Nor important attributes. a) PCA (prineipal component 45 analysis) filter-based b) Info gain (filter-based) c) Chi. [4 |PPT APPLICABLE. ‘square (filter-based) Backward elimination (wrapper- 7” based) ~-NOT 5 Ask for any doubts 4 [per APPLICABLE --- NOT 45 Experiment continued 4 |ppr ‘APPLICABLE Session Outi SESSION NUMBER : 13 come: 1 Implementation of data science algorithms in GUI 1 using RapidMiner. Classification: Predicting a categorical target variable. ‘Teaching A Time(min) Topic BTL| Learning | Learning Methods Methods ~-- NOT 5 Attendance 4 |PPT APPLICABLE Implementation of data science algorithms in GUI using RapidMiner. Classification: Predicting a categorical -- NOT 45 target variable, a) Decision trees b) Rule induction c) k- |4 | PPT APPLICABLE Nearest neighbors Develop Nearest-neighbors classifier a ‘with Exploratory data analysis and Preprocessing NOT 5 Ask for any doubts 4 |PPT APPLICABLE ‘NOT 45 Experiment continued 4 PPT APPLICABLE Session Outi SESSION NUMBER : 14 jcome: 1 Implementation of data science algorithms in GUI using RapidMiner. Classification: target variable. a) Naive Bayesian b) Support vector machines c) Ensemble randomforest Develop Naive Predicting a categorical target variable. Teaching- Acti Time(min) Topic BTL| Learning | Learning Methods | Methods ~-- NOT 5 Attendance I PPT APPLICABLE 45 Implementation of data science algorithms in GUT using |4 | PPT ~-- NOT RapidMiner. Classification: Predicting a categorical APPLICABLE 45/59212122, 9:45 AM Bayes classifiers with Exploratory data analysis and Preprocessing ~-- NOT 5 Ask for any doubts 4 PPT APPLICABLE ~-- NOT 45 Experiment continued 4 |ppr APPLICABLE Session Outi SESSION NUMBER : 15 ‘come: 1 Implementation of data science algorithms in GUI 1 using RapidMiner. Regression: Predicting a numeric target variable, Teaching- A Time(min) Topic BTL| Learning | Learning Methods | Methods ~-- NOT 5 Attendance 1 |ppr APPLICABLE Implementation of data science algorithms in GUT using RapidMiner, Regression: Predicting a numeric target --- NOT 45 variable. a) Linear regression b) Logistic regression [4 | PPT APPLICABLE Develop linear regression models using the planet data _ with Exploratory data analysis and Preprocessing NOT 5 ‘Ask for any doubts 1 |pPr APPLICABLE --- NOT 45 Experiment continued 4 |PPT APPLICABLE Session Outi SESSION NUMBER : 16 jcome: 1 Implementation of data science algorithm in GUI unsupervised process for finding meaningful groups in data. using RapidMiner. Clustering: An Teaching- ‘Active Time(min) Topic BIL| Learning | Learning Methods Methods --- NOT 5 Attendance 1 |ppr APPLICABLE Implementation of data science algorithm in GUI using RapidMiner. Clustering: An unsupervised process for -- NOT 45 finding meaningful groups in data. a) K-Means Develop |4 |PPT APPLICABLE a clustering model using the planet data with Exploratory data analysis and Preprocessing --- NOT 5 Ask for any doubts 4 |ppT APPLICABLE NOT 45 Experiment continued 4 |ppr APPLICABLE 49/59212122, 9:45 AM SESSION NUMBER : 17 Session Outcome: 1 Implementation of data science algorithm in GUI using RapidMiner. Association analysis: Unsupervised process for finding relationships between items. ‘Teaching- ‘Active Time(min) Topic BTL| Learning | Learning Methods | Methods NOT 5 Attendance 1 |per APPLICABLE [Implementation of data science algorithm in GUI using RapidMiner. Association analysis: Unsupervised process Not for finding relationships between items. a) FP-Growth = 45 land Apriori Develop a classification model to predict red Per: APPLICABLE ‘wine quality with Exploratory data analysis and Preprocessing —NOT 5 Ask for any doubts 4 |ppr APPLICABLE = NOT 45 Experiment continued 4 |ppr ‘APPLICABLE Session Outi SESSION NUMBER : 18 jcome: 1 Illustrate how unstructured data can be mined using web mining features of RapidMiner by implementing Teaching» | Active Time(min) Topic BTL ‘Learning Methods NOT 5 Attendance 1 per "APPLICABLE Illustrate how unstructured data can be mined using web Nor mining features of RapidMiner by implementing a) ABLE 45 Keyword Clustering b) Predicting the Gender of Blog per APPLICABLE Authors: 7 NOT 5 Ask for any doubts 1 PPT APPLICABLE NOT 45 Experiment continued 4 |ppr "APPLICABLE Session Outi SESSION NUMBER : 19 jcome: 1 Implementation of data science algorithms in GUI using RapidMiner. Time series forecasting: Predicting future value of a variable. Teaching- Acti Time(min) Topic BTL| Learning | Learning Methods | Methods 5 ‘Attendance 1 PPT ~-- NOT s0is9212122, 9:45 AM APPLICABLE Implementation of data science algorithms in GUI using RapidMiner. Time series forecasting: Predicting future 45 value of a variable. a) Decomposition b) Exponential pr SPO CABLE smoothing c) ARIMA (autoregressive integrated moving “A average) d) Windowing- based machine learning Analysing financial time series data using pandas ~-- NOT 5 ‘Ask for any doubts 1 (PPT APPLICABLE --- NOT 45 Experiment continued 4 PPT APPLICABLE SESSION NUMBER : 20 Session Outcome: I Implementation of data science algorithms in GUI using RapidMiner, Anomaly detection: Supervised and unsupervised techniques to find outliers in data. Teaching Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 [PPT APPLICABLE Implementation of data science algorithms in GUI using RapidMiner. Anomaly detection: Supervised and -- NOT 45 ‘unsupervised techniques to find outliers in data. a) 2 PPT APPLICABLE Anomaly detection b) Distance-based c) Density-based ~ Local outlier factor ~-- NOT 5 Ask for any doubts I PPT APPLICABLE ~-- NOT 45 Experiment continued 2 |ppr APPLICABLE SESSION NUMBER : 2 Session Outcome: 1 To test a classification model’s quality using RapidMiner - Model Evaluation: confusion matrices Teaching- Active Time(min) Topic BTL| Learning | Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE 45 To test a classification model’s quality using RapidMiner |4 | PPT ~- NOT ~ Model Evaluation: confusion matrices (or truth tables), APPLICABLE lift charts, ROC (receiver operator characteristic) curves, - ‘area under the curve (AUC). Making Better Predictions by Optimizing Models: a) Illustrate How to use grid search to tune model hyperparameters, gather feature 51159212122, 9:45 AM importances, and use regularization with the linear regression model. b) Generating polynomial and interaction features, creating feature unions, and building ensemble models with the red wine quality classifier ¢) Dimensionality reduction, decision trees, and error analysis using the white or red wine classifier --- NOT 5 Ask for any doubts PPT APPLICABLE ~-- NOT 45 Experiment continued per APPLICABLE Classificatio Python with SESSION NUMBER : 22 Session Outcome: 1 Develop a Convolutional Neural Network from S mn using RapidMiner. Handwritten Digit Recognition using Keras for MNIST Handwritten Digit Convolutional Neural Networks in Teaching Active Time(min) Topic Learning | Learning Methods Methods ~-- NOT 5 Attendance PPT APPLICABLE Develop a Convolutional Neural Network from Seratch NOT for MNIST Handwritten Digit Classification using % 45 RapidMiner. Handwritten Digit Recognition using per APPLICABLE Convolutional Neural Networks in Python with Keras ‘NOT 5 ‘Ask for any doubts per APPLICABLE NOT 45 Experiment continued per APPLICABLE Session Outi SESSION NUMBER : 23 ‘come: 1 Implementation of data science algorithms in GUI Finding the user’s preference of an item. 1 using RapidMiner, Recommenders: Teaching ‘Active Time(min) Topic Learning | Learning Methods Methods ~- NOT 5 Attendance per APPLICABLE Implementation of data science algorithms in GUI using RapidMiner. Recommenders: Finding the user’s NOT 45 preference of an item. a) Collaborative Filtering - per. APPLICABLE neighborhood based b) Collaborative Filtering - Latent a matrix factorization c) Content- based filtering --- NOT 5 Ask for any doubts per APPLICABLE 52159212122, 9:45 AM 45 Experiment continued 4 |PPT --- NOT APPLICABLE Session Outi SESSION NUMBER : 24 ‘come: 1 Financial Analysis — Bitcoin and the Stock Market: creation of the stock_analysis, Python package Teaching- Active Time(min) Topic BTL| Learning Learning Methods | Methods --- NOT 5 Attendance 1 |ppr APPLICABLE Financial Analysis — Bitcoin and the Stock Market: creation of the stock_analysis Python package. creation __-NOT 45 of classes for collecting stock data, visualizing asset _ pr APPLICABLE performance, performing technical analysis on financial instruments, and modeling performance using historical data, --- NOT 5 ‘Ask for any doubts 4 |ppT APPLICABLE --- NOT 45 Experiment continued 4 |pPT APPLICABLE ete: WEEKLY HOMEWORK ASSIGNMENTS! PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES Assignment | Assignment Week| pe No Topic Details co COURSE TIME TABLE: Hour 1 2 3 4 5 6 | 8 | 9 Day [Component Mon v- [Ve SILV- |S11,V- Theo: $12,V- |S12,V- | _ _ Ph _ "Y |813,V- |813,V- - S14,V. |814,V- sis [sis Tutorial | - ~ ~ _ -|- |~ Sey V-S6,V-S6,V- . Veegy. —_ |STAN>S7.V-S8,V- Lab - - S8,V-S8,V- -|- | , $8,V-S9,V-S9,V- S9.V-S9V- [ETSY - '$10,V-S10 " 53i59212122, 9:45 AM Skilling | -- - -- a fe Ve |v $6,V- |S6,V- $7,V- | S7,V- SRV |S8.V- S9.V-|S9.V- s10_|s10 vV- Vv. S6,V- SIL,V- Theory |. [SAE | ode {S12 y S8,V- S13,V- S9,V- S14,V- si0 S15 Tutorial | — |-- - - ae fe |. Tue V-SIL,V-SIL,V- | V-S11,V-S11,V- S12,V-S12,V- |$12,V-S12,V- Lab a fe S13,V-S13,V- |S13,V-S13,V- |---| | S14,V-S14,V- |$14,V-S14,V- S15,V-S15 S15,V-SIS Skilling | — [-- - - a fee — |- Theory | | - ~ ~ I |— Tutorial [| | - - - | VSIVSEN- /v.$1,V-S1,V- S2.V-82.V- $2,V-S2,V-S3,V- Wed | Lab. a= a '$3,V-S3,V- ea ereau an |. jj $3,V-S4,V-S4,V- s4vsay- [Sovegy S5,V-S5 a Skilling | | |- - ale Thu v- |v. S1V- |S1,V- $2,V- /S2,V- Theory save [save |” — | S4,V. /S4,v- SS SS Tutorial | - - oo - - ale ‘Lab _ leo = — _ - i | Skilling | -- = = - - l= s4i59