RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database

Authors:
Syed Khairuzzaman Tanbeer;Chowdhury Farhan Ahmed;Byeong-Soo Jeong;Young-Koo Lee
Affiliations:
Department of Computer Engineering, Kyung Hee University, Kyonggi-do, South Korea 446-701;Department of Computer Engineering, Kyung Hee University, Kyonggi-do, South Korea 446-701;Department of Computer Engineering, Kyung Hee University, Kyonggi-do, South Korea 446-701;Department of Computer Engineering, Kyung Hee University, Kyonggi-do, South Korea 446-701
Venue:
IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
Year:
2008

Citing 8
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Cyclic Association Rules

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Periodicity Detection in Time Series Databases

IEEE Transactions on Knowledge and Data Engineering
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window

Knowledge and Information Systems
CP-tree: a tree structure for single-pass frequent pattern mining

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
An efficient algorithm for frequent itemset mining on data streams

ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
A parallel algorithm for mining multiple partial periodic patterns

Information Sciences: an International Journal

Efficient mining regularly frequent patterns in transactional databases

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Temporal regularity of pattern appearance can be regarded as an important criterion for measuring the interestingness in several applications like market basket analysis, web administration, gene data analysis, network monitoring, and stock market. Even though there have been some efforts to discover periodic patterns in time-series and sequential data, none of the existing works is appropriate 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 and propose an efficient data structure, called Regular Pattern tree (RP-tree in short), that enables a pattern growth-based mining technique to generate the complete set of regular patterns in a database for a user-given regularity threshold. Our comprehensive experimental study shows that RP-tree is both time and memory efficient in finding regular pattern.