List all the candidate 4-sequences pruned during the candidate pruning step of the GSP algorithm (assuming maxgap = 1).

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} >.


With timing constraint, only contiguous 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} >.

Computer Science & Information Technology

You might also like to view...

Suppose a small manufacturing business wishes to have a system to manage all its vital business operations, they should go for a(n) _______.

A. decision support system B. transaction processing system C. management information system D. enterprise resource planning (ERP) system

Computer Science & Information Technology

The ________ function sums the values and then divides by the count

Fill in the blank(s) with correct word

Computer Science & Information Technology

The expression for a calculated field can be typed directly into the Field row.

Answer the following statement true (T) or false (F)

Computer Science & Information Technology

Vector graphics are resolution independent.

Answer the following statement true (T) or false (F)

Computer Science & Information Technology