Doubly-lexical order supports standardisation and recursive partitioning of formal context

DOI10.1007/978-3-031-35949-1_2OpenAlexW4383220615MaRDI QIDQ6148088

Tim R. Pattison, Aryan Nataraja

Publication date: 11 January 2024

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

Full work available at URL: https://doi.org/10.1007/978-3-031-35949-1_2

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
• Doubly lexical ordering of dense 0--1 matrices
• A local approach to concept generation
• Two Basic Algorithms in Concept Analysis
• Dismantlable Lattices in the Mirror
• Totally Balanced Formal Context Representation

This page was built for publication: Doubly-lexical order supports standardisation and recursive partitioning of formal context