A generic algorithm for generating closed sets of a binary relation

DOI10.1007/978-3-540-32262-7_15MaRDI QIDQ5710379zbMATH OpenOpenAlexFDO

Authors Alain Gély

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105806

zbMATH Keywords

Closure operatorGalois or concept latticeGeneration algorithm

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Lattices (06B99) Knowledge representation (68T30)

Recommendations

• About the enumeration algorithms of closed sets
• On the Complexity of Computing Generators of Closed Sets
• Efficient enumeration of solutions produced by closure operations
• scientific article; zbMATH DE number 6829393
• Closures in Binary Partial Algebras

Cited in

(7)

• Enumeration aspects of maximal cliques and bicliques
• Recursive decomposition tree of a Moore co-family and closure algorithm.
• About the enumeration algorithms of closed sets
• Efficient enumeration of solutions produced by closure operations
• On the Complexity of Computing Generators of Closed Sets
• Effective approximation of parametrized closure systems over transactional data streams
• Listing closed sets of strongly accessible set systems with applications to data mining

This page was built for publication: A generic algorithm for generating closed sets of a binary relation

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