A local approach to concept generation

DOI10.1007/S10472-007-9063-4zbMATH Open1129.68085OpenAlexW4298075876MaRDI QIDQ2385441FDOQ2385441

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

Recommendations

• Formal Concept Analysis
• From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit
• \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
• A novel building algorithm of concept lattice
• Comparing performance of algorithms for generating concept lattices

zbMATH Keywords

Galois latticeConcept latticeConcept generationMaximal rectangles

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Comparing performance of algorithms for generating concept lattices
• Title not available (Why is that?)
• Matrix multiplication via arithmetic progressions
• Algorithmic Aspects of Vertex Elimination on Graphs
• Efficient enumeration of all minimal separators in a graph
• Listing all Minimal Separators of a Graph
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• A partition-based approach towards constructing Galois (concept) lattices
• Title not available (Why is that?)
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Two Basic Algorithms in Concept Analysis
• Title not available (Why is that?)
• A fast algorithm for building lattices
• Representing a concept lattice by a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Galois lattice as a framework to specify building class hierarchies algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

This page was built for publication: A local approach to concept generation

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