Browse papers
A

Section A: Long Answer Questions

Attempt any TWO questions.

3 questions·10 marks each
1long10 marks

What are the advantages and disadvantages of MOLAP over ROLAP? Explain the multidimensional data model with the help of a data cube.

olapdata-model
2long10 marks

Explain the Apriori algorithm in detail. Discuss the limitations of the Apriori algorithm and how the FP-growth algorithm overcomes them.

association-rulesapriorifp-growth
3long10 marks

Build a decision tree from a given dataset using ID3 with information gain as the attribute selection measure. Show all calculations.

classificationdecision-treeid3
B

Section B: Short Answer Questions

Attempt any EIGHT questions.

9 questions·5 marks each
4short5 marks

What is beam search? Explain.

search
5short5 marks

Explain signed networks in the context of data mining.

networks
6short5 marks

What is a concept hierarchy? How is it generated?

concept-hierarchy
7short5 marks

Compare different classifiers (decision tree vs. Naive Bayes).

classification
8short5 marks

Explain the DBSCAN clustering algorithm.

clusteringdbscan
9short5 marks

What is data integration? Explain the issues involved.

preprocessing
10short5 marks

Define lift and conviction in association rules.

association-rules
11short5 marks

Explain data reduction techniques.

preprocessing
12short5 marks

Write short notes on text mining.

text-mining