Scribd
Upload
91 views

Gujarat Technological University

This document contains a exam for a data mining course. The exam contains 5 questions testing various concepts in data mining. Question 1 tests the importance of data mining, the difference between OLTP and data warehouses, and the steps of the KDD process. Question 2 tests data reduction techniques, correlation analysis, and data pre-processing tasks. Question 3 tests the difference between classification and prediction, normalization techniques, and the Apriori algorithm. Question 4 tests the difference between supervised and unsupervised learning, logistic regression, and decision trees. Question 5 tests clustering algorithms like k-means and k-medoids and their strengths and weaknesses.

Uploaded by

feyayel990
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
91 views

Gujarat Technological University

This document contains a exam for a data mining course. The exam contains 5 questions testing various concepts in data mining. Question 1 tests the importance of data mining, the difference between OLTP and data warehouses, and the steps of the KDD process. Question 2 tests data reduction techniques, correlation analysis, and data pre-processing tasks. Question 3 tests the difference between classification and prediction, normalization techniques, and the Apriori algorithm. Question 4 tests the difference between supervised and unsupervised learning, logistic regression, and decision trees. Question 5 tests clustering algorithms like k-means and k-medoids and their strengths and weaknesses.

Uploaded by

feyayel990
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

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER– VI (NEW) EXAMINATION – WINTER 2021
Subject Code:3160714 Date:02/12/2021
Subject Name:Data Mining
Time:10:30 AM TO 01: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.
MARKS
Q.1 (a) Justify the importance of data mining. 03
(b) Differentiate OLTP and data warehouse. 04
(c) Briefly discussed steps of KDD process. 07

Q.2 (a) Explain data reduction and dimensionality reduction? 03


(b) What do you mean by correlation analysis? Justify its importance. 04
(c) List common task involved in the data pre-processing. Explain briefly 07
any four tasks of data pre-processing with suitable example.
OR
(c) Define the following: 07
concept description, support, confidence, strong association rules, data
generalization, and unsupervised learning.
Q.3 (a) How the classification is differs from the prediction? Explain phases of 03
classification.
(b) Attribute income have minimum value of 12000 INR and maximum 04
value of 98000 INR. Normalize income value of 73600 INR,
(i) Using min-max normalization in the range of [0,1]
(ii) Using z-score normalization. Take mean value of income as 54000
and standard deviation is 16000.

(c) Using Apriori algorithm, find all frequent itemsets for following 07
transaction data.
( Take min_sup=60% and min_conf=80% )

ID Items
1 {M,O,N,K,E,Y}
2 {D,O,N,K,E,Y
3 {M,A,K,E}
4 {M,U,C,K,Y}
5 {C,O,O,K,I,E}
OR
Q.3 (a) What is the use of proximity measures? Explain any one proximity 03
measures with equation.
(b) Explain Bayesian learning and inference with suitable example. 04
(c) List the accuracy parameters used for the performance evaluation of 07
classification and discuss any five parameters with appropriate
example.
Q.4 (a) Differentiate supervised and unsupervised learning. 03
(b) Explain logistic regression with appropriate example. 04

1
(c) Explain working of decision tree algorithm with suitable example. 07

OR
Q.4 (a) Differentiate agglomerative and divisive methods of clustering. 03

(b) What do you mean by perceptron? Discuss single-layer and multi layer 04
perceptron.
(c) Explain K-means clustering algorithm and prove that outlier adversely 07
affect the performance of algorithm.
Q.5 (a) Give strength and weakness of k-means in comparison of k-medoids 03
algorithm.
(b) What is outlier? Why outlier mining is important? 04
(c) Write about different clustering approaches with their strength and 07
weakness.
OR
Q.5 (a) Briefly explain the spatial data mining and temporal mining. 03

(b) Discuss any four data mining features available in the WEKA. 04

(c) How data mining is useful for web mining. Discuss any four web 07
mining applications.

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

You might also like