Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis

DOI10.1007/978-3-030-77867-5_6OpenAlexW3173326266MaRDI QIDQ2117120

Jan Konecny, Petr Krajča, Radek Janostik

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77867-5_6

zbMATH Keywords

algorithmDuquenne-Guigues basislinclosureclose-by-one

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (1)

Pruning techniques in lincbo for the computation of the duquenne-guigues basis

Uses Software

• UCI-ml
• LCM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Interface between logical analysis of data and formal concept analysis
• Optimizations in computing the Duquenne-Guigues basis of implications
• Attribute-incremental construction of the canonical implication basis
• Making use of empty intersections to improve the performance of CbO-type algorithms
• Parallel algorithm for computing fixpoints of Galois connections
• Comparison of Data Structures for Computing Formal Concepts
• Discovery Science
• Computations with finite closure systems and implications

This page was built for publication: Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis