JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA II DATA MINING Previous Question Paper (March - 2023 - R20)
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
Explain various data smoothing techniques.
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.
What are maximal and closed frequent itemsets?
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.
What is deicison tree? Explain with example.
Answer
Sign in to view the complete answer paper.
Elaborate on outlier detection.
Answer
Sign in to view the complete answer paper.
Explain about web mining in brief.
Answer
Sign in to view the complete answer paper.
Part B
Explain various methods for dimensionality reduction.
Answer
Sign in to view the complete answer paper.
Elaborate on discretization and binarization.
Answer
Sign in to view the complete answer paper.
Explain apriori algorithm with an example.
Answer
Sign in to view the complete answer paper.
What are the compact representations of frequent item set? Explain with example.
Answer
Sign in to view the complete answer paper.
What are various measures for selecting the best split? Explain them.
Answer
Sign in to view the complete answer paper.
Explain Bayesian belief networks.
Answer
Sign in to view the complete answer paper.
Explain PAM algorithm in detail.
Answer
Sign in to view the complete answer paper.
What are disadvantages of k-means algorithm? How can they be overcome?
Answer
Sign in to view the complete answer paper.
How to detect outliers? Explain with an example.
Answer
Sign in to view the complete answer paper.
Explain web usage mining.
Answer
Sign in to view the complete answer paper.
Explain text mining in detail.
Answer
Sign in to view the complete answer paper.