My PhD student Anna Louise Latour won the first prize at the ICT Open 2019 conference for the pitch of her PhD thesis. Congratulations!


A new PhD student has joined the lab: Oussama Bouldjedri.



John Aoga, Tias Guns, Siegfried Nijssen, Pierre Schaus (2018): Finding Probabilistic Rule Lists using the Minimum Description Length Principle. In: Discovery Science 21th International Conference, DS 2018, Limassol, Cyprus, October 29–31, 2018, Proceedings

Thomas Bollen, Guillaume Leurquin, Siegfried Nijssen (2018): ConvoMap: Using Convolution to Order Boolean Data. In: Advances in Intelligent Data Analysis XVII - 17th International Symposium, IDA 2018, Proceedings

Anna Latour, Behrouz Babaki, Siegfried Nijssen (2018): Stochastic Constraint Optimization using Propagation on Ordered Binary Decision Diagrams. In: Eight International Workshop on Stochastical Relational AI, StarAI 2018

Florian Demesmaeker, Amine Ghrab, Siegfried Nijssen, Sabri Skhiri (2017): Discovering interesting patterns in large graph cubes. In: Proceedings of the Fourth International Workshop on High Performance Big Graph Data Management, Analysis, and Mining, in conjunction with the 2017 IEEE International Conference on Big Data (IEEE BigData 2017)

More Publications


Some of my software is available online:

  • Implementations of my work with Tias Guns and Luc De Raedt on combining pattern mining and constraint programming can be found here.
  • Implementations of my work with Thanh Le Van and Luc De Raedt on finding patterns in ranked data can be found here.
  • The Gaston graph mining algorithm can be found here. Note: I implemented this program in 2004 and no longer maintain it. The website is maintained only for archival purposes.
  • The implementation of SC-ProbLog can be found in a branch of the ProbLog repository, which can be found here.


I am lecturer for the following courses: