Efficient Vertical Mining of Frequent Closures and Generators - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Efficient Vertical Mining of Frequent Closures and Generators

Résumé

The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few miners address both concerns, typically by applying levelwise breadth-first traversal. As depth-first traversal is known to be superior, we examine 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, 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
szathmary_etal-ida09.pdf (333.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00618805 , version 1 (03-09-2011)

Identifiants

Citer

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. Efficient Vertical Mining of Frequent Closures and Generators. 8th International Symposium on Intelligent Data Analysis - IDA 2009, Aug 2009, Lyon, France. pp.393--404, ⟨10.1007/978-3-642-03915-7_34⟩. ⟨inria-00618805⟩
110 Consultations
224 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More