Program Structure & Detailed Syllabus (VR22)
III Year 1Semester B. Tech (CSE)-VR22 L T P C
Course Code: DATAWARE HOUSING AND
DATAMINING 3 0 0 3
1005223104
COURSE OBJECTIVES:
• To understand data warehouse and determining concepts, architecture,
business analysis and tools
• To understand data pre-processing and data visualization techniques
• To study algorithms for finding hidden and interesting patterns in data
• Tounderstandandapplyvariousclassificationandclusteringtechniquesonr
eal-timedata
COURSE OUTCOMES:
At the end of the course the student will have the ability to:
CO’s
Identify stages in building a Data Warehouse and challenges in Data
CO1 mining
Access raw input data and apply data pre-processing techniques,
generalization techniques and data characterization techniques
CO2
top provide suitable input for arrange of data mining algorithms
Analyze determining technique silk reclassification and Association rules that
CO3 can be applied to data objects and to and the interesting patterns.
CO4 Solve real world problems by using the various Clustering methods
UNIT-I
Introduction: What Motivated Data Mining? Why Is It Important? Knowledge Discovery
Process, Data Mining—On What Kind of Data, Data Mining Functionalities—What Kinds
of Patterns Can Be Mined? Classification of Data Mining Systems, Data Mining Task
Primitives, Major Issues in Data Mining Data Pre-processing: Why Pre-process the Data?
Data Cleaning, Data Integration, Data Transformation, Data Reduction and Data
Discretization.
[10Hours]
UNIT-II
Data Warehouse and OLAP Technology: An Overview: What Is a Data
Warehouse? LAP versus OLTP, A Multidimensional Data Model- Data Warehouse
Schemas, Concept Hierarchies, Typical OLAP Operations, Data Warehouse
Architecture, Data Warehouse Implementation. [8Hours]
Department of Computer Science and Engineering Page 23
Program Structure & Detailed Syllabus (VR22)
UNIT-III
Classification: Basic Concepts, General Approach to solving a classification problem,
Decision Tree Induction: Working of Decision Tree, Building a decision tree, Methods for
expressing an attribute test conditions, Measures for selecting the best split, Algorithm for
decision tree induction Model Over fitting: Due to presence of noise, Due to lack of
Representation samples, Evaluating the performance of classifier: hold out method, random
sub sampling, and cross-validation, bootstrap.
[12Hours]
UNIT-IV
Association Analysis: Basic Concepts, Frequent Item set Mining Methods – Apriority
Algorithm, Frequent-Pattern Growth Approach, and Generating Association Rules from
Frequent Item sets. Mining various kinds of Association rules.
[10Hours]
UNIT-V
Cluster Analysis: What Is Cluster Analysis? Different Types of Clustering’s, Different
Types of Clusters, K-means: The Basic K-means Algorithm, K-means additional Issues,
Bisecting K-means, K-means and Different Types of Clusters, Strengths and Weaknesses.
Hierarchical Clustering: Agglomerative and Divisive Hierarchical Clustering
algorithms, Strengths and Weaknesses of Hierarchical Clustering. DB SCAN:
Traditional Density Center-Based Approach, DBSCAN Algorithm, Strengths and
Weaknesses. [12Hours]
Textbooks:
Data Mining concepts and Techniques, 3/e, JiaweiHan,Michel Kamber, Elsevier.
Introduction to Data Mining: Pang-Ning Tan&MichaelSteinbach, VipinKumar, Pearson.
Reference Books:
Data Mining Techniques and Applications: An Introduction, HongboDuCengage Learning.
Data Mining :Introductory and Advanced topics:Dunham, Pearson.
Data Ware housing Data Mining&OLAP,Alex Berson,StephenSmith,
TMH.
E-Books:
https://www.academia.edu/6489220/Data_Mining_ebook
http://myweb.sabanciuniv.edu/rdehkharghani/files/2016/02/The-Kaufmann-
Series-in-Data-Management-Systems-Jewie-Han-Michelin-Camber- Jian-Pei
Data- Mining.-Concepts-and-Techniques-3rd-Edition-Morgan-Kaufmann-2011.pdf
Department of Computer Science and Engineering Page 24
