KALINGA INSTITUTE OF INDUSTRIAL TECHNOLOGY

(DEEMED TO BE UNIVERSITY)
SCHOOL OF COMPUTER ENGINEERING
BACHELOR OF TECHNOLOGY IN COMPUTER SCIENCE & ENGINEERING

Sub.Code : IT 3031 (L-T-P: 3-0-0) Year / Sem : III / V

Sub.Name : DATA MINING AND DATA WAREHOUSING Batch : 2021-2025
Course Dr. Amiya Ranjan Panda Academic : 2023-2024
Coordinator Year
Faculty : Dr. Hrudaya Kumar Tripathy, Dr. Ajay Kumar
Name Jena, Dr. Himansu Das, Dr. Satarupa
Mohanty, Dr. Murari Mandal, Ms. Mandakini
Priyadarshani Behera, Dr. Amiya Ranjan
Panda

Course Objectives: The objective of the course is to learn, understand, and practice of Data Mining
and Data Warehousing

Course Outcomes: The students learning outcomes are designed to specify what the students will be
able to perform after completion of the course:

CO1: Understand the basic principles, concepts & applications of data mining and familiar
with mathematical foundations of data mining tools.
CO2: Understand the fundamental concepts, benefits, problem areas associated with data
warehousing along with various architectures and main components of a data warehousing.
CO3: Characterize the kinds of patterns that can be discovered by association rule
mining algorithms. CO4: Understand various classification and prediction algorithms to
solve the real problems.
CO5: Understand various clustering algorithms to solve the real problems.
CO6: Develop ability to design various algorithms based on data mining tools to solve web,
spatial, Temporal, text and multimedia data.

TEXT BOOK:

1. J. Han and M. Kamber, “Data Mining: Concepts and Techniques”, 4th Edition, Morgan
Kaufman,2015.

REFERENCE:
1. H. Dunham. Data Mining: Introductory and Advanced Topics. Pearson Education. 2006.
2. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan
Kaufmann. 2000.
3. D. Hand, H. Mannila and P. Smyth. Principles of Data Mining.Prentice-Hall. 2001.

LESSON PLAN

BOOKS NO. OF TEACHING

UNI TOPI
FOR HOURS METHODOLO
T C
REFERENC REQUIRE GY
E D
UNIT I: INTRODUCTION TO DATA MINING (5 Hrs.)
Introduction to Data Mining
What Is Data Mining?
A Multi-Dimensional View of Data Online,
1.1 Mining 1 PPT,
What Kind of Data Can Be Mined? Text Book Handouts
What Kinds of Patterns Can Be
Mined?
What Technology Are Used?
What Kind of Applications Are
Targeted?
A Brief History of Data Mining and
Data
Mining Society
Major Issues in Data Mining Online,
1.2 − Mining Methodology Text Book 1
− User Interaction
PPT,
Handouts

− Effificiency and Scalability

− Diversity of Database Types
− Data Mining and Society
Data Mining Metrics
Getting to Know Your Data
− Data Objects and Attribute Types
1.3 (About Attribute, Nominal Attributes, 1 Online,
Binary Attributes,Ordinal Attributes, Text Book PPT,
Numeric Attributes, Discrete versus Handouts
Continuous Attributes)
Data Mining from a
Database Perspective
Basic Statistical Descriptions of
Data Online,
1.4 Measuring the Central Tendency: Text Book 1 PPT,
Mean, Median, and Mode Handouts
Measuring the Dispersion of
Data: Range, Quartiles, Variance,
Standard
Deviation, and Interquartile Range
A Statistical Perspective on Data
1.5 Mining. 1 Online,
 − Graphic Displays of Basic PPT,
Statistical Descriptions of Data Handouts

UNIT II: DATA WAREHOUSING AND

PREPROCESSING (8 Hrs.)
Data Warehousing, Data
Warehousing Architecture
What Is a Data Warehouse? Online,
2.1 Differences between Text Book 1 PPT,
Operational Database Handouts
Systems
and Data Warehouses
Data Warehousing: A Multitiered
Architecture
Data Warehouse Models:
2.2 Enterprise Warehouse, Data Text Book 1 Online,
Mart, and Vir tual Warehouse PPT,
Extraction, Transformation, and Handouts
Loading
OLTP, OLAP
Data Cube: A Multidimensional Online,
2.3 Data Model Text Book 1 PPT,
Stars, Snowflflakes, and Handouts
Fact Constellations:
Schemas
for Multidimensional Data Models
Typical OLAP Operations Online,
2.4 From Online Analytical Processing to Text Book 1
PPT,
Multidimensional Data Mining
Handouts
Preprocessing Techniques A
Statistical Perspective on Data
2.5 Mining 1 Online,
Data Preprocessing (Data Quality: Text Book PPT,
Why Preprocess the Data?, Major Handouts
Tasks in Data Preprocessing)
Data Cleaning (Missing Values, Noisy
Data)
− Data Integration (Entity
2.6 Identifification Problem, Text Book 1 Online,
Redundancy and Correlation PPT,
Analysis, Tuple Duplication, Data Handouts
Value
Conflflict Detection and Resolution)

2.7 Similarity Measures Text Book 1 Online,

PPT,
Handouts
Data Sampling
Online,
2.8 Probability Sampling Text Book 1 PPT,
Non-Probability Sampling
Handouts
 UNIT III: ASSOCIATION RULES (5 Hrs.)
Basic Algorithms for Association
3.1 Rule 1 Online,
Text Book
Market Basket Analysis PPT,
Frequent Itemsets, and Closed Itemsets Handouts
Association Rules
Incremental Association Rules
3.2 − Apriori Algorithm: Finding Text Book 1 Online,
Frequent Itemsets by PPT,
Confifined Candidate Handouts
Generation
− Generating Association Rules Online,
3.3 from Frequent Itemsets
Text Book 1
PPT,
Handouts
Measuring the Quality of Rules
3.4 Which Patterns Are Interesting?— Text Book 1 Online,
Pattern Evaluation Methods PPT,
Improving the Effificiency of Apriori Handouts
Advanced Association Rule Online,
3.5 − Associations and Correlation methods
Text Book 1
PPT,
Handouts
UNIT IV: CLASSIFICATION (9 Hrs)
Issues regarding Classification and
Online,
4.1 Prediction 8.1.1, 8.1.2 1
PPT,
− Other classification methods
Handouts
Statistical-Based Algorithms Fundamenta
− Regression l Ideas with
4.2 some 1 Online,
examples on PPT,
Regression Handouts
models.
− Bayesian Classification Online, PPT,
4.3 8.3.1, 8.3.2 1
Handouts
Distance-Based Online,
4.4 9.5.1 1
Algorithms PPT,
− K Nearest Neighbour (KNN) Handouts
Decision Tree-Based Algorithms
Online,
4.5 Decision Tree 8.2.1 1 PPT,
Issues Faced by DT Algorithms
Handouts
− ID3 Algorithm 8.2.2
4.6 − Entropy, Pruning (Only 1 Online,
Entropy PPT,
and Handouts
informatio
n
 Gain), 8.2.3
Neural Network Online,
4.7 NN Propagation and Error 9.2.1 1
PPT,
Supervised Learning in NN
Handouts
− Perceptrons Online,
4.8 − MLP (Multilayer Perceptron) 9.2.2, 9.2.3 1
PPT,
Handouts
Advanced Classification methods 9.6.1, 9.6.2, Online,
4.9 (Genetic, Rough Set, Fuzzy Set) 9.6.3 1
PPT,
(Only
Handouts
approach
)
UNIT V: CLUSTERING (5 Hrs)
Hierarchical Algorithms
5.1 Agglomerative Hierarchical 10.3, 10.3.1 1 Online,
clustering algorithm (AGNES) PPT,
Dendogram Handouts
− Divisive Hierarchical clustering Online,
5.2 algorithm (DIANA) Example 1
10.3 PPT,
Handouts
Partitional Algorithms 10.1.1, Online,
5.3 1
− k-means 10.1.2,, PPT,
10.2.1 Handouts

Clustering Large Databases Online,

5.4 10.4.1 1
PPT,
Handouts
5.5 Clustering with Categorical 1 Online,
Attributes PPT,
Handouts
UNIT VI: ADVANCED TECHNIQUES (4 Hrs)
Web Mining From
reference/we Online,
6.1 b 1 PPT,
contents/rese Handouts
a
rch articles,
etc.
Spatial Mining From
reference/we Online,
6.2 b 1 PPT,
contents/rese Handouts
a
rch articles,
etc.
 Temporal Mining, Text Mining From
reference/we Online,
6.3 b 1 PPT,
contents/rese Handouts
a
rch articles,
etc.
Multimedia Mining From
reference/we Online,
6.4 b 1 PPT,
contents/rese Handouts
a
rch articles,
etc.

DMDW Activity Chart

1. Activity based Teaching and Learning:

Considering the guidelines circulated and after discussing with the faculty members, following
component wise description of each activity list is proposed:
Activity List
Component wise distributions of the activities are listed
below. i). Problem Solving : 15 Marks
ii). Quiz () : 10 Marks
iii). Critical Thinking :
05 Marks
i). Problem solving (15 marks): Activity/Assignment

Assignments have to be solved in a group/individual and mentioned below for reference only.
Faculties are free to give their own assignments and evaluation is to be done by respective assigned
subject teacher. Subject teacher have to decide the number of groups and students for each group.
Students are expected to write the solution in the writing pad and submit the soft copy to the subject
teacher.
Assignment-1 (Introduction)
Assignment-2 (Data Warehousing and
Preprocessing) Assignment-3 (Association
Rules)
Assignment-4 (Classification)

Assignment-5 (Clustering)
Assignment-6 (Advanced
Techniques)
 ii). Quiz (10 marks):
Minimum of two quizzes with easy, moderate and difficulty level will be conducted one before the
mid sem and another after mid-semester examination. Faculties are free to give their own questions
in the quiz. Evaluation is to be done by the respective assigned subject teacher.
iii). Critical thinking (05 marks):
The critical thinking process is related to demonstrating the individual student’s capability for
grasping the subject. Evaluation is to be done by the respective assigned subject teacher.

2. Unit wise Activity List:

Protocol:

Students have to participate and submit the activities in time to the concerned subject teacher
as stipulated.
Students have to appear all in-class activities in physical mode.
Students have to appear on at least 2 quizzes in Moodle (online) preferably.

Unit Unit Focus Area CO Mapping

No.
1 Introduction to Problem Solving CO1
Data Mining
Quiz
2 Problem Solving CO2
Data Warehousing
and Preprocessing
Critical
Thinking
Quiz
3 Problem Solving CO3
Association Rules
Critical
Thinking
Quiz
4 Problem Solving CO4
Classification
Critical
Thinking
Quiz
5 Problem Solving CO5
Clustering
 Critical
Thinking
Quiz
6 Advanced Problem Solving CO6
Techniques
Critical
Thinking

3. Course Materials: Course Material will be provided for all topics which can be used as
reference. The material consists of –

Lecture Notes/ppts

Class Work

Home Work

Supplementary Reading

Dr. Amiya Ranjan Panda

Course Faculty