A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

DOI10.1007/S10472-013-9372-8MaRDI QIDQ2248536zbMATH OpenOpenAlexFDO

Authors László Szathmáry, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov, 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

zbMATH Keywords

compound algorithmformal concept analysisfrequent generatorfrequent itemsethypergraphpattern mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 2112391
• Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
• Construction efficace du treillis des motifs fermés fréquents et extraction simultanée des bases génériques de règles
• A new algorithm for mining frequent closed patterns in gene expression data sets
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures

Cites work

• An incremental concept formation approach for learning from databases
• Computing iceberg concept lattices with Titanic
• Constraint-Based Mining and Inductive Databases
• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1934545 (Why is no real title available?)
• scientific article; zbMATH DE number 1943768 (Why is no real title available?)
• scientific article; zbMATH DE number 2016086 (Why is no real title available?)
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice

Cited in

(6)

• Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
• Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
• Formal Concept Analysis and Extensions for Complex Data Analytics
• Formal concept analysis: from knowledge discovery to knowledge processing
• Extracting attribute implications from a formal context: unifying the basic approaches
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures

Describes a project that uses

Uses Software

• CLOSET
• LCM

This page was built for publication: A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248536)