The book provides a unified presentation of algorithms for association rule and sequential pattern discovery. For both mining problems, the presentation relies on the lattice structure of the search space. All algorithms are built as processes running on this structure. Proving their properties takes advantage of the mathematical properties of the structure. Mining for association rules and sequential patterns is known to be a problem with large computational complexity. The issue of designing efficient parallel algorithms should be considered as critical. Most algorithms in the book are…
Counted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.
