Question: Consider the following frequent 3-sequences: < {1, 2, 3} >, < {1, 2}{3} >, < {1}{2, 3} >, < {1, 2}{4} >, < {1, 3}{4}
< {1, 2, 3} >, < {1, 2}{3} >, < {1}{2, 3} >, < {1, 2}{4} >,
< {1, 3}{4} >, < {1, 2, 4} >, < {2, 3}{3} >, < {2, 3}{4} >,
< {2}{3}{3} >, and < {2}{3}{4} >.
(a) List all the candidate 4-sequences produced by the candidate generation step of the GSP algorithm.
b) List all the candidate 4-sequences pruned during the candidate pruning step of the GSP algorithm (assuming no timing constraints).
(c) List all the candidate 4-sequences pruned during the candidate pruning step of the GSP algorithm (assuming maxgap = 1).
Step by Step Solution
★★★★★
3.57 Rating (157 Votes )
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
a 1 2 3 3 1 2 3 4 1 2 3 3 1 2 3 4 1 2 3 3 1 2 3 4 b When there is no timing constr... View full answer
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
Document Format (1 attachment)
908-M-S-D-A (8660).docx
120 KBs Word File
Study Help