A fast algorithm for building lattices

DOI10.1016/S0020-0190(99)00108-8zbMath0998.06005OpenAlexW2123736436MaRDI QIDQ1606994

Olivier Raynaud, Lhouari Nourine

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00108-8

zbMATH Keywords

algorithmcovering graph of a lattice

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Complete lattices, completions (06B23)

Related Items (37)

Complexity of learning in concept lattices from positive and negative examples ⋮ A robustness measure of the configuration of multi-purpose machines ⋮ Representing a concept lattice by a graph ⋮ On Independent Sets and Bicliques in Graphs ⋮ A local approach to concept generation ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ Representing lattices using many-valued relations ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ On Dualization over Distributive Lattices ⋮ On independent sets and bicliques in graphs ⋮ Granule description with undetermined values in a three-way epistemic perspective ⋮ Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints ⋮ Associative models for storing and retrieving concept lattices ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ Applying relation algebra and RelView to solve problems on orders and lattices ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices ⋮ Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ A fast attribute reduction method for large formal decision contexts ⋮ A heuristic knowledge-reduction method for decision formal contexts ⋮ Reducing one class of machine learning algorithms to logical operations of plausible reasoning ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ Comparing performance of algorithms for generating concept lattices ⋮ A fast incremental algorithm for building lattices ⋮ Unnamed Item ⋮ Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Confluent Hasse Diagrams ⋮ Three-way dual concept analysis ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams ⋮ GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH

Cites Work

• Lattice model of browsable data spaces
• Computing on-line the lattice of maximal antichains of posets
• Tree structure for distributive lattices and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast algorithm for building lattices