Scribd
Upload
69 views1 page

Gujarat Technological University

The document discusses topics related to data warehousing and mining including OLAP operations, data smoothing, the KDD process, issues in data mining, outlier detection methods, regression techniques, distance measures, concept hierarchies, data warehouse schemas, supervised and unsupervised learning, data reduction, five number summaries, data marts, principal component analysis, data transformation approaches, sampling techniques, Bayes' theorem, data cleaning methods, noise removal techniques, information gain, gain ratio, web mining, decision tree induction, market basket analysis, text mining, and the Apriori algorithm.

Uploaded by

Vaishnavi Pansaniya
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
69 views1 page

Gujarat Technological University

The document discusses topics related to data warehousing and mining including OLAP operations, data smoothing, the KDD process, issues in data mining, outlier detection methods, regression techniques, distance measures, concept hierarchies, data warehouse schemas, supervised and unsupervised learning, data reduction, five number summaries, data marts, principal component analysis, data transformation approaches, sampling techniques, Bayes' theorem, data cleaning methods, noise removal techniques, information gain, gain ratio, web mining, decision tree induction, market basket analysis, text mining, and the Apriori algorithm.

Uploaded by

Vaishnavi Pansaniya
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/ 1

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER–VI (NEW) EXAMINATION – WINTER 2023
Subject Code:3161610 Date:13-12-2023
Subject Name: Data Warehousing and Mining
Time:02:30 PM TO 05:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) Explain any three OLAP operations with suitable example. 03
(b) Discuss Data Smoothing by Binning using suitable example. 04
Explain
(c) What is KDD process. Why is it called Data Mining rather Knowledge
Data Mining? 07
Mining? Explain KDD process.

Q.2 (a) Explain the major issues in Data Mining. 03


(b) Compare OLAP and OLTP systems. 04
(c) What is an ‘Outlier’? How do Outliers impact the results of Mining? Explain 07
any one method to detect Outliers.
OR
(c) Explain Linear and Non-linear Regression. 07
Q.3 (a) Define Euclidean Distance, Manhattan Distance & Minkowski Distance. 03
(b) List and explain types of Concept Hierarchy. 04
(c) List out the different schema of Data Warehouse and explain one of the Data 07
Warehouse schemas in detail with suitable diagram.
OR
Q.3 (a) Define Supervised Learning, Unsupervised Learning & Data Reduction. 03
(b) Explain Five Number Summary with suitable database example. 04
(c) What do you mean by Data Mart? What are the different types of Data Mart? 07
Q.4 (a) Explain about role of Principal Component of Analysis (PCA). 03
(b) What is Data Transformation? Explain the different Data Transformation 04
approaches for Transforming Data.
(c) Define Sampling. Explain different type of Sampling Techniques with suitable 07
example.
OR
Q.4 (a) Define Bayes’ Theorem. 03
(b) What is Data Cleaning? Describe the different methods of handling missing 04
values during Data Cleaning.
(c) Define Noise. Explain the different techniques to remove the Noise from Data. 07
Q.5 (a) Explain Information Gain and Gain Ratio. 03
(b) Write a short note on Web Mining. 04
(c) What is Decision Tree Induction? Write Basic Algorithm for inducing a 07
Decision Tree from training tuples.
OR
Q.5 (a) Explain Market Basket Analysis. 03
(b) Write a short note on Text Mining. 04
(c) Explain the steps of the Apriori algorithm for mining frequent item sets with 07
candidate generation.

************

You might also like