Scribd
Upload
32 views2 pages

DMBI Index

A

Uploaded by

jenishbarvaliya.it22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

DMBI Index

A

Uploaded by

jenishbarvaliya.it22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Sarvajanik College Of Engineering And

Technology
Information Technology Department
B.Tech. III IT / AIDS – Sem V

INDEX
Data Mining and Business Intelligence (BTIT13501)

Name: ENROLLMENT NO:

Sr. Date Practical Page Signature


No No

1 Study the following data mining applications and


make a detailed note on them:
(i) Mining Time-Series Data
(ii) Social Network Mining
(iii) Recommendation Systems in Retail
(iv) Web Mining
(v) Text Mining

2 Suppose that a data warehouse for Big University


consists of the following four dimensions: ‘student’,
‘course’, ‘semester’, and ‘instructor’. Further,
assume there are two measures ‘count’ and
‘avg_grade’. The measure ‘count’ refers to number
of students. 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 niversity

1
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 apexcuboids)?

3 Implement routines to normalize the data in the


sample data file using:
a) Min-Max normalization
(i) Map to range [0,1]
(ii) Map to range [-1,1]
b) z-score normalization
c) decimal scaled normalization

4 Implement Binning methods for data smoothing for


the following dataset using 3 equi-depth bins.
Demonstrate
(a) smoothing by bin means, (b) smoothing by bin
medians (c) bin boundaries.

5 Generate a linear regression based model and


demonstrate its working on the given dataset.

6 Study and implement the Apriori algorithm over the


given dataset. (Use WEKA toolkit)

7 Study and implement the FP-Growth algorithm over


the given dataset. (Use WEKA toolkit)

8 Study and implement the k-means clustering


algorithm over the given dataset.

9 Study and implement the k-medoid (PAM) clustering


algorithm over the given dataset.

10 Study and implement Hierarchical clustering over


the given dataset (Eg. Iris dataset). Depict the visual
output of the clustering.

You might also like