Search Results for author: Jan Van den Bussche

Found 9 papers, 0 papers with code

Learning Graph Neural Networks using Exact Compression

no code implementations28 Apr 2023 Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche, Stijn Vansummeren

Graph Neural Networks (GNNs) are a form of deep learning that enable a wide range of machine learning applications on graph-structured data.

On the expressive power of message-passing neural networks as global feature map transformers

no code implementations17 Mar 2022 Floris Geerts, Jasper Steegmans, Jan Van den Bussche

We investigate the power of message-passing neural networks (MPNNs) in their capacity to transform the numerical features stored in the nodes of their input graphs.

Shape Fragments

no code implementations22 Dec 2021 Thomas Delva, Anastasia Dimou, Maxime Jakubowski, Jan Van den Bussche

In this paper, (i) we define our extraction mechanism formally, building on recently proposed SHACL formalizations; (ii) we establish correctness properties, which relate shape fragments to notions of provenance for database queries; (iii) we compare shape fragments with SPARQL queries; (iv) we discuss implementation options; and (v) we present initial experiments demonstrating that shape fragments are a feasible new idea.

Learning with Value-Ramp

no code implementations12 Aug 2016 Tom J. Ameloot, Jan Van den Bussche

We study a learning principle based on the intuition of forming ramps.

On the convergence of cycle detection for navigational reinforcement learning

no code implementations27 Nov 2015 Tom J. Ameloot, Jan Van den Bussche

We prove convergence of a cycle-detection learning algorithm on a class of tasks that we call reducible.

Navigate reinforcement-learning +1

Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors

no code implementations21 Feb 2015 Tom J. Ameloot, Jan Van den Bussche

Each monotone-regular behavior can be implemented by a positive neural network with a delay of one time unit.

On the satisfiability problem for SPARQL patterns

no code implementations5 Jun 2014 Xiaowang Zhang, Jan Van den Bussche, François Picalausa

The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1. 0 is comparable with that of the relational algebra.

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