Ask
Login
0
82kviews
A database has five transactions. Let min-support = 60_ and min- confidence = 80%. Find all frequent item sets by using Apriori Algorithm T_ID is the transaction ID
written 5.1 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.2 years ago
T_ID Items bought
T-1000 M,O,N,K,E,Y
T-1001 D,O,N,K,E,Y
T-1002 M,A,K,E
T-1003 M,U,C,K,Y
T-1004 C,O,O,K,E
data warehouse and mining
ADD COMMENT EDIT
1 Answer
14
18kviews
written 5.1 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 5.1 years ago

Apriori algorithm:

The apriori algorithm solves the frequent item sets problem. The algorithm analyzes a data set to determine which combinations of items occur together frequently. The Apriori algorithm is at the core of various algorithms for data mining problems. The best known problem is finding the association rules that …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.