An Efficient Hybrid Algorithm for Mining Frequent Closures and Generators

Laszlo Szathmary 1, * Petko Valtchev 1 Amedeo Napoli 2 Robert Godin 1
* Auteur correspondant
2 ORPAILLEUR - Knowledge representation, reasonning
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The effective construction of many association rule bases requires 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, depending on data characteristics, is often superior. Hence, we address here a hybrid algorithm that combines the two different traversals. The proposed algorithm, Eclat-Z, extracts frequent itemsets (FIs) in a depth-first way. Then, the algorithm filters FCIs and FGs among FIs in a levelwise manner, and associates the generators to their closures. In Eclat-Z we present a generic technique for extending an arbitrary FI-miner algorithm in order to support the generation of minimal non-redundant association rules too. Experimental results indicate that Eclat-Z outperforms pure levelwise methods in most cases.
Type de document :
Communication dans un congrès
Radim Belohlavek and Sergei O. Kuznetsov. 6th International Conference on Concept Lattices and Their Applications (CLA '08), Oct 2008, Olomouc, Czech Republic. pp.47-58, 2008
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00335247
Contributeur : Laszlo Szathmary <>
Soumis le : mardi 28 octobre 2008 - 20:39:46
Dernière modification le : jeudi 11 janvier 2018 - 06:19:54
Document(s) archivé(s) le : lundi 7 juin 2010 - 22:26:29

Fichier

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

Identifiants

  • HAL Id : inria-00335247, version 1

Collections

Citation

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin. An Efficient Hybrid Algorithm for Mining Frequent Closures and Generators. Radim Belohlavek and Sergei O. Kuznetsov. 6th International Conference on Concept Lattices and Their Applications (CLA '08), Oct 2008, Olomouc, Czech Republic. pp.47-58, 2008. 〈inria-00335247〉

Partager

Métriques

Consultations de la notice

331

Téléchargements de fichiers

172