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 metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00189423
Contributor : Laszlo Szathmary <>
Submitted on : Wednesday, December 12, 2007 - 7:00:03 AM
Last modification on : Thursday, January 11, 2018 - 6:19:54 AM
Long-term archiving on : Monday, April 12, 2010 - 2:54:12 AM

File

szathmary07-zart.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00189423⟩

Share

Metrics

Record views

432

Files downloads

335