IEICE Transactions on Information and Systems
Special Section on Knowledge, Information and Creativity Support System
Mining Regular Patterns in Transactional Databases
Syed Khairuzzaman TANBEERChowdhury Farhan AHMEDByeong-Soo JEONGYoung-Koo LEE
Author information

Volume E91.D (2008) Issue 11 Pages 2568-2577

Download PDF (582K) Contact us

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.

Information related to the author
© 2008 The Institute of Electronics, Information and Communication Engineers
Previous article Next article

Recently visited articles
Journal news & Announcements
  • Please contact trans-d [a], if you want to unlock PDF security.