1. Consider the following set of frequent 3-itemsets: (1,2,3}, {1,2,4}, {1,2,5}, {1,3,4}, {2,3,4}, {2,3,5), {3,4,6). Assume that the only items in the data set are: {1},{2},{3},(4},{5},{6). All the 1-itemsets are frequent. a. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by candidate generation procedure using the Fk-1 x F1 merging strategy(w/ lexicographical order). b. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by candidate generation procedure in Apriori (Fk-1 × Fk-1 merging strategy). c. Out of the candidate 4-itemsets in (b.), which itemsets survive the candidate pruning step of the Apriori algorithm? For the itemsets that do not survive, note why they did not survive.

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

Data Mining. Please examine question. Online questions are different. Do not get answer from online. 

1. Consider the following set of frequent 3-itemsets:
{1,2,3}, {1,2,4}, {1,2,5}, {1,3,4}, {2,3,4}, {2,3,5}, {3,4,6}.
Assume that the only items in the data set are: {1},{2},{3},{4},{5},{6}. All the 1-itemsets are frequent.
a. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by
candidate generation procedure using the Fk-1 x F1 merging strategy(w/ lexicographical order).
b. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by
candidate generation procedure in Apriori (Fk-1 x Fk-1 merging strategy).
c. Out of the candidate 4-itemsets in (b.), which itemsets survive the candidate pruning step of the
Apriori algorithm? For the itemsets that do not survive, note why they did not survive.
Transcribed Image Text:1. Consider the following set of frequent 3-itemsets: {1,2,3}, {1,2,4}, {1,2,5}, {1,3,4}, {2,3,4}, {2,3,5}, {3,4,6}. Assume that the only items in the data set are: {1},{2},{3},{4},{5},{6}. All the 1-itemsets are frequent. a. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by candidate generation procedure using the Fk-1 x F1 merging strategy(w/ lexicographical order). b. List all candidate 4-itemsets (and the corresponding itemsets that were merged) obtained by candidate generation procedure in Apriori (Fk-1 x Fk-1 merging strategy). c. Out of the candidate 4-itemsets in (b.), which itemsets survive the candidate pruning step of the Apriori algorithm? For the itemsets that do not survive, note why they did not survive.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

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