Back to the 2026 paper

Module 2: Data Mining Fundamentals and Association Rule Mining

20262m

In a database of 200 transactions, an itemset occurs in 50 transactions. Its support is

(i) 10%
(ii) 25%
(iii) 20%
(iv) 50%

Worked SolutionAI Assisted

Solution

Correct Answer: (ii) 25%

Explanation

Support of an itemset = (number of transactions containing the itemset) / (total number of transactions)

Support = 50 / 200 = 0.25 = 25%

Why other options are incorrect:

  • (i) 10% = 20/200, (iii) 20% = 40/200, (iv) 50% = 100/200.

Answer: (ii) 25%

Similar questions

Data MiningSupport of an itemset represents (i) Probability that the consequent occurs given the antecedent (ii) Number of attributes in the database (iii) Frequency with which the itemset occurs in the database (iv) Number of rules generated20262mData MiningConsider a database D, consisting of 15 transactions. Suppose minimum support count is 2 (i.e., min_sup = 20%) and minimum confidence required is 70%. Find out the frequent item set using a priori algorithm. Explain each step with diagram: | A1 | A2 | A3 | A4 | A5 | A6 | A7 | A8 | A9 | |:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:| | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |20208mData MiningConsider the 5 transactions given below. If minimum support is 30% and minimum confidence is 80% determine the frequent itemsets and association rules using apriori algorithm. | Transaction | Items | | :---: | --- | | T1 | Bread, Jelly, Butter | | T2 | Bread, Butter | | T3 | Bread, Milk, Butter | | T4 | Coke, Bread | | T5 | Coke, Milk |20239mData MiningA database has five transactions. Let min sup = 60% and min con f = 80% : | TID | items_bought | |---|---| | T100 | {M, O, N, K, E, Y} | | T200 | {D, O, N, K, E, Y} | | T300 | {M, A, K, E} | | T400 | {M, U, C, K, Y} | | T500 | {C, O, O, K, I, E} | Find all frequent item sets using Apriori and FP-growth, respectively. Compare the efficiency of the two mining processes.202214m
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.