LinCbO: fast algorithm for computation of the Duquenne-Guigues basis

DOI10.1016/j.ins.2021.04.104zbMath1528.68369arXiv2011.04928OpenAlexW3161546509MaRDI QIDQ6071284

Petr Krajča, Radek Janostik, Jan Konecny

Publication date: 23 November 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.04928

zbMATH Keywords

closuresnon-redundancyattribute implicationsminimalization

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• Minimal bases of temporal attribute implications
• Finding all closed sets: A general approach
• 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
• Closure-based constraints in formal concept analysis
• Attribute dependencies for data with grades I^,
• Comparing performance of algorithms for generating concept lattices
• Closure via functional dependence simplification
• Graded LinClosure and Its Role in Relational Data Analysis

This page was built for publication: LinCbO: fast algorithm for computation of the Duquenne-Guigues basis