A local approach to concept generation

DOI10.1007/s10472-007-9063-4zbMath1129.68085OpenAlexW4298075876MaRDI QIDQ2385441

Anne Berry, Alain Sigayret, Jean-Paul Bordat

Publication date: 12 October 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-007-9063-4

zbMATH Keywords

Galois latticeConcept latticeConcept generationMaximal rectangles

Mathematics Subject Classification ID

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

Related Items

On computing the Galois lattice of bipartite distance hereditary graphs ⋮ Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ Doubly-lexical order supports standardisation and recursive partitioning of formal context ⋮ Parallel algorithm for computing fixpoints of Galois connections ⋮ Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation ⋮ Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer ⋮ Using Formal Concept Analysis for the Extraction of Groups of Co-expressed Genes ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ Similarity measures in formal concept analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Efficient enumeration of all minimal separators in a graph
• A fast algorithm for building lattices
• A partition-based approach towards constructing Galois (concept) lattices
• Representing a concept lattice by a graph
• Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
• Two Basic Algorithms in Concept Analysis
• Algorithmic Aspects of Vertex Elimination on Graphs
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Listing all Minimal Separators of a Graph
• Comparing performance of algorithms for generating concept lattices
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH