Totally Balanced Formal Context Representation
From MaRDI portal
Publication:5255656
DOI10.1007/978-3-319-19545-2_11zbMath1312.68182OpenAlexW2181812659MaRDI QIDQ5255656
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
Related Items (max. 100)
Binary set systems and totally balanced hypergraphs ⋮ Doubly-lexical order supports standardisation and recursive partitioning of formal context ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Totally balanced dissimilarities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parsimonious cluster systems
- Crown-free lattices and their related graphs
- A characterization of totally balanced hypergraphs
- Weak hierarchies associated with similarity measures - An additive clustering technique
- Efficient graph representations
- Doubly lexical ordering of dense 0--1 matrices
- Characterizations of totally balanced matrices
- Lattices with Doubly Irreducible Elements
This page was built for publication: Totally Balanced Formal Context Representation