no code implementations • 25 Mar 2024 • Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar, Helge Spieker
In this article, we introduce the Qualitative Explainable Graph (QXG), which is a unified symbolic and qualitative representation for scene understanding in urban mobility.
1 code implementation • 24 Aug 2023 • Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar, Helge Spieker
The future of automated driving (AD) is rooted in the development of robust, fair and explainable artificial intelligence methods.
no code implementations • 5 Mar 2022 • Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar, Yahia Lebbah, Samir Loudni
On the other hand, several measures are often used to evaluate the interestingness of patterns, with the hope to reveal a ranking that is as close as possible to the user-specific ranking.
no code implementations • 23 Nov 2021 • Mohamed-Bachir Belaid, Arnaud Gotlieb, Nadjib Lazaar
In this paper, we propose Learn&Optimize, a method to solve optimization problems with known objective function and unknown constraint network.
no code implementations • 16 Sep 2021 • Mohamed-Bachir Belaid, Nadjib Lazaar
The problem of discovering frequent itemsets including rare ones has received a great deal of attention.
no code implementations • 4 Dec 2020 • Christian Bessiere, Mohamed-Bachir Belaid, Nadjib Lazaar
Itemset mining is one of the most studied tasks in knowledge discovery.
no code implementations • 14 Mar 2020 • Christian Bessiere, Clement Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh
Learning constraint networks is known to require a number of membership queries exponential in the number of variables.
no code implementations • 31 Dec 2017 • Christian Bessiere, Nadjib Lazaar, Yahia Lebbah, Mehdi Maamar
Discovering significant itemsets is one of the fundamental problems in data mining.
no code implementations • 17 Apr 2016 • Mehdi Maamar, Nadjib Lazaar, Samir Loudni, Yahia Lebbah
Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining.