Search Results for author: Heiner Stuckenschmidt

Found 31 papers, 10 papers with code

Towards Log-Linear Logics with Concrete Domains

no code implementations9 Jul 2015 Melisachew Wudage Chekol, Jakob Huber, Heiner Stuckenschmidt

We present $\mathcal{MEL}^{++}$ (M denotes Markov logic networks) an extension of the log-linear description logics $\mathcal{EL}^{++}$-LL with concrete domains, nominals, and instances.

Political Text Scaling Meets Computational Semantics

2 code implementations12 Apr 2019 Federico Nanni, Goran Glavas, Ines Rehbein, Simone Paolo Ponzetto, Heiner Stuckenschmidt

During the last fifteen years, automatic text scaling has become one of the key tools of the Text as Data community in political science.

feature selection

A Variational-Sequential Graph Autoencoder for Neural Architecture Performance Prediction

1 code implementation11 Dec 2019 David Friede, Jovita Lukasik, Heiner Stuckenschmidt, Margret Keuper

In computer vision research, the process of automating architecture engineering, Neural Architecture Search (NAS), has gained substantial interest.

Neural Architecture Search

Neural Architecture Performance Prediction Using Graph Neural Networks

no code implementations19 Oct 2020 Jovita Lukasik, David Friede, Heiner Stuckenschmidt, Margret Keuper

In computer vision research, the process of automating architecture engineering, Neural Architecture Search (NAS), has gained substantial interest.

Neural Architecture Search

Knowledge Graphs meet Moral Values

1 code implementation Joint Conference on Lexical and Computational Semantics 2020 Ioana Hulpu{\textcommabelow{s}}, Jonathan Kobbe, Heiner Stuckenschmidt, Graeme Hirst

Operationalizing morality is crucial for understanding multiple aspects of society that have moral values at their core {--} such as riots, mobilizing movements, public debates, etc.

Knowledge Graphs

xRAI: Explainable Representations through AI

no code implementations10 Dec 2020 Christiann Bartelt, Sascha Marton, Heiner Stuckenschmidt

The approach is based on the idea of training a so-called interpretation network that receives the weights and biases of the trained network as input and outputs the numerical representation of the function the network was supposed to learn that can be directly translated into a symbolic representation.

Decision Making

Exchangeability-Aware Sum-Product Networks

1 code implementation11 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.

Explaining Neural Networks without Access to Training Data

1 code implementation10 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.

Investigating the Combination of Planning-Based and Data-Driven Methods for Goal Recognition

no code implementations13 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.

Leveraging Planning Landmarks for Hybrid Online Goal Recognition

no code implementations25 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.

Intrusion Detection

GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent

1 code implementation5 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.

Binary Classification

Planning Landmark Based Goal Recognition Revisited: Does Using Initial State Landmarks Make Sense?

no code implementations27 Jun 2023 Nils Wilken, Lea Cohausz, Christian Bartelt, Heiner Stuckenschmidt

In this paper, we show that it does not provide any benefit to use landmarks that are part of the initial state in a planning landmark based goal recognition approach.

Intrusion Detection

Learning Disentangled Discrete Representations

1 code implementation26 Jul 2023 David Friede, Christian Reimers, Heiner Stuckenschmidt, Mathias Niepert

Recent successes in image generation, model-based reinforcement learning, and text-to-image generation have demonstrated the empirical advantages of discrete latent representations, although the reasons behind their benefits remain unclear.

Model-based Reinforcement Learning Model Selection +1

On the Aggregation of Rules for Knowledge Graph Completion

no code implementations1 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.

Knowledge Graph Completion

GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data

2 code implementations29 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.

PGTNet: A Process Graph Transformer Network for Remaining Time Prediction of Business Process Instances

1 code implementation9 Apr 2024 Keyvan Amiri Elyasi, Han van der Aa, Heiner Stuckenschmidt

We present PGTNet, an approach that transforms event logs into graph datasets and leverages graph-oriented data for training Process Graph Transformer Networks to predict the remaining time of business process instances.

Unsupervised stance detection for arguments from consequences

no code implementations EMNLP 2020 Jonathan Kobbe, Ioana Hulpu{\textcommabelow{s}}, Heiner Stuckenschmidt

To address this limitation, we propose a topic independent approach that focuses on a frequently encountered class of arguments, specifically, on arguments from consequences.

Stance Detection

Come hither or go away? Recognising pre-electoral coalition signals in the news

no code implementations EMNLP 2021 Ines Rehbein, Simone Paolo Ponzetto, Anna Adendorf, Oke Bahnsen, Lukas Stoetzer, Heiner Stuckenschmidt

In this paper, we introduce the task of political coalition signal prediction from text, that is, the task of recognizing from the news coverage leading up to an election the (un)willingness of political parties to form a government coalition.

Multi-Task Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.