Scribd
Upload
41 views2 pages

DMW Simp-Tie

This document contains questions for Modules 1-5 of the SIMP exam preparation. Module 1 questions cover data mining processes, data warehousing concepts like schemas and architectures. Module 2 focuses on indexing techniques and data preprocessing challenges. Module 3 examines association rule mining algorithms like Apriori. Module 4 discusses classification algorithms such as Naive Bayes, decision trees, and rule-based methods. Module 5 poses questions about clustering, including types of clusters, evaluation techniques, and algorithms like K-means and DBSCAN.

Uploaded by

Rohan H C
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
41 views2 pages

DMW Simp-Tie

This document contains questions for Modules 1-5 of the SIMP exam preparation. Module 1 questions cover data mining processes, data warehousing concepts like schemas and architectures. Module 2 focuses on indexing techniques and data preprocessing challenges. Module 3 examines association rule mining algorithms like Apriori. Module 4 discusses classification algorithms such as Naive Bayes, decision trees, and rule-based methods. Module 5 poses questions about clustering, including types of clusters, evaluation techniques, and algorithms like K-means and DBSCAN.

Uploaded by

Rohan H C
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

DMW-IMP and SIMP Questions-2023

Prepared by: By the TIE review team

Module-1-5 SIMP questions

Module-1

1. Explain KDD process in Data Mining in detail.


2. What is a data warehouse? List all its key features with an example for each.
3. What are the different schemas used for Multi-dimensional data model? Explain
with suitable diagrams.
4. Write a note on : i) Data Warehouse models ii) Data Warehouse
Architecture/Multi Tier Architecture iii) Role of concept hierarchies & measures iv)
Curse of Dimensionality
5. Differentiate between: i) Operational Database & Data Warehouse ii)OLTP &
OLAP
6. Explain the OLAP operations with examples.

Module-2

1. Explain OLAP Data indexing for Bitmap Index and Join Index.
2. Explain the different techniques associated with data pre-processing. What are the challenges
faced in Data Mining?
3. Differentiate between ROLAP, MOLAP & HOLAP servers
4. Write a note on Similarity and Dissimilarity between objects. [Solve example questions of
finding cosine similarity, SMC & Jaccard coefficient of binary vectors - vvimp]
5. Write a note on: i) Techniques of efficient data cube computation ii) Purpose of efficient
processing of OLAP queries.

Module-3
1. Explain with an example: i) Apriori Algorithm or Frequent Item Set Generation ii) FP Growth
Algorithm iii) Alternative methods for FP Growth and generating Frequent Item Set.
2. What is the Association Rule? Define its basic terminologies. Explain Support and Confidence
3. What is correlation analysis? Explain Lift with an example.
4. Explain computational complexity of Apriori algorithm.
5. Write a note on Evaluation of Association Patterns. Elaborate on objective measure of
interestingness

Module-4
1. Define classification. Describe the general procedure of classification with a neat diagram.
2. Explain the following algorithms in detail with an example:
I. Bayesian Classifier
II. Nearest Neighbour Classifier
III. Decision Tree Classifier wrt Hunt’s Algorithm
IV. Rule Based Classifier
3. Explain the three methods for comparing Classifiers. List the characteristics of Naive Bayes’
classifier
4. Compare: i) The various measures for selecting the best split in Decision Tree ii) RB with CB
Methods

Module-5

1. Define a cluster. Explain the different types of clusters and cluster evaluation techniques with
a suitable diagram and example.
2. Explain the following algorithms with an example:
I. Agglomerative hierarchical clustering
II. K means clustering
III. DBSCAN clustering
IV. BIRCH & CURE (types of scalable clustering)
V. Graph based clustering
VI. Density based clustering [ DENQUE, CLIQUE, Grid]

You might also like