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

DOI10.1007/S10472-014-9418-6MaRDI QIDQ2254614zbMATH OpenOpenAlexFDO

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

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 theorylatticesorderordered algebraic structures

Mathematics Subject Classification ID

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

Recommendations

• Algorithms over partially ordered sets
• scientific article; zbMATH DE number 5006801
• scientific article; zbMATH DE number 108280
• A local approach to concept generation
• scientific article; zbMATH DE number 1898282

Cites work

• A local approach to concept generation
• A possibility-theoretic view of formal concept analysis
• A Set-Theoretical Approach for the Induction of Inheritance Hierarchies
• Doubly lexical ordering of dense 0--1 matrices
• Doubly Lexical Orderings of Matrices
• Efficient graph representations
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Formal Concept Analysis
• From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
• Galois lattice as a framework to specify building class hierarchies algorithms
• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 1931756 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• KI 2003: Advances in Artificial Intelligence
• KI 2004: Advances in Artificial Intelligence
• Matrix multiplication via arithmetic progressions
• Performances of Galois Sub-hierarchy-building Algorithms
• Relational concept analysis: mining concept lattices from multi-relational data
• Rough Sets and Current Trends in Computing
• Three Partition Refinement Algorithms

Cited in

(6)

• Towards interactive transition from AOC poset to concept lattice
• A hybrid and exploratory approach to knowledge discovery in metabolomic data
• 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
• Formal concept analysis: from knowledge discovery to knowledge processing

Describes a project that uses

Uses Software

• Hermes
• Concept Explorer

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

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