| Challenge II |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Most existing
frequent pattern discovery |
||||||||||
| algorithms
perform searches in the column/item |
|||||||||||
| enumeration
space i.e. systematically
testing |
|||||||||||
| various
combination of columns/items |
|||||||||||
| • | For datasets
with 1000-100,000 columns, this |
||||||||||
| search space is
enormous |
|||||||||||
| • | Instead we adopt
a novel row/sample |
||||||||||
| enumeration
algorithm for this purpose. |
|||||||||||
| CARPENTER
(SIGKDD’03) is the FIRST |
|||||||||||
| algorithm
which adopt this approach |
|||||||||||