𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Data Mining for Association Rules and Sequential Patterns: Sequential and Parallel Algorithms

✍ Scribed by Jean-Marc Adamo (auth.)


Publisher
Springer-Verlag New York
Year
2001
Tongue
English
Leaves
259
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Data mining includes a wide range of activities such as classification, clustering, similarity analysis, summarization, association rule and sequential pattern discovery, and so forth. The book focuses on the last two previously listed activities. It 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. Part of the motivation for writing this book was postgraduate teaching. One of the main intentions was to make the book a suitable support for the clear exposition of problems and algorithms as well as a sound base for further discussion and investigation. 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.

✦ Table of Contents


Front Matter....Pages i-x
Introduction....Pages 1-4
Search Space Partition-Based Rule Mining....Pages 5-32
Apriori and Other Algorithms....Pages 33-48
Mining for Rules over Attribute Taxonomies....Pages 49-65
Constraint-Based Rule Mining....Pages 67-78
Data Partition-Based Rule Mining....Pages 79-91
Mining for Rules with Categorical and Metric Attributes....Pages 93-109
Optimizing Rules with Quantitative Attributes....Pages 111-150
Beyond Support-Confidence Framework....Pages 151-184
Search Space Partition-Based Sequential Pattern Mining....Pages 185-228
Back Matter....Pages 229-254

✦ Subjects


Database Management; Information Storage and Retrieval; Artificial Intelligence (incl. Robotics); Algorithm Analysis and Problem Complexity


πŸ“œ SIMILAR VOLUMES


Algorithms: Sequential, Parallel, and Di
✍ Kenneth A. Berman, Jerome L. Paul πŸ“‚ Library πŸ“… 2004 πŸ› Course Technology 🌐 English

Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel com

Sequential and Parallel Algorithms and D
✍ Sanders, P.;Mehlhorn, K.;Dietzfelbinger, M.;Dementiev, R. πŸ“‚ Library πŸ“… 2019 πŸ› Springer 🌐 English

This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simpl

Algorithms for Elliptic Problems: Effici
✍ MariΓ‘n VajterΕ‘ic (auth.) πŸ“‚ Library πŸ“… 1993 πŸ› Springer Netherlands 🌐 English

This volume deals with problems of modern effective algorithms for the numerical solution of the most frequently occurring elliptic partial differential equations. From the point of view of implementation, attention is paid to algorithms for both classical sequential and parallel computer systems. <

Fundamentals of Sequential and Parallerl
✍ Kenneth A. Berman, Jerome L. Paul πŸ“‚ Library πŸ“… 1996 πŸ› PWS 🌐 English

Reflecting the increasing importance of parallel algorithms and parallel computer architectures, this text provides in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid foundation in the theory of parallel algorithms.