Maarten Houbraken
Ghent University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Maarten Houbraken.
Natural Computing | 2013
Maarten Houbraken; Sofie Demeyer; Dimitri Staessens; Pieter Audenaert; Didier Colle; Mario Pickavet
Physarum polycephalum, a true slime mould, is a primitive, unicellular organism that creates networks to transport nutrients while foraging. The design of these natural networks proved to be advanced, e.g. the slime mould was able to find the shortest path through a maze. The underlying principles of this design have been mathematically modelled in literature. As in real life the slime mould can design fault tolerant networks, its principles can be applied to the design of man-made networks. In this paper, an existing model and algorithm are adapted and extended with stimulation and migration mechanisms which encourage formation of alternative paths, optimize edge positioning and allow for automated design. The extended model can then be used to better design fault tolerant networks. The extended algorithm is applied to several national and international network configurations. Results show that the extensions allow the model to capture the fault tolerance requirements more accurately. The resulting extended algorithm overcomes weaknesses in geometric graph design and can be used to design fault tolerant networks such as telecommunication networks with varying fault tolerance requirements.
PLOS ONE | 2014
Maarten Houbraken; Sofie Demeyer; Tom Michoel; Pieter Audenaert; Didier Colle; Mario Pickavet
Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA). ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.
intelligent tutoring systems | 2015
Maarten Houbraken; Pieter Audenaert; Didier Colle; Mario Pickavet; Karolien Scheerlinck; I Yperman; Steven Logghe
Applying the current technological possibilities has led to a wide range of traffic monitoring systems. These heterogeneous data sources individually provide a view on the current traffic state, each source having its own properties and (dis)advantages. However, these different sources can be aggregated to create a single traffic state estimation. This paper presents a data fusion algorithm that combines data on the data sample level. The proposed system fuses floating car data with stationary detector data and was implemented on live traffic. Results show the fusion algorithm allows to eliminate individual source bias and alleviates source-specific limitations.
Bioinformatics | 2016
Thomas Van Parys; Ine Melckenbeeck; Maarten Houbraken; Pieter Audenaert; Didier Colle; Mario Pickavet; Piet Demeester; Yves Van de Peer
Summary: We present a Cytoscape app for the ISMAGS algorithm, which can enumerate all instances of a motif in a graph, making optimal use of the motifs symmetries to make the search more efficient. The Cytoscape app provides a handy interface for this algorithm, which allows more efficient network analysis. Availability and Implementation: The Cytoscape app for ISMAGS can be freely downloaded from the Cytoscape App store http://apps.cytoscape.org/apps/ismags. Source code and documentation for ISMAGS are available at https://github.com/biointec/ismags. Source code and documentation for the Cytoscape app are available at https://gitlab.psb.ugent.be/thpar/ISMAGS_Cytoscape. Contacts: [email protected] or [email protected]‐ugent.be Supplementary information: Supplementary data are available at Bioinformatics online.
Journal of Advanced Transportation | 2017
Maarten Houbraken; Steven Logghe; Marco Schreuder; Pieter Audenaert; Didier Colle; Mario Pickavet
The aim of this paper is to demonstrate the feasibility of a live Automated Incident Detection (AID) system using only Floating Car Data (FCD) in one of the first large-scale FCD AID field trials. AID systems detect traffic events and alert upcoming drivers to improve traffic safety without human monitoring. These automated systems traditionally rely on traffic monitoring sensors embedded in the road. FCD allows for finer spatial granularity of traffic monitoring. However, low penetration rates of FCD probe vehicles and the data latency have historically hindered FCD AID deployment. We use a live country-wide FCD system monitoring an estimated 5.93% of all vehicles. An FCD AID system is presented and compared to the installed AID system (using loop sensor data) on 2 different highways in Netherlands. Our results show the FCD AID can adequately monitor changing traffic conditions and follow the AID benchmark. The presented FCD AID is integrated with the road operator systems as part of an innovation project, making this, to the best of our knowledge, the first full chain technical feasibility trial of an FCD-only AID system. Additionally, FCD allows for AID on roads without installed sensors, allowing road safety improvements at low cost.
Transportation Research Part C-emerging Technologies | 2015
Mario Vanlommel; Maarten Houbraken; Pieter Audenaert; Steven Logghe; Mario Pickavet; Philippe De Maeyer
Archive | 2018
Maarten Houbraken
Iet Intelligent Transport Systems | 2018
Maarten Houbraken; Steven Logghe; Pieter Audenaert; Didier Colle; Mario Pickavet
Archive | 2014
Steven Logghe; Wim Vanbelle; I Yperman; Karolien Scheerlinck; Maarten Houbraken; Wim Vandenberghe; Pieter Callewaert; Rijck Bert De; Valck Jens De; Pieter Pauwels; Mario Vanlommel
4th MRP N2N Bioinformatics Symposium | 2014
Maarten Houbraken; Pieter Audenaert; Mario Pickavet