10 citations · 12 across the 4 of their papers we have counts for
5 papers
Factorizing Lattices by Interval Relations
Maren Koyda, Gerd Stumme
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relatio…
Interval-Dismantling for Lattices
Maximilian Felde, Maren Koyda
Dismantling allows for the removal of elements of a set, or in our case lattice, without disturbing the remaining structure. In this paper we have extended the notion of dismantlin…
Attribute Selection using Contranominal Scales
Dominik Dürrschnabel, Maren Koyda, Gerd Stumme
Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the i…
Boolean Substructures in Formal Concept Analysis
Maren Koyda, Gerd Stumme
It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only if the context contains an n-dimensional contra-nominal scale as subcontext. In this wor…
Relevant Attributes in Formal Contexts
Tom Hanika, Maren Koyda, Gerd Stumme
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random s…