Search Results for author: Benjamin Paaßen

Found 14 papers, 5 papers with code

Fairness in KI-Systemen

no code implementations17 Jul 2023 Janine Strotherm, Alissa Müller, Barbara Hammer, Benjamin Paaßen

We explain the main fairness definitions and strategies for achieving fairness using concrete examples and place fairness research in the European context.

Fairness

Automatic Creativity Measurement in Scratch Programs Across Modalities

no code implementations7 Nov 2022 Anastasia Kovalkov, Benjamin Paaßen, Avi Segal, Niels Pinkwart, Kobi Gal

Promoting creativity is considered an important goal of education, but creativity is notoriously hard to measure. In this paper, we make the journey fromdefining a formal measure of creativity that is efficientlycomputable to applying the measure in a practical domain.

An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs

1 code implementation26 Jul 2021 Benjamin Paaßen

The unordered tree edit distance is a natural metric to compute distances between trees without intrinsic child order, such as representations of chemical molecules.

Reservoir Stack Machines

1 code implementation4 May 2021 Benjamin Paaßen, Alexander Schulz, Barbara Hammer

In this paper, we introduce the reservoir stack machine, a model which can provably recognize all deterministic context-free languages and circumvents the training problem by training only the output layer of a recurrent net and employing auxiliary information during training about the desired interaction with a stack.

Reservoir Memory Machines as Neural Computers

1 code implementation14 Sep 2020 Benjamin Paaßen, Alexander Schulz, Terrence C. Stewart, Barbara Hammer

Differentiable neural computers extend artificial neural networks with an explicit memory without interference, thus enabling the model to perform classic computation tasks such as graph traversal.

Adversarial Edit Attacks for Tree Data

no code implementations25 Aug 2019 Benjamin Paaßen

Many machine learning models can be attacked with adversarial examples, i. e. inputs close to correctly classified examples that are classified incorrectly.

Embeddings and Representation Learning for Structured Data

no code implementations15 May 2019 Benjamin Paaßen, Claudio Gallicchio, Alessio Micheli, Alessandro Sperduti

Performing machine learning on structured data is complicated by the fact that such data does not have vectorial form.

BIG-bench Machine Learning Decoder +2

Dynamic fairness - Breaking vicious cycles in automatic decision making

no code implementations1 Feb 2019 Benjamin Paaßen, Astrid Bunge, Carolin Hainke, Leon Sindelar, Matthias Vogelsang

We establish a theoretic model in which even perfectly accurate classifiers which adhere to almost all common fairness definitions lead to stable long-term inequalities due to vicious cycles.

BIG-bench Machine Learning Decision Making +1

Tree Edit Distance Learning via Adaptive Symbol Embeddings

no code implementations ICML 2018 Benjamin Paaßen, Claudio Gallicchio, Alessio Micheli, Barbara Hammer

Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart.

Metric Learning

Tree Edit Distance Learning via Adaptive Symbol Embeddings: Supplementary Materials and Results

no code implementations18 May 2018 Benjamin Paaßen

Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart.

Metric Learning

The Continuous Hint Factory - Providing Hints in Vast and Sparsely Populated Edit Distance Spaces

no code implementations22 Aug 2017 Benjamin Paaßen, Barbara Hammer, Thomas William Price, Tiffany Barnes, Sebastian Gross, Niels Pinkwart

In particular, we extend the Hint Factory by considering data of past students in all states which are similar to the student's current state and creating hints approximating the weighted average of all these reference states.

Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces

1 code implementation21 Apr 2017 Benjamin Paaßen, Christina Göpfert, Barbara Hammer

We propose to phrase time series prediction as a regression problem and apply dissimilarity- or kernel-based regression techniques, such as 1-nearest neighbor, kernel regression and Gaussian process regression, which can be applied to graphs via graph kernels.

Distributed Computing Gaussian Processes +3

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