Robin Cugny

dblp:276/5043 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0001-9316-0617ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2024 Towards Regional Explanations with Validity Domains for Local Explanations
Robin Cugny, Julien Aligon, Max Chevalier, Geoffrey Roman-Jimenez, Olivier Teste
DaWaK1
2022 AutoXAI: A Framework to Automatically Select the Most Adapted XAI Solution
abstract
A large number of XAI (eXplainable Artificial Intelligence) solutions have been proposed in recent years. Recently, thanks to new XAI evaluation metrics, it has become possible to compare these XAI solutions. However, selecting the most relevant XAI solution among all this diversity is still a tedious task, especially if a user has specific needs and constraints. In this paper, we propose AutoXAI, a framework that recommends the best XAI solution and its hyperparameters according to specified XAI evaluation metrics while considering the user's context (dataset, machine learning model, XAI needs and constraints). It adapts approaches from context-aware recommender systems on one side and strategies of optimization and evaluation from AutoML (Automated Machine Learning) on the other. Through two use cases, we show that AutoXAI recommends XAI solutions adapted to the user's needs with the best hyperparameters matching the user's constraints.
Robin Cugny, Julien Aligon, Max Chevalier, Geoffrey Roman-Jimenez, Olivier Teste
CIKM1
2021 A New Accurate Clustering Approach for Detecting Different Densities in High Dimensional Data
Nabil El Malki, Robin Cugny, Olivier Teste, Franck Ravat
DaWaK2
2020 DECWA: Density-Based Clustering using Wasserstein Distance
abstract
Clustering is a data analysis method for extracting knowledge by discovering groups of data called clusters. Among these methods, state-of-the-art density-based clustering methods have proven to be effective for arbitrary-shaped clusters. Despite their encouraging results, they suffer to find low-density clusters, near clusters with similar densities, and high-dimensional data. Our proposals are a new characterization of clusters and a new clustering algorithm based on spatial density and probabilistic approach. First of all, sub-clusters are built using spatial density represented as probability density function (p.d.f) of pairwise distances between points. A method is then proposed to agglomerate similar sub-clusters by using both their density (p.d.f) and their spatial distance. The key idea we propose is to use the Wasserstein metric, a powerful tool to measure the distance between p.d.f of sub-clusters. We show that our approach outperforms other state-of-the-art density-based clustering methods on a wide variety of datasets.
Nabil El Malki, Robin Cugny, Olivier Teste, Franck Ravat
CIKM2