Efficient Vertical Mining of Frequent Closures and Generators

Abstract : 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.
Type de document :
Communication dans un congrès
Niall M. Adams and Céline Robardet and Arno Siebes and Jean-François Boulicaut. 8th International Symposium on Intelligent Data Analysis - IDA 2009, Aug 2009, Lyon, France. Springer, 5772, pp.393--404, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03915-7_34〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00618805
Contributeur : Laszlo Szathmary <>
Soumis le : samedi 3 septembre 2011 - 03:37:12
Dernière modification le : jeudi 11 janvier 2018 - 06:19:53
Document(s) archivé(s) le : mardi 13 novembre 2012 - 09:50:50

Fichier

szathmary_etal-ida09.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. Efficient Vertical Mining of Frequent Closures and Generators. Niall M. Adams and Céline Robardet and Arno Siebes and Jean-François Boulicaut. 8th International Symposium on Intelligent Data Analysis - IDA 2009, Aug 2009, Lyon, France. Springer, 5772, pp.393--404, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03915-7_34〉. 〈inria-00618805〉

Partager

Métriques

Consultations de la notice

166

Téléchargements de fichiers

116