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.
منابع مشابه
Generating Frequent Closed Item Sets Based on Zero-suppressed BDDs
(Abstract) Frequent item set mining is one of the fundamental techniques for knowledge discovery and data mining. In the last decade, a number of efficient algorithms for frequent item set mining have been presented, but most of them focused on just enumerating the item set patterns which satisfy the given conditions, and it was a different matter how to store and index the result of patterns f...
متن کاملEfficient Mining of Cross-Transaction Web Usage Patterns in Large Database
Web Usage Mining is the application of data mining techniques to large Web log databases in order to extract usage patterns. A cross-transaction association rule describes the association relationships among different user transactions in Web logs. In this paper, a Linear time intra-transaction frequent itemsets mining algorithm and the closure property of frequent itemsets are used to mining c...
متن کاملLCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets
In this paper, we propose three algorithms LCMfreq, LCM, and LCMmax for mining all frequent sets, frequent closed item sets, and maximal frequent sets, respectively, from transaction databases. The main theoretical contribution is that we construct treeshaped transversal routes composed of only frequent closed item sets, which is induced by a parent-child relationship defined on frequent closed...
متن کاملMining Cross-Transaction Web Usage Patterns
Web Usage Mining is the application of data mining techniques to large web log databases in order to extract usage patterns. However, most of the previous studies on usage patterns discovery just focus on mining intra-transaction associations, i.e., the associations among items within the same user’s transactions. A cross-transaction association rule describes the association relationships amon...
متن کاملZBDD-growth: An Efficient Method for Frequent Pattern Mining and Knowledge Indexing
(Abstract) Frequent pattern mining is one of the fundamental techniques for knowledge discovery and data mining. In the last decade, a number of efficient algorithms for frequent pattern mining have been presented, but most of them focused on just enumerating the patterns which satisfy the given conditions, and it was a different matter how to store and index the result of patterns for efficien...
متن کامل