Please Note No Handwriting or picture.Han, J., Kamber, M., and Pei, J. (2011). Data Mining: Concepts and Techniques (3 rd ed.). San Francisco: Morgan Kaufmann
Please Note No Handwriting or picture.Han, J., Kamber, M., and Pei, J. (2011). Data Mining: Concepts and Techniques (3rd ed.). San Francisco: Morgan Kaufmann In. ISBN#: 978-0-12-381479-1 (print), 9780123814807 (e-text).
Q) A database has five transactions. Let min sup = 60% and min conf = 75%.
TID | Items-bought |
T100 | M, O, N, N, K, E, Y, Y |
T200 | D, D, O, N, K, E, Y |
T300 | M, M, A, K, E, E |
T400 | M, U, C, C, Y, C, E, O |
T500 | C, O, O, K, I, I, E |
a. Find all frequent itemsets using Apriori Algorithm. b. Find all frequent itemsets using FP-growth Algorithm. c. Compare the efficiency of these two mining processes.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started