ZART: A Multifunctional Itemset Mining Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

ZART: A Multifunctional Itemset Mining Algorithm


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.
Fichier principal
Vignette du fichier
szathmary07-zart.pdf (172 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00189423 , version 1 (12-12-2007)


  • HAL Id : inria-00189423 , version 1


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. ⟨inria-00189423⟩
245 View
249 Download


Gmail Facebook Twitter LinkedIn More