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 devised for both sequential and parallel execution. Parallel algorithm design takes advantage of the lattice structure of the search space. Partitioning is performed via lattice recursive bisection. Database partitioning is also used as an additional source of parallelism.Part of the motivation for writing this book was postgraduate teaching. Since the book only assumes elementary mathematical knowledge in the domains of lattices, combinatorial optimization, probability calculus, and statistics, it is fit for use by undergraduate students as well.
The algorithms are described in a C-like pseudo programming language. The computations are shown in great detail. This makes the book also fit for use by implementers: computer scientists in many domains as well as industry engineers.