Course Code: IT314 B
Credits: 3
Sessional Marks: 40 | End Exam Marks: 60 | End Exam: 3 Hours
Prerequisite(s): DBMS
| COs/POs-PSOs | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| CO1 | 2 | 2 | 3 | 1 | 3 | 1 | 1 | 1 | 2 | 1 | 1 | 3 | 2 | |
| CO2 | 2 | 3 | 3 | 3 | 3 | 2 | 1 | 1 | 2 | 1 | 1 | 3 | 2 | |
| CO3 | 1 | 3 | 3 | 3 | 3 | 2 | 1 | 1 | 2 | 1 | 1 | 3 | 2 | |
| CO4 | 3 | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 2 | 1 | 2 | 3 | 2 |
Topics: Introduction, differences with operational DBs, characteristics, architecture, ETL, data modeling, schema design (Star, Snowflake, Fact Constellation), measures, fact tables, OLAP cube, OLAP operations, OLAP server architecture (ROLAP, MOLAP, HOLAP).
Learning Outcomes:
Topics: Functionalities, classification of systems, task primitives, integration with DB/DW, major issues, preprocessing (cleaning, integration, transformation, reduction, discretization, hierarchy generation), applications and trends.
Learning Outcomes:
Topics: Problem definition, frequent itemset generation, Apriori principle, support & confidence, rule generation, Apriori algorithm, partition algorithms, FP-Growth, compact representation (maximal, closed itemsets).
Learning Outcomes:
Topics: Problem definition, approaches, evaluation, techniques (Decision Trees, Naïve Bayes, Bayesian Networks, KNN), prediction accuracy/error, ensemble methods.
Learning Outcomes:
Topics: Overview, categorization, partitioning (k-means), hierarchical (agglomerative, divisive), algorithms, key issues, strengths/weaknesses, outlier detection.
Learning Outcomes:
| Unit No | Changes Incorporated |
|---|---|
| Unit-II | Applications and Trends in Data Mining included (1%). |
| Name of the Course | Course Code | Year of Introduction | Activities/Content | Mapping |
|---|---|---|---|---|
| Data Warehousing and Data Mining | IT314(B) | R20 | Apriori Algorithm, KNN, FP-Growth, Compact Representation of Frequent Item Set | Employability |