A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
From MaRDI portal
Publication:2248536
DOI10.1007/s10472-013-9372-8zbMath1357.68186OpenAlexW2009254877MaRDI QIDQ2248536
Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov, Laszlo Szathmary, Petko Valtchev
Publication date: 26 June 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.archipel.uqam.ca/8101/1/Makarenkov-Godin-2014a-preprint.pdf
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incremental concept formation approach for learning from databases
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- Computing iceberg concept lattices with Titanic
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Constraint-Based Mining and Inductive Databases
This page was built for publication: A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes