Improving the performance of Lindig-style algorithms with empty intersections

DOI10.1007/978-3-030-86982-3_7zbMath1495.68220OpenAlexW3199326019MaRDI QIDQ2670896

Petr Krajča

Publication date: 1 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86982-3_7

zbMATH Keywords

formal concept analysisconcept latticeHasse diagramformal concepts

Mathematics Subject Classification ID

Knowledge representation (68T30)

Uses Software

• AddIntent
• In-Close

Cites Work

• 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
• A fast algorithm for building lattices
• Making use of empty intersections to improve the performance of CbO-type algorithms
• Lindig’s Algorithm for Concept Lattices over Graded Attributes
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the performance of Lindig-style algorithms with empty intersections