0% found this document useful (0 votes)
6 views1 page

Data Warehousing Assignment 2024-2025

This document outlines an assignment for the Data Warehousing and Data Mining course at SAGI Rama Krishnam Raju Engineering College for the academic year 2024-2025. It includes tasks such as explaining three-tier data warehouse architecture, calculating similarity measures for given vectors, and analyzing the Gini index and misclassification error rate for a parent node in a decision tree context. The assignment is structured to assess knowledge and application of data mining concepts.
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
0% found this document useful (0 votes)
6 views1 page

Data Warehousing Assignment 2024-2025

This document outlines an assignment for the Data Warehousing and Data Mining course at SAGI Rama Krishnam Raju Engineering College for the academic year 2024-2025. It includes tasks such as explaining three-tier data warehouse architecture, calculating similarity measures for given vectors, and analyzing the Gini index and misclassification error rate for a parent node in a decision tree context. The assignment is structured to assess knowledge and application of data mining concepts.
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

SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (AUTONOMOUS)

SRKR MARG, CHINNA AMIRAM, BHIMAVARAM-534204, [Link]., A.P., INDIA.

Class: III B. Tech I Semester AY: 2024-2025


Program: AIDS Max. Marks: 5
Course Name: Data Warehousing and Data Mining Course Code: B20AD3202

Assignment-1
CO KL
1. With a neat sketch explain three tire Data warehouse architecture. 1 2
2. For the following vectors, x and y, calculate the indicated similarity or 2 3
distance measures.
(a) x = (1, 1, 1, 1), y = (2, 2, 2, 2) cosine, correlation, Euclidean
(b) x = (0, 1, 0, 1), y = (1, 0, 1, 0) cosine, correlation, Euclidean, Jaccard
(c) x = (0,−1, 0, 1), y = (1, 0,−1, 0) cosine, correlation, Euclidean
(d) x = (1, 1, 0, 1, 0, 1), y = (1, 1, 1, 0, 0, 1) cosine, correlation, Jaccard
(e) x = (2,−1, 0, 2, 0,−3), y = (−1, 1,−1, 0, 0,−1) cosine, correlation

3. Consider splitting a parent node P into two child nodes, C1 and C2, using 3 3
some attribute test condition. The composition of labeled training instances at
every node is summarized in the Table below.

(a) Calculate the Gini index and misclassification error rate of the parent
node P.
(b) Calculate the weighted Gini index of the child nodes. Would you
consider this attribute test condition if Gini is used as the impurity
measure?
(c) Calculate the weighted misclassification rate of the child nodes. Would
you consider this attribute test condition if misclassification rate is used as
the impurity measure?

***********

You might also like