Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation

DOI10.1007/s10472-014-9418-6zbMath1319.68241OpenAlexW2058708440MaRDI QIDQ2254614

Amedeo Napoli, Alain Gutierrez, Anne Berry, Alain Sigayret, Marianne Huchard

Publication date: 5 February 2015

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

Full work available at URL: https://hal.inria.fr/hal-01101144/file/berry-etal-amai72-2014%20%281%29.pdf

zbMATH Keywords

graph theoryorderlatticesordered algebraic structures

Mathematics Subject Classification ID

Partial orders, general (06A06) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Complete lattices, completions (06B23)

Related Items (5)

Scalable Visual Analytics in FCA ⋮ Discovery of link keys in resource description framework datasets based on pattern structures ⋮ Doubly-lexical order supports standardisation and recursive partitioning of formal context ⋮ A hybrid and exploratory approach to knowledge discovery in metabolomic data ⋮ Towards interactive transition from AOC poset to concept lattice

Uses Software

• Hermes
• Concept Explorer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational concept analysis: mining concept lattices from multi-relational data
• Matrix multiplication via arithmetic progressions
• Efficient graph representations
• From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
• Doubly lexical ordering of dense 0--1 matrices
• A local approach to concept generation
• Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
• Performances of Galois Sub-hierarchy-building Algorithms
• Doubly Lexical Orderings of Matrices
• Three Partition Refinement Algorithms
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• A Set-Theoretical Approach for the Induction of Inheritance Hierarchies
• Rough Sets and Current Trends in Computing
• KI 2004: Advances in Artificial Intelligence
• Formal Concept Analysis
• KI 2003: Advances in Artificial Intelligence

This page was built for publication: Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation