no code implementations • 2 May 2024 • Mohammad Abdulla, Johannes Hirth, Gerd Stumme
We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice.
no code implementations • 25 Apr 2024 • Claude Draude, Dominik Dürrschnabel, Johannes Hirth, Viktoria Horn, Jonathan Kropf, Jörn Lamla, Gerd Stumme, Markus Uhlmann
With our work, we contribute towards a qualitative analysis of the discourse on controversies in online news media.
no code implementations • 13 Jul 2023 • Gerd Stumme, Dominik Dürrschnabel, Tom Hanika
One reason for this is the limited availability of computational resources in the last century that would have been required for ordinal computations.
no code implementations • 17 Apr 2023 • Johannes Hirth, Viktoria Horn, Gerd Stumme, Tom Hanika
Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales.
no code implementations • 10 Apr 2023 • Johannes Hirth, Viktoria Horn, Gerd Stumme, Tom Hanika
Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge.
no code implementations • 6 Apr 2023 • Dominik Dürrschnabel, Gerd Stumme
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i. e., a part of the dataset that corresponds to a linear order.
no code implementations • 19 Feb 2023 • Dominik Dürrschnabel, Gerd Stumme
Based on such an ordinal factorization, we provide a way to discover and explain relationships between different items and attributes in the dataset.
1 code implementation • 18 Nov 2022 • Dominik Dürrschnabel, Tom Hanika, Gerd Stumme
Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs.
no code implementations • 31 May 2022 • Maximilian Felde, Gerd Stumme
In this paper we present an extension of attribute exploration that allows for a group of domain experts and explores their shared views.
no code implementations • 25 Apr 2022 • Bastian Schäfermeier, Gerd Stumme, Tom Hanika
Hence, we propose a principled approach for \emph{mapping research trajectories}, which is applicable to all kinds of scientific entities that can be represented by sets of published papers.
no code implementations • 21 Sep 2021 • Bastian Schäfermeier, Gerd Stumme, Tom Hanika
Selecting the best scientific venue (i. e., conference/journal) for the submission of a research article constitutes a multifaceted challenge.
1 code implementation • 3 Sep 2021 • Maximilian Stubbemann, Gerd Stumme
The automatic verification of document authorships is important in various settings.
no code implementations • 21 Jun 2021 • Dominik Dürrschnabel, Maren Koyda, Gerd Stumme
One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties.
no code implementations • 17 Jun 2021 • Bastian Schaefermeier, Gerd Stumme, Tom Hanika
The ubiquitous presence of WiFi access points and mobile devices capable of measuring WiFi signal strengths allow for real-world applications in indoor localization and mapping.
1 code implementation • 4 Feb 2021 • Dominik Dürrschnabel, Gerd Stumme
Order diagrams allow human analysts to understand and analyze structural properties of ordered data.
Computational Geometry Combinatorics 68R10, 06A07 G.2.2
no code implementations • 4 Feb 2021 • Maximilian Felde, Gerd Stumme
In this paper we present triadic exploration based on Triadic Concept Analysis to explore conditional attribute implications in a triadic domain.
no code implementations • 23 Oct 2020 • Bastian Schäfermeier, Gerd Stumme, Tom Hanika
In this task, researchers can be supported by automated publication analysis.
no code implementations • 23 Aug 2019 • Maximilian Felde, Gerd Stumme
However, there is up to now no theory that models the interaction of multiple experts for the task of attribute exploration with incomplete knowledge.
1 code implementation • 22 Jul 2019 • Maximilian Stubbemann, Tom Hanika, Gerd Stumme
Notably, metric sets of items inclosed in knowledge graphs.
no code implementations • 16 May 2019 • Tom Hanika, Marek Herde, Jochen Kuhn, Jan Marco Leimeister, Paul Lukowicz, Sarah Oeste-Reiß, Albrecht Schmidt, Bernhard Sick, Gerd Stumme, Sven Tomforde, Katharina Anna Zweig
The field of collaborative interactive learning (CIL) aims at developing and investigating the technological foundations for a new generation of smart systems that support humans in their everyday life.
no code implementations • 2 Mar 2019 • Dominik Dürrschnabel, Tom Hanika, Gerd Stumme
Concept lattice drawings are an important tool to visualize complex relations in data in a simple manner to human readers.
no code implementations • 3 Feb 2019 • Tom Hanika, Maximilian Marx, Gerd Stumme
Knowledge graphs have recently become the state-of-the-art tool for representing the diverse and complex knowledge of the world.
no code implementations • 20 Dec 2018 • Tom Hanika, Maren Koyda, Gerd Stumme
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task.
no code implementations • 19 Sep 2018 • Bastian Schäfermeier, Tom Hanika, Gerd Stumme
For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator.
no code implementations • 15 May 2018 • Tom Hanika, Friedrich Martin Schneider, Gerd Stumme
This work summarizes the first attempt to provide a computationally feasible method for measuring the extent of dimension curse present in a data set with respect to a particular class machine of learning procedures.
no code implementations • 24 Jan 2018 • Tom Hanika, Friedrich Martin Schneider, Gerd Stumme
The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension.
no code implementations • 14 Dec 2017 • Mark Kibanov, Martin Becker, Juergen Mueller, Martin Atzmueller, Andreas Hotho, Gerd Stumme
This paper proposes an adaptive kNN classifier where k is chosen dynamically for each instance (point) to be classified, such that the expected accuracy of classification is maximized.
no code implementations • 17 Jun 2016 • Juergen Mueller, Gerd Stumme
Much attention has been given to the task of gender inference of Twitter users.