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

DOI10.1007/978-3-030-77867-5_6MaRDI QIDQ2117120zbMATH OpenOpenAlexFDO

Authors Radek Janostik, Jan Konecny, Petr Krajca

Publication date 21 March 2022

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

zbMATH Keywords

algorithmclose-by-oneDuquenne-Guigues basislinclosure

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites work

• Attribute-incremental construction of the canonical implication basis
• Comparison of data structures for computing formal concepts
• Computations with finite closure systems and implications
• Discovery Science
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Interface between logical analysis of data and formal concept analysis
• Making use of empty intersections to improve the performance of CbO-type algorithms
• On the intractability of computing the Duquenne-Guigues base
• Optimizations in computing the Duquenne-Guigues basis of implications
• Parallel algorithm for computing fixpoints of Galois connections

Cited in

(2)

• Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis

Describes a project that uses

Uses Software

• UCI
• LCM

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

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