A local approach to concept generation

DOI10.1007/S10472-007-9063-4MaRDI QIDQ2385441zbMATH OpenOpenAlexFDO

Authors Anne Berry, Jean-Paul Bordat, Alain Sigayret

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)

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

Cites work

• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 496231 (Why is no real title available?)
• scientific article; zbMATH DE number 1500572 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• scientific article; zbMATH DE number 3332577 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• A fast algorithm for building lattices
• A partition-based approach towards constructing Galois (concept) lattices
• Algorithmic Aspects of Vertex Elimination on Graphs
• Comparing performance of algorithms for generating concept lattices
• Efficient enumeration of all minimal separators in a graph
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Galois lattice as a framework to specify building class hierarchies algorithms
• Listing all Minimal Separators of a Graph
• Matrix multiplication via arithmetic progressions
• Representing a concept lattice by a graph
• Two basic algorithms in concept analysis

Cited in

(13)

• Doubly-lexical order supports standardisation and recursive partitioning of formal context
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
• Parallel algorithm for computing fixpoints of Galois connections
• scientific article; zbMATH DE number 3904792 (Why is no real title available?)
• Formal Concept Analysis
• 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
• An algorithm for extracting rare concepts with concise intents
• Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer
• Similarity measures in formal concept analysis
• \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data

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)