2 code implementations • 29 Sep 2023 • Sascha Marton, Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
Our method combines axis-aligned splits, which is a useful inductive bias for tabular data, with the flexibility of gradient-based optimization.
no code implementations • 1 Sep 2023 • Patrick Betz, Stefan Lüdtke, Christian Meilicke, Heiner Stuckenschmidt
Rule learning approaches for knowledge graph completion are efficient, interpretable and competitive to purely neural models.
no code implementations • 7 Aug 2023 • Stefan Lüdtke, Maria E. Pierce
The accurate assessment of fish stocks is crucial for sustainable fisheries management.
1 code implementation • 5 May 2023 • Sascha Marton, Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
Decision Trees (DTs) are commonly used for many machine learning tasks due to their high degree of interpretability.
no code implementations • 25 Jan 2023 • Nils Wilken, Lea Cohausz, Johannes Schaum, Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
Furthermore, we show that the utilized planning landmark based approach, which was so far only evaluated on artificial benchmark domains, achieves also good recognition performance when applied to a real-world cooking scenario.
no code implementations • 13 Jan 2023 • Nils Wilken, Lea Cohausz, Johannes Schaum, Stefan Lüdtke, Heiner Stuckenschmidt
We empirically show that the proposed extension not only outperforms the purely planning-based- and purely data-driven goal recognition methods but is also able to recognize the correct goal more reliably, especially when only a small number of observations were seen.
no code implementations • 18 Jul 2022 • Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
Existing methods are based on beam search in the space of feature subsets.
no code implementations • 18 Jul 2022 • Maximilian Popko, Sebastian Bader, Stefan Lüdtke, Thomas Kirste
We propose to identify such segments of similar behavior via clustering the distributions of annotations of the time segments.
1 code implementation • 10 Jun 2022 • Sascha Marton, Stefan Lüdtke, Christian Bartelt, Andrej Tschalzev, Heiner Stuckenschmidt
We consider generating explanations for neural networks in cases where the network's training data is not accessible, for instance due to privacy or safety issues.
no code implementations • 1 Feb 2022 • Timon Felske, Stefan Lüdtke, Sebastian Bader, Thomas Kirste
We study sensor-based human activity recognition in manual work processes like assembly tasks.
no code implementations • 28 Oct 2021 • Stefan Lüdtke, Fernando Moya Rueda, Waqas Ahmed, Gernot A. Fink, Thomas Kirste
Here, we show how such context information can be integrated systematically into a deep neural network-based HAR system.
1 code implementation • 11 Oct 2021 • Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
On the other hand, mixtures of exchangeable variable models (MEVMs) are a class of tractable probabilistic models that make use of exchangeability of discrete random variables to render inference tractable.
no code implementations • 18 Apr 2018 • Stefan Lüdtke, Max Schröder, Frank Krüger, Sebastian Bader, Thomas Kirste
Furthermore, we provide new high-level categories that classify the approaches, based on common properties of the approaches.
no code implementations • 31 Jan 2018 • Stefan Lüdtke, Max Schröder, Sebastian Bader, Kristian Kersting, Thomas Kirste
We present a model for exact recursive Bayesian filtering based on lifted multiset states.
no code implementations • 20 Jul 2017 • Max Schröder, Stefan Lüdtke, Sebastian Bader, Frank Krüger, Thomas Kirste
We sketch a novel inference algorithm that provides a solution by incorporating concepts from Lifted Inference algorithms, Probabilistic Multiset Rewriting Systems, and Computational State Space Models.