Maren Koyda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Maren Koyda has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Gerd Stumme
University of Kassel
6 shared publications - Dominik Dürrschnabel
Baden-Wuerttemberg Cooperative State University Mosbach
1 shared publication - Maximilian Felde
University of Kassel
1 shared publication Tom Hanika
University of Kassel
1 shared publication- Tom Hanika
University of Hildesheim
1 shared publication
Latest Publications
- 9 May 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 159
Interval-dismantling for lattices
- 9 May 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 159
Interval-dismantling for lattices
- 9 March 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 157, 70-87
Factorizing lattices by interval relations
- 9 March 2023
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 157, 70-87
Factorizing lattices by interval relations
- Open Access
Factorizing Lattices by Interval Relations
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this purpose and answer the question of finding the finest of those relations to implode a given interval in the generated factor lattice. To overcome the limitations of the factorization based on those relations, we introduce a new lattice factorization that enables the imploding of selected disjoint intervals of a finite lattice. To this end, we propose an interval relation that generates this factorization. To obtain lattices rather than arbitrary ordered sets, we restrict this approach to so-called pure intervals. For our study, we will make use of methods from Formal Concept Analysis (FCA). We will also provide a new FCA construction by introducing the enrichment of an incidence relation by a set of intervals in a formal context, to investigate the approach for lattice-generating interval relations on the context side.
Open AccessFactorizing Lattices by Interval Relations
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this purpose and answer the question of finding the finest of those relations to implode a given interval in the generated factor lattice. To overcome the limitations of the factorization based on those relations, we introduce a new lattice factorization that enables the imploding of selected disjoint intervals of a finite lattice. To this end, we propose an interval relation that generates this factorization. To obtain lattices rather than arbitrary ordered sets, we restrict this approach to so-called pure intervals. For our study, we will make use of methods from Formal Concept Analysis (FCA). We will also provide a new FCA construction by introducing the enrichment of an incidence relation by a set of intervals in a formal context, to investigate the approach for lattice-generating interval relations on the context side.
- 15 September 2021
- Published by Springer Nature
- p. 127-141
Attribute Selection Using Contranominal Scales
- 15 September 2021
- Published by Springer Nature
- p. 127-141
Attribute Selection Using Contranominal Scales
- Open Access
Relevant Attributes in Formal Contexts
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 sampling, parallelization, or attribute extraction. A so far not investigated method in the realm of formal concept analysis is attribute selection, as done in machine learning. Building up on this we introduce a method for attribute selection in formal contexts. To this end, we propose the notion of relevant attributes which enables us to define a relative relevance function, reflecting both the order structure of the concept lattice as well as distribution of objects on it. Finally, we overcome computational challenges for computing the relative relevance through an approximation approach based on information entropy.
Open AccessRelevant Attributes in Formal Contexts
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 sampling, parallelization, or attribute extraction. A so far not investigated method in the realm of formal concept analysis is attribute selection, as done in machine learning. Building up on this we introduce a method for attribute selection in formal contexts. To this end, we propose the notion of relevant attributes which enables us to define a relative relevance function, reflecting both the order structure of the concept lattice as well as distribution of objects on it. Finally, we overcome computational challenges for computing the relative relevance through an approximation approach based on information entropy.