Totally Balanced Formal Context Representation

DOI10.1007/978-3-319-19545-2_11MaRDI QIDQ5255656zbMATH OpenOpenAlexFDO

Authors François Brucker, Pascal Préa

Publication date 16 June 2015

Published in Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19545-2_11

zbMATH Keywords

formal concept analysisgraphical representationdismantlable latticestotally balanced matrices

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• On the representation of context
• scientific article; zbMATH DE number 5070000
• scientific article; zbMATH DE number 1755766
• Publication:4892191
• Combinatorial Pattern Matching
• A simple optimal representation for balanced parentheses
• Automated Deduction – CADE-20
• Context and logical form
• scientific article; zbMATH DE number 3876576

Cites work

• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• A characterization of totally balanced hypergraphs
• Characterizations of totally balanced matrices
• Crown-free lattices and their related graphs
• Doubly lexical ordering of dense 0--1 matrices
• Efficient graph representations
• Lattices with Doubly Irreducible Elements
• Parsimonious cluster systems
• Weak hierarchies associated with similarity measures - An additive clustering technique

Cited in

(4)

• Doubly-lexical order supports standardisation and recursive partitioning of formal context
• Binary set systems and totally balanced hypergraphs
• Totally balanced dissimilarities
• A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis

This page was built for publication: Totally Balanced Formal Context Representation

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