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

DOI10.1016/j.ins.2022.10.057OpenAlexW4306405953MaRDI QIDQ6125182

Jan Konecny, Petr Krajča, Radek Janostik

Publication date: 11 April 2024

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

Full work available at URL: https://doi.org/10.1016/j.ins.2022.10.057

zbMATH Keywords

algorithmbasispruningattribute implication

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On the complexity of enumerating pseudo-intents
• Some decision and counting problems of the Duquenne-Guigues basis of implications
• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• 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
• Two Basic Algorithms in Concept Analysis
• Two FCA-Based Methods for Mining Gene Expression Data
• Comparing performance of algorithms for generating concept lattices
• Discovery Science
• Formal Concept Analysis

This page was built for publication: Pruning techniques in lincbo for the computation of the duquenne-guigues basis