Ordinal Motifs in Lattices

Johannes Hirth, Viktoria Horn, Gerd Stumme, Tom Hanika
4/10/2023
cs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to retrieve basic meaning from a medium sized ordinal data set.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hirth2023ordinal,
  title  = {Ordinal Motifs in Lattices},
  author = {Johannes Hirth and Viktoria Horn and Gerd Stumme and Tom Hanika},
  year   = {2023},
  eprint = {2304.04827},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.04827v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.04827.svg)](https://codeofpaper.com/paper/2304.04827)

Discussion