Scribd
Upload
62 views2 pages

Estelar: Faculty of Engineering

This document contains questions from a Data Mining exam for a Faculty of Engineering. It covers topics like data warehousing, classification vs clustering, binning, concept hierarchies, iceberg queries, neural networks, support and confidence, Bayes' theorem, and handling missing values. It also asks about attribute relevance analysis, analytical characterization, the difference between DLAP and OLTP, the Apriori algorithm, decision trees, estimating classifier accuracy, distance-based outliers, OPTICS clustering, FP-trees, and data mining functionalities and issues.

Uploaded by

Anjali Reddy
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
62 views2 pages

Estelar: Faculty of Engineering

This document contains questions from a Data Mining exam for a Faculty of Engineering. It covers topics like data warehousing, classification vs clustering, binning, concept hierarchies, iceberg queries, neural networks, support and confidence, Bayes' theorem, and handling missing values. It also asks about attribute relevance analysis, analytical characterization, the difference between DLAP and OLTP, the Apriori algorithm, decision trees, estimating classifier accuracy, distance-based outliers, OPTICS clustering, FP-trees, and data mining functionalities and issues.

Uploaded by

Anjali Reddy
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

FACULTY OF ENGINEERING

Code No. 6298 / O

B.E. 4/4 (CSE) II Semester (Old) Examination, April / May 2014


Time: 3 Hours

Subject: Data Mining

Max.Marks: 75

Note: Answer all questions from Part A. Answer any five questions from Part B.
PART A (25 Marks)
Define Data Warehouse.
Differentiate between classification and clustering.
What is binning? Smooth the following data using by bin means and by bin
boundaries 4, 8, 15, 21, 24, 25, 28, 34.
4 What is concept hierarchy? Give few examples.
5 Define iceberg query.
6 Define multilayer feed forward neural network.
7 Define support and confidence.
8 Define Bayes theorem.
9 What is the role of meta data repository in a data warehouse?
10 How do you handle missing values?

la

1
2
3

2
2
3
3
2
3
2
3
2
3

te

PART B (50 Marks)

5
5

12 (a) Explain about analysis of attribute relevance.


(b) How is the analytical characterization performed? Explain with an example.

5
5

Es

11 (a) Explain data mining as a step in the process of knowledge discovery.


(b) Differentiate DLAP and OLTP.

13 Write and explain Apriori algorithm to find all frequent item sets and strong association
rules for the following database, where min_sup = 60% and min_conf = 80%
10
Tid
T100
T200
T300
T400

Items
{K, A, D, B}
{D, A, C, E, B}
{C, A, B, E}
{B, A, D}

14 Explain classification problem using decision trees.

10

15 Explain how classifier accuracy can be estimated. Discuss the general techniques
for improving classifier accuracy.

10

16 (a) Discuss distance based outlier detection.


(b) Explain OPTICS algorithm for clustering.

5
5

17 Explain the following:


a)
The knowledge to be mined
b)
The construction of FP-tree with example.

5
5

****

FACULTY OF ENGINEERING

Code No. 6561 / N

B.E. 4/4 (CSE) II Semester (New) (Main) Examination, April / May 2014
Time: 3 Hours

Subject: Data Mining

Max.Marks: 75

la

Note: Answer all questions from Part A. Answer any five questions from Part B.
PART A (25 Marks)
1 What is data mining?
2 Define pre-processing. Why do we need pre-processing?
3 What is Apriori property?
4 Define clustering with an example.
5 Why do we require pruning in decision tree?
6 What is linear-regression?
7 Explain Bayes theorem.
8 Define:
a) Agglomerative hierarchical clustering
b) Divisive hierarchical clustering
9 How K - means algorithm differ from K - mediods?
10 What is meant by data reduction?

2
3
3
2
3
2
3
3
2
2

PART B (50 Marks)

5
5

12 (a) Explain the architecture of data warehouse.


(b) Differentiate OLAP and OLTP.

5
5

te

11 (a) Explain various data mining functionalities.


(b) Discuss various issues in data mining.

10

14 Explain the nave Bayes classification and give an example.

10

15 Describe the working of the DBSCAN algorithm, and also explain the concept of a
cluster as used in DBSCAN.

10

16 Explain various grid based methods for clustering.

10

17 Write short notes on any two of the following:


a) Text mining
b) Web mining
c) Mining multimedia databases.

10

Es

13 Explain Apriori algorithm with a suitable example.

****

You might also like