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.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Need help finding candidate itemsets "Aprirori Algorithm"  . 

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.
Transcribed Image Text: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.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY