Computational Structures and Algorithms for Association Rules

"Computational Structures and Algorithms for Association Rules" presents the development of state-of-the-art algorithms for finding association rules. The rigorous mathematical construction of each algorithm is described in detail, covering advanced approaches such as formal concept analysis and Galois connection frameworks. This title: presents an extensive use of proofs, definitions, propositions, procedures, and examples throughout the text; introduces the Galois framework, including definitions of the basic notion; describes enumeration algorithms for solving problems of finding all formal concepts, all formal anti-concepts, and bridging the gap between concepts and anti-concepts; includes a helpful notation section, and useful chapter summaries; examines an alternative - non-enumerative - approach to solving the same problems, resulting in the construction of an incremental algorithm; and, discusses solutions to the problem of building limited-size and minimal generator sets (representations) for perfect and approximate association rules (implications).