Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
(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}

Database System Concepts
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
See similar textbooks
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

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar 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
SEE MORE TEXTBOOKS