Back to Search Start Over

ZART: A Multifunctional Itemset Mining Algorithm

Authors :
Szathmary, Laszlo
Napoli, Amedeo
Kuznetsov, Sergei
Knowledge representation, reasonning (ORPAILLEUR)
INRIA Lorraine
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA)
Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
Department of Applied Mathematics - State University Higher School of Economics
State University Higher School of Economics
Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)
Source :
[Research Report] 2006, pp.19, 5th International Conference on Concept Lattices and Their Applications (CLA '07), 5th International Conference on Concept Lattices and Their Applications (CLA '07), Oct 2007, Montpellier, France. pp.26--37
Publication Year :
2006
Publisher :
HAL CCSD, 2006.

Abstract

Site de la conférence : http://www.lirmm.fr/cla07/; International audience; 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.

Details

Language :
English
Database :
OpenAIRE
Journal :
[Research Report] 2006, pp.19, 5th International Conference on Concept Lattices and Their Applications (CLA '07), 5th International Conference on Concept Lattices and Their Applications (CLA '07), Oct 2007, Montpellier, France. pp.26--37
Accession number :
edsair.dedup.wf.001..49be324e8ca1148e03f5ffba10c0f98e