(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}

A Guide to SQL
9th Edition
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Philip J. Pratt
Chapter2: Database Design Fundamentals
Section: Chapter Questions
Problem 11RQ
icon
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}
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}
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 1 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
A Guide to SQL
A Guide to SQL
Computer Science
ISBN:
9781111527273
Author:
Philip J. Pratt
Publisher:
Course Technology Ptr