Scribd
Upload
2 views3 pages

2nd Assignment

The document outlines an assignment focused on classification and frequent patterns in data mining, divided into three sections: short answers, mid short answers, and long answers. It covers key concepts such as frequent itemsets, the Apriori algorithm, decision trees, Naïve Bayes classification, and prediction accuracy measures. Additionally, it includes tasks like explaining algorithms and mining association rules with practical examples.

Uploaded by

nandeesh kulkarni
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
2 views3 pages

2nd Assignment

The document outlines an assignment focused on classification and frequent patterns in data mining, divided into three sections: short answers, mid short answers, and long answers. It covers key concepts such as frequent itemsets, the Apriori algorithm, decision trees, Naïve Bayes classification, and prediction accuracy measures. Additionally, it includes tasks like explaining algorithms and mining association rules with practical examples.

Uploaded by

nandeesh kulkarni
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

2nd Assignment:Classification & Frequent Patterns

Section A – Short Answer

1. Define Frequent Itemset in data mining.


2. What is the purpose of the Apriori algorithm?
3. What is support in association rule mining?
4. Define Decision Tree.
5. What is Naïve Bayes classification?
6. What is meant by Precision in prediction accuracy?

Section B – (mid short Answer)

1. Explain the basic concept of frequent pattern mining with a real-time example.
2. Describe the working of the Apriori algorithm step-by-step.
3. Explain FP-Growth algorithm and how it is different from Apriori.
4. Explain Decision Tree Induction with an example.
5. Write short notes on k-Nearest Neighbour (k-NN) algorithm.

✅ Section C – (Long Answer)

1. Explain in detail the process of mining association rules, including support and
confidence, with an example.
2. Discuss different classification methods:
o Decision Tree
o Naïve Bayes
o Rule-Based Classification
o Lazy Learners (k-NN)

Compare their advantages and disadvantages.

3. Explain Prediction Accuracy measures:


o Precision
o Recall

4. apply the FP-Growth algorithm to find frequent itemsets (item groups that occur often
together), with a minimum support count = 2
4.

You might also like