Discuss the apriori algorithm for discovering frequent itemsets.

Welcome back.

and 2 others joined a min ago.

5.8kviews

written 3.7 years ago by

M_Umair_Khan42900 • 10

modified 3.7 years ago by

binitamayekar ★ 6.7k

Discuss the apriori algorithm for discovering frequent itemsets. Apply apriori algorithm to the following data set. Use 0.3 for the minimum support value. The set of items is {strawberry, litchi, oranges, butter fruit, vanilla, Banana, apple}. Use 0.3 for the minimum support value.

enter image description here

data mining and business intelligence

ADD COMMENT EDIT

1 Answer

790views

written 3.7 years ago by

binitamayekar ★ 6.7k

• modified 3.7 years ago

Apriori Algorithm to Discover Frequent Itemsets.

The given Minimum Support Value = 0.3

The Number of Transactions = 10

Therefore,

The Minimum Support = $0.3 \times 10 = 3$

Step 1 - Calculate the Minimum Count for each Item.

Therefore,

Items	Minimum Count
Strawberry	5
Litchi	4
Orange	4
Butter …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company