scientific article; zbMATH DE number 4160798

MaRDI QIDQ3487400zbMATH OpenFDO

Authors Alain Guénoche

Publication date 1990

Full work available at URL http://www.numdam.org/item?id=MSH_1990__109__41_0, https://eudml.org/doc/94390

zbMATH Keywords

algorithmssurveyGalois lattice of a binary relation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Recommendations

• scientific article; zbMATH DE number 4016967
• A fast algorithm for building lattices
• A fast incremental algorithm for building lattices
• Representing a concept lattice by a graph
• A Linear Delay Algorithm for Building Concept Lattices

Cited in

(10)

• The conceptual weak hierarchy associated with a dissimilarity measure
• Performances of Galois Sub-hierarchy-building Algorithms
• Concept lattices and conceptual knowledge systems
• Galois lattice as a framework to specify building class hierarchies algorithms
• Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
• Maximal and stochastic Galois lattices
• Latticial structures in data analysis.
• Mathematical aspects of concept analysis
• A formal method for inheritance graph hierarchy construction
• scientific article; zbMATH DE number 4016967 (Why is no real title available?)

This page was built for publication:

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