Data Mining Syllabus and Question
Data Mining Syllabus and Question
Credit hours: 3
Lecture
Course content-breakdown
Introduction
Hours
5
Remarks
OLTP
Association analysis
Apriori Algorithm
Bayesian Classification
Laboratory:
1. Creating a simple data warehouse
2. Concepts of data cleaning and preparing for operation
3. Implementing classification and clustering algorithms in any programming language
4. Association rule mining though data mining tools
5. Data Classification through data mining tools
6. Clustering through data mining tools
7. Data visualization through data mining tools
Text Books:
1. Data Mining Concepts and Techniques, Morgan Kaufmann J. Han, M Kamber Second Edition
ISBN: 978-1-55860-901-3
2. Data Warehousing in the Real World Sam Anahory and Dennis Murray, Pearson Edition
Asia.
References:
1. Data Mining Techniques Arun K Pujari, University Press.
2. Data Mining- Pieter Adriaans, Dolf Zantinge
3. Data Mining, Alex Berson,Stephen Smith,Korth Theorling,TMH.
4. Data Mining, Adriaans, Addison-Wesley Longman.
Model Question
Full marks:
60
Pass marks: 24
Time: 3 hours.
Bachelor Level/ Fourth Year/Eight Semester/Science
Data Warehousing and Data Mining (CSC-451)
Candidates are required to give their answers in their own words as far as practicable. The
figures in the margin indicate full marks.
Group-A
Long Answer Questions (Attempt any Two questions)
[2x10=20]
1. Suppose that a data warehouse for Big University consists of the following four
dimensions: student, course, semester, and instructor, and two measures count and avggrade. When at the lowest conceptual level (e.g., for a given student, course, semester, and
instructor combination), the avg-grade measure stores the actual course grade of the
student. At higher conceptual levels, avg-grade stores the average grade for the given
combination.
a) Draw a snowflake schema diagram for the data warehouse.
b) Starting with the base cuboid [student, course, semester, instructor], what specific
OLAP operations (e.g., roll-up from semester to year) should one perform in order to
list the average grade of CS courses for each Big University Student.
c) If each dimension has five levels (including all), such as student < major < status <
university < all, how many cuboids will this cube contain (including the base and apex
cuboids)?
2. A= {A1, A2, A3, A4, A5, A6}, Assume = 35%. Use A priori algorithm to get the desired
solution.
A1
0
0
1
1
1
0
0
A2
0
1
0
1
0
1
0
A3
0
1
0
0
1
1
0
A4
1
1
1
1
0
1
1
A5
1
0
1
0
1
0
1
A6
1
0
1
0
1
1
0
0
1
1
1
0
1
0
0
1
1
1
1
0
0
1
1
0
1
3. What kind of data preprocessing do we need before applying data mining algorithm to any
data set. Explain binning method to handle noisy data with example.
Group- B
Short Answer Questions (Attempt any Eight questions)
Question number 13 is compulsory.
[8x5=40]
[5]
[5]
[5]
7. List the drawbacks of ID3 algorithm with over-fitting and its remedy techniques
[5]
8. Write the algorithm for K-means clustering. Compare it with k-nearest neighbor
algorithm.
[5]
[5]
10. Describe genetic algorithm using as problem solving technique in data mining.
[5]
11. What do you mean by WWW mining? Explain WWW mining techniques.
[5]
12. What is DMQL? How do you define Star Schema using DMQL?
[5]
[2x2.5=5]
*****