ZART: A Multifunctional Itemset Mining Algorithm

Abstract : In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional features and performs the following, usually independent, tasks: identify frequent closed itemsets and associate generators to their closures. This makes Zart a complete algorithm for computing classes of itemsets including generators and closed itemsets. These characteristics allow one to extract minimal non-redundant association rules, a useful and lossless representation of association rules. In addition, being based on the Pascal algorithm, Zart has a rather efficient behavior on weakly and strongly correlated data. Accordingly, Zart is at the heart of the Coron platform, which is a domain independent, multi-purposed data mining platform, incorporating a rich collection of data mining algorithms.
Type de document :
Communication dans un congrès
5th International Conference on Concept Lattices and Their Applications (CLA '07), Oct 2007, Montpellier, France. pp.26--37, 2007
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00189423
Contributeur : Laszlo Szathmary <>
Soumis le : mercredi 12 décembre 2007 - 07:00:03
Dernière modification le : jeudi 11 janvier 2018 - 06:19:54
Document(s) archivé(s) le : lundi 12 avril 2010 - 02:54:12

Fichier

szathmary07-zart.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00189423, version 1

Collections

Citation

Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznetsov. ZART: A Multifunctional Itemset Mining Algorithm. 5th International Conference on Concept Lattices and Their Applications (CLA '07), Oct 2007, Montpellier, France. pp.26--37, 2007. 〈inria-00189423〉

Partager

Métriques

Consultations de la notice

405

Téléchargements de fichiers

293