Efficient Vertical Mining of Frequent Closed Itemsets and Generators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Efficient Vertical Mining of Frequent Closed Itemsets and Generators

Abstract

The effective construction of many association rule bases require the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, these two tasks are rarely combined. Most of the existing solutions apply levelwise breadth-first traversal, though depth-first traversal is knowingly superior. Hence, we address here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one called Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.
Fichier principal
Vignette du fichier
ida09-rr.pdf (198.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00371193 , version 1 (31-03-2009)

Identifiers

  • HAL Id : inria-00371193 , version 1

Cite

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli. Efficient Vertical Mining of Frequent Closed Itemsets and Generators. [Research Report] 2009, pp.16. ⟨inria-00371193⟩
86 View
158 Download

Share

Gmail Facebook X LinkedIn More