Improving the performance of Lindig-style algorithms with empty intersections
From MaRDI portal
Publication:2670896
Recommendations
- Making use of empty intersections to improve the performance of CbO-type algorithms
- scientific article; zbMATH DE number 1898282
- Comparing performance of algorithms for generating concept lattices
- Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
- A Linear Delay Algorithm for Building Concept Lattices
Cites work
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- A fast algorithm for building lattices
- Comparing performance of algorithms for generating concept lattices
- Concept Lattices
- Exploiting the potential of concept lattices for information retrieval with credo
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- scientific article; zbMATH DE number 4016967 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 2168560 (Why is no real title available?)
- scientific article; zbMATH DE number 5488086 (Why is no real title available?)
- Lindig’s Algorithm for Concept Lattices over Graded Attributes
- Making use of empty intersections to improve the performance of CbO-type algorithms
This page was built for publication: Improving the performance of Lindig-style algorithms with empty intersections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670896)
