Efficient mining top-k regular-frequent itemset using compressed tidsets - Archive ouverte HAL
Chapitre D'ouvrage Année : 2012

Efficient mining top-k regular-frequent itemset using compressed tidsets

Résumé

Association rule discovery based on support-confidence framework is an important task in data mining. However, the occurrence frequency (support) of a pattern (itemset) may not be a sufficient criterion for discovering interesting patterns. Temporal regularity, which can be a trace of behavior, with frequency behavior can be revealed as an important key in several applications. A pattern can be regarded as a regular pattern if it occurs regularly in a user-given period. In this paper, we consider the problem of mining top-k regular-frequent itemsets from transactional databases without support threshold. A new concise representation, called compressed transaction-ids set (compressed tidset), and a single pass algorithm, called TR-CT (Top-k Regular frequent itemset mining based on Compressed Tidsets), are proposed to maintain occurrence information of patterns and discover k regular itemsets with highest supports, respectively. Experimental results show that the use of the compressed tidset representation achieves highly efficiency in terms of execution time and memory consumption, especially on dense datasets.
Fichier non déposé

Dates et versions

hal-00724797 , version 1 (22-08-2012)

Identifiants

  • HAL Id : hal-00724797 , version 1

Citer

Komate Amphawan, Philippe Lenca, Athasit Surarerks. Efficient mining top-k regular-frequent itemset using compressed tidsets. New Frontiers in Applied Data Mining - PAKDD 2011 International Workshops, Shenzhen, China, May 24-27, 2011, Revised Selected Papers, 7104, Springer-Verlag Berlin Heidelberg, pp.124 - 135, 2012, Lecture Notes in Computer Science. ⟨hal-00724797⟩
85 Consultations
0 Téléchargements

Partager

More