An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases

: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an efficient algorithm LCM (Linear time Closed pattern Miner) for mining frequent closed patterns from large transaction databases. The main theoretical contribution is our proposed prefix-preserving closure extension of closed patterns, which enables us to search all frequent closed patterns in a depth-first manner, in linear time for the number of frequent closed patterns. Our algorithm do not need any storage space for the previously obtained patterns, while the existing algorithms needs it. Performance comparisons of LCM with straightforward algorithms demonstrate the advantages of our prefix-preserving closure extension.

• Type: Conference
• Year: 2004
• Where: DIS
• Authors: Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura
• Keywords: Closed Patterns, DIS 2004, Frequent Closed Patterns, Prefix-preserving Closure Extension, Theoretical Computer Science