Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Laszlo Szathmary Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2007 - 7:00:03 AM
Last modification on : Thursday, January 20, 2022 - 5:26:44 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:54:12 AM


Files produced by the author(s)


  • HAL Id : inria-00189423, version 1



Laszlo Szathmary, Amedeo Napoli, Sergei 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⟩



Record views


Files downloads