Explore BrainMass
Share

Closed Frequent Item Sets

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Answer the following questions based on the data sets shown in Figure 1. Note that each data set contains 1000 items and 10000 transactions. Dark cells indicate the presence of items and white cells indicate the absence of items. We will apply the Apriori algorithm to extract frequent item sets with minsup = 10% (i.e, itemsets must be contain at least 1000 transactions).

(a) Assume that the minimum support threshold is equal to 10%. How many closed frequent itemsets will be discovered from data set 1?
(b) Which data set will produce frequent itemsets with high support?
(c) Which data set will produce the most number of closed frequent itemsets?

See attached file for data.

© BrainMass Inc. brainmass.com March 22, 2019, 2:57 am ad1c9bdddf
https://brainmass.com/computer-science/data/closed-frequent-item-sets-595632

Attachments

Solution Preview

Answer the following questions based on the data sets shown in Figure 1. Note that each data set contains 1000 items and 10000 transactions. Dark cells indicate the presence of items and white cells indicate the absence of items. We will apply the Apriori algorithm to extract frequent item sets with minsup = 10% (i.e, itemsets must contain ...

Solution Summary

The solution gives detailed steps on finding the number of closed frequent item sets and deciding their supports.

$2.19