List all the candidate 4-sequences pruned during the candidate pruning step of the GSP algorithm (assuming no timing constraints).

Question

Consider the following frequent 3-sequences:
< {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} >.

Answer 1

When there is no timing constraints, all subsequences of a candidate
must be frequent. Therefore, the pruned candidates are:
< {1, 2, 3} {3} >, < {1, 2} {3} {3} >, < {1, 2} {3} {4} >,
< {1} {2, 3} {3} >, < {1} {2, 3} {4} >.