October 2017
Beginner to intermediate
572 pages
26h 1m
English
Perform the following steps to generate a frequent itemset using the Eclat algorithm:
> frequentsets=eclat(Groceries,parameter=list(support=0.05, maxlen=10))
> summary(frequentsets) Output set of 31 itemsets most frequent items: whole milk other vegetables yogurt 4 2 2 rolls/buns frankfurter (Other) 2 1 23 element (itemset/transaction) length distribution:sizes 1 2 28 3 Min. 1st Qu. Median Mean 3rd Qu. Max. 1.000 1.000 1.000 1.097 1.000 2.000 summary of quality measures: support Min. :0.05236 1st Qu.:0.05831 Median :0.07565 Mean :0.09212 3rd Qu.:0.10173 ...
Read now
Unlock full access