BIDE: Efficient Mining of Frequent Closed Sequences

Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not only more compact yet complete result set but also better efficiency. However, most of the previously developed closed pattern mining algorithms work under the candidate maintenance-and-test paradigm which is inherently costly in both runtime and space usage when the support threshold is low or the patterns become long. In this paper, we present, BIDE, an efficient algorithm for mining frequent closed sequences without candidate maintenance. It adopts a novel sequence closure checking scheme called BI-Directional Extension, and prunes the search space more deeply compared to the previous algorithms by using the BackScan pruning method and the ScanSkip optimization technique. A thorough performance study with both sparse and dense real-life data sets has demonstrated that BIDE significantly outperfor...

• Type: Conference
• Year: 2004
• Where: ICDE
• Authors: Jianyong Wang, Jiawei Han
• Keywords: Closed Pattern Mining, Database, Frequent Closed Sequences, Frequent Pattern Mining, ICDE 2004