Mining Regular Patterns in Transactional Databases
34
TL;DR: This paper introduces a novel concept of mining regular patterns from transactional databases and devise an efficient tree-based data structure, called a Regular Pattern tree (RP-tree in short), that captures the database contents in a highly compact manner and enables a pattern growth-based mining technique to generate the complete set of regular patterns in a database for a user-defined regularity threshold.
read more
Abstract: The frequency of a pattern may not be a sufficient criterion for identifying meaningful patterns in a database. The temporal regularity of a pattern can be another key criterion for assessing the importance of a pattern in several applications. A pattern can be said regular if it appears at a regular user-defined interval in the database. Even though there have been some efforts to discover periodic patterns in time-series and sequential data, none of the existing studies have provided an appropriate method for discovering the patterns that occur regularly in a transactional database. Therefore, in this paper, we introduce a novel concept of mining regular patterns from transactional databases. We also devise an efficient tree-based data structure, called a Regular Pattern tree (RP-tree in short), that captures the database contents in a highly compact manner and enables a pattern growth-based mining technique to generate the complete set of regular patterns in a database for a user-defined regularity threshold. Our performance study shows that mining regular patterns with an RP-tree is time and memory efficient, as well as highly scalable.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Introduction to Data Mining
Daniel T. Larose
- 27 Jan 2005
TL;DR: This book discusses data mining through the lens of cluster analysis, which examines the relationships between data, clusters, and algorithms, as well as some of the techniques used to solve this problem.
3.5K
Introduction to Data Mining
Pang-Ning Tan,Michael Steinbach,Vipin Kumar +2 more
- 28 Jan 2022
TL;DR: This book discusses data mining through the lens of cluster analysis, which examines the relationships between data, clusters, and algorithms, and some of the techniques used to solve these problems.
1.1K
Using the internet of things in smart energy systems and networks
TL;DR: A clear insight into IoT devices' recent developments in smart energy systems is provided, supported by high-quality published literature, and key industries for IoT revenue generation and application development are described.
180
New approaches for mining regular high utility sequential patterns
TL;DR: The concept of regular high utility sequential patterns is introduced and an algorithm for mining these patterns from static databases and sliding-window based data streams are developed and results are found compared to the existing research.
40
Mining of productive periodic-frequent patterns for IoT data analytics
TL;DR: Two approaches to discover productive periodic-frequent sensor patterns (PPFSP) are presented; a parallel method using a compact productive pattern sensor tree (PPSD-Tree) and Map-reduced PPF SP-H mining algorithm on Hadoop to facilitate PPFSP mining on large data.
27
References
Mining association rules between sets of items in large databases
Rakesh Agrawal,Tomasz Imielinski,Arun N. Swami +2 more
- 01 Jun 1993
TL;DR: An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Mining frequent patterns without candidate generation
Jiawei Han,Jian Pei,Yiwen Yin +2 more
- 16 May 2000
TL;DR: This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
Mining association rules between sets of items in large databases
TL;DR: An efficient algorithm is presented that generates all significant transactions in a large database of customer transactions that consists of items purchased by a customer in a visit.
4.5K
Efficient algorithms for mining closed itemsets and their lattice structure
Mohammed J. Zaki,C.-J. Hsiao +1 more
TL;DR: CHARM is an efficient algorithm for mining all frequent closed itemsets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels, and uses a technique called diffsets to reduce the memory footprint of intermediate computations.
738
Efficient mining of partial periodic patterns in time series database
Jiawei Han,Guozhu Dong,Yiwen Yin +2 more
- 23 Mar 1999
TL;DR: This work presents several algorithms for efficient mining of partial periodic patterns by exploring some interesting properties related to partial periodicity such as the Apriori property and the max-subpattern hit set property, and by shared mining of multiple periods.