Which one of the following 3-itemsets is frequent if minimum support count is 5? tID Items 1 water, cola, bread, chips, nuts 2 water, chips 3 bread, cola, chips CocaCola 4 water, nuts 5 cola, chips 6 water 7 nuts, cola, bread, chips 8 cola, bread, chips 9 cola, chips 10 nuts, cola, bread, chips Select one: (cola, chips, nuts) (water, chips, nuts) (cola, bread, chips) v (cola, chips, water) (nuts, cola, water) (nuts, cola, bread)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Material\ Data mining

Topic\ Frequent pattern mining

In picture (1,2) there is a solution, but I need to clarify the solution.

In picture (3) I need to solve and explain.

Which one of the following 3-itemsets is frequent if
minimum support count is 5?
tID Items
1 water, cola, bread, chips, nuts
2 water, chips
3 bread, cola, chips
4 water, nuts
5 cola, chips
6 water
7 nuts, cola, bread, chips
8 cola, bread, chips
9 cola, chips
10 nuts, cola, bread, chips
Select one:
(cola, chips, nuts)
(water, chips, nuts)
* (cola, bread, chips) v
(cola, chips, water)
(nuts, cola, water)
(nuts, cola, bread)
Transcribed Image Text:Which one of the following 3-itemsets is frequent if minimum support count is 5? tID Items 1 water, cola, bread, chips, nuts 2 water, chips 3 bread, cola, chips 4 water, nuts 5 cola, chips 6 water 7 nuts, cola, bread, chips 8 cola, bread, chips 9 cola, chips 10 nuts, cola, bread, chips Select one: (cola, chips, nuts) (water, chips, nuts) * (cola, bread, chips) v (cola, chips, water) (nuts, cola, water) (nuts, cola, bread)
Let we have the following set of frequent 2-itemsets L2 = {{a,b}, {a, c},{a, e}, {b, c}, {b, d}, {b,e}}. Choose C3, the
correct set of candidate 3-itemset generated and pruned by the Apriori algorithm.
Select one:
O (a,c,d,e)
O {{a,b,c,d), {a,c.d,e), (a,b.c,e), (a,b,d,e}}
O {{a,b.c.d), {a,c,d,e), (a,b,c,e}}
O {{a,b,c,d), (a,c,d,e), {a,b,d,e)}
O {{a,b,c,d},(a,c,d,e}}
O (a,b,c,d) v
Transcribed Image Text:Let we have the following set of frequent 2-itemsets L2 = {{a,b}, {a, c},{a, e}, {b, c}, {b, d}, {b,e}}. Choose C3, the correct set of candidate 3-itemset generated and pruned by the Apriori algorithm. Select one: O (a,c,d,e) O {{a,b,c,d), {a,c.d,e), (a,b.c,e), (a,b,d,e}} O {{a,b.c.d), {a,c,d,e), (a,b,c,e}} O {{a,b,c,d), (a,c,d,e), {a,b,d,e)} O {{a,b,c,d},(a,c,d,e}} O (a,b,c,d) v
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Research
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education