JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA II DATA MINING Previous Question Paper (March - 2023 - R20)

MCA | II | II | R20 | March - 2023

Answer PaperPaper Code: 872ADMaximum Marks: 75Time: 3 Hours

Note: i) Question paper consists of Part A, Part B. ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.

Part A

125 marks
a

Explain various data smoothing techniques.

5 marks

Answer

Data smoothing is a technique used to remove noise from data to highlight important patterns. Common methods include:

  • Binning: Data is sorted and partitioned into equal-width or equal-depth bins. Smoothing is then performed by replacing values with the bin mean, median, or boundaries.
  • Regression: Data is fitted to a function (e.g., linear or multiple regression) to estimate the relationship between variables, effectively filtering out random noise.
  • Clustering: Data points are grouped into clusters, and outliers are identified and removed or replaced based on their distance from cluster centroids.
b

What are maximal and closed frequent itemsets?

5 marks

Answer

A closed frequent itemset is an itemset where none of its immediate supersets have the same support count as the itemset itself. It provides a compressed representation of frequent itemsets without losing information.

A maximal frequent itemset is an itemset where none of its immediate supersets are frequent. This is a more aggressive compression technique; while it identifies the boundaries of frequent patterns, it does not retain the support counts of the subsets.

c

What is deicison tree? Explain with example.

5 marks

Answer

Sign in to view the complete answer paper.

d

Elaborate on outlier detection.

5 marks

Answer

Sign in to view the complete answer paper.

e

Explain about web mining in brief.

5 marks

Answer

Sign in to view the complete answer paper.

Part B

2

Explain various methods for dimensionality reduction.

10 marks

Answer

Sign in to view the complete answer paper.

OR
3

Elaborate on discretization and binarization.

10 marks

Answer

Sign in to view the complete answer paper.

4

Explain apriori algorithm with an example.

10 marks

Answer

Sign in to view the complete answer paper.

OR
5

What are the compact representations of frequent item set? Explain with example.

10 marks

Answer

Sign in to view the complete answer paper.

6

What are various measures for selecting the best split? Explain them.

10 marks

Answer

Sign in to view the complete answer paper.

OR
7

Explain Bayesian belief networks.

10 marks

Answer

Sign in to view the complete answer paper.

8

Explain PAM algorithm in detail.

10 marks

Answer

Sign in to view the complete answer paper.

OR
910 marks
a

What are disadvantages of k-means algorithm? How can they be overcome?

5 marks

Answer

Sign in to view the complete answer paper.

b

How to detect outliers? Explain with an example.

5 marks

Answer

Sign in to view the complete answer paper.

10

Explain web usage mining.

10 marks

Answer

Sign in to view the complete answer paper.

OR
11

Explain text mining in detail.

10 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of DATA MINING from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for MCA II II, March - 2023, R20.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in DATA MINING

Loading Question Papers

Fetching data from database...