Mining periodic-frequent itemsets with approximate periodicity using interval transaction-ids list tree - Archive ouverte HAL
Communication Dans Un Congrès Année : 2010

Mining periodic-frequent itemsets with approximate periodicity using interval transaction-ids list tree

Résumé

Temporal periodicity of itemset appearance can be regarded as an important criterion for measuring the interestingness of itemsets in several application. A frequent itemset can be said periodic-frequent in a database if it appears at a regular interval given by the user. In this paper, we propose a concept of the approximate periodicity of each itemset. Moreover, a new tree-based data structure, called ITL-tree (Interval Transaction-ids List tree), is proposed. Our tree structure maintains an approximation of the occurrence information in a highly compact manner for the periodic-frequent itemsets mining. A pattern-growth mining is used to generate all of periodic-frequent itemsets by a bottom-up traversal of the ITL-tree for user-given periodicity and support thresholds. The performance study shows that our data structure is very efficient for mining periodic-frequent itemsets with approximate periodicity results.
Fichier non déposé

Dates et versions

hal-01196538 , version 1 (10-09-2015)

Identifiants

  • HAL Id : hal-01196538 , version 1

Citer

Komate Amphawan, Philippe Lenca, Athasit Surarerks. Mining periodic-frequent itemsets with approximate periodicity using interval transaction-ids list tree. WKDD 2010 : The 3rd International Conference on Knowledge Discovery and Data Mining, Jan 2010, Phuket, Thailand. pp.245 - 248. ⟨hal-01196538⟩
49 Consultations
0 Téléchargements

Partager

More