Back to Search
Start Over
ZART: A Multifunctional Itemset Mining Algorithm
- 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.
- Subjects :
- association rules
[INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
itemset extraction
frequent generators
data mining
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
itemset mining
frequent closed itemsets
ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.6: Learning
Subjects
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