(1) Run the Apriori algorithm (mentally, not through any computer program) and compute Ci (candidate itemset) and L; (frequent itemset) for each iteration i. In computing C₁, please apply self-joining and pruning. Compare your answers with the following and select all the correct ones. C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, o, k, e} C₁ = {m, o, n, k, e, y,, d, a, u, c, i} and L₁ = {m, o, k, e, y} C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, n, o, k, e, y} C2 = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke, ky} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, mn, ok, oe, ke, ky} C3 = {oke} and L3 = {oke} C3 = {oke, key} and L3 = {oke, key} C3 = {oke, key} and L3 = {oke} The following database has 5 transactions. Let min_sup = 60% and min_conf = 80%. TID Items_bought T100 {m, o, n, k, e, y} T200 {d, o, n, k, e, y} T300 {m, a, k, e} T400 {m, u, c, k, y} T500 {c, o, k, i, e}
(1) Run the Apriori algorithm (mentally, not through any computer program) and compute Ci (candidate itemset) and L; (frequent itemset) for each iteration i. In computing C₁, please apply self-joining and pruning. Compare your answers with the following and select all the correct ones. C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, o, k, e} C₁ = {m, o, n, k, e, y,, d, a, u, c, i} and L₁ = {m, o, k, e, y} C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, n, o, k, e, y} C2 = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke, ky} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, mn, ok, oe, ke, ky} C3 = {oke} and L3 = {oke} C3 = {oke, key} and L3 = {oke, key} C3 = {oke, key} and L3 = {oke} The following database has 5 transactions. Let min_sup = 60% and min_conf = 80%. TID Items_bought T100 {m, o, n, k, e, y} T200 {d, o, n, k, e, y} T300 {m, a, k, e} T400 {m, u, c, k, y} T500 {c, o, k, i, e}
Chapter2: Database Design Fundamentals
Section: Chapter Questions
Problem 11RQ
Related questions
Question
![(1) Run the Apriori algorithm (mentally, not through any computer program) and compute Ci
(candidate itemset) and L; (frequent itemset) for each iteration i. In computing C₁, please apply
self-joining and pruning. Compare your answers with the following and select all the correct
ones.
C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, o, k, e}
C₁ = {m, o, n, k, e, y,, d, a, u, c, i} and L₁ = {m, o, k, e, y}
C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, n, o, k, e, y}
C2 = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke}
C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke, ky}
C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, mn, ok, oe, ke, ky}
C3 = {oke} and L3 = {oke}
C3 = {oke, key} and L3 = {oke, key}
C3 = {oke, key} and L3 = {oke}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9e6fa127-a003-469d-9a51-b1d4610918ed%2F35bdc61e-44fa-4cb7-8b0b-5671e283ebe5%2Fd7xgwyu_processed.png&w=3840&q=75)
Transcribed Image Text:(1) Run the Apriori algorithm (mentally, not through any computer program) and compute Ci
(candidate itemset) and L; (frequent itemset) for each iteration i. In computing C₁, please apply
self-joining and pruning. Compare your answers with the following and select all the correct
ones.
C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, o, k, e}
C₁ = {m, o, n, k, e, y,, d, a, u, c, i} and L₁ = {m, o, k, e, y}
C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, n, o, k, e, y}
C2 = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke}
C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke, ky}
C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, mn, ok, oe, ke, ky}
C3 = {oke} and L3 = {oke}
C3 = {oke, key} and L3 = {oke, key}
C3 = {oke, key} and L3 = {oke}
![The following database has 5 transactions. Let min_sup = 60% and min_conf = 80%.
TID
Items_bought
T100
{m, o, n, k, e, y}
T200
{d, o, n, k, e, y}
T300
{m, a, k, e}
T400
{m, u, c, k, y}
T500
{c, o, k, i, e}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9e6fa127-a003-469d-9a51-b1d4610918ed%2F35bdc61e-44fa-4cb7-8b0b-5671e283ebe5%2Fg1ae4ns_processed.png&w=3840&q=75)
Transcribed Image Text:The following database has 5 transactions. Let min_sup = 60% and min_conf = 80%.
TID
Items_bought
T100
{m, o, n, k, e, y}
T200
{d, o, n, k, e, y}
T300
{m, a, k, e}
T400
{m, u, c, k, y}
T500
{c, o, k, i, e}
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 1 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![A Guide to SQL](https://www.bartleby.com/isbn_cover_images/9781111527273/9781111527273_smallCoverImage.gif)
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr
![A Guide to SQL](https://www.bartleby.com/isbn_cover_images/9781111527273/9781111527273_smallCoverImage.gif)
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr