Totally Balanced Formal Context Representation

DOI10.1007/978-3-319-19545-2_11zbMATH Open1312.68182OpenAlexW2181812659MaRDI QIDQ5255656FDOQ5255656

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)

Cites Work

• Title not available (Why is that?)
• Efficient graph representations
• Doubly lexical ordering of dense 0--1 matrices
• Characterizations of totally balanced matrices
• Title not available (Why is that?)
• Lattices with Doubly Irreducible Elements
• Title not available (Why is that?)
• A characterization of totally balanced hypergraphs
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Parsimonious cluster systems
• Crown-free lattices and their related graphs

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

   Recommendations

• On the representation of context 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Combinatorial Pattern Matching 👍 👎
• A simple optimal representation for balanced parentheses 👍 👎
• Automated Deduction – CADE-20 👍 👎
• Context and logical form 👍 👎
• Title not available (Why is that?) 👍 👎

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)