François Delbot
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
François Delbot has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Christophe Picouleau
Conservatoire National des Arts et Métiers, CEDRIC Laboratory Paris France
4 shared publications - Jean-François Pradat-Peyre
University Paris Nanterre
3 shared publications - Thibault Anani
Sorbonne Université CNRS LIP6
3 shared publications - Stéphane Rovedakis
Conservatoire National des Arts et Métiers, CEDRIC Laboratory Paris France
2 shared publications - Valentin Bouquet
Conservatoire National des Arts et Métiers, CEDRIC Laboratory Paris France
2 shared publications François Delbot
U.F.R. SEGMI Nanterre Université 200 av. de la République 92000 Nanterre France
1 shared publication
Latest Publications
- 7 May 2025
- Published by Springer Nature in Annals of Operations Research
- p. 1-12
Partition of graphs with maximum degree ratio
- 7 May 2025
- Published by Springer Nature in Annals of Operations Research
- p. 1-12
Partition of graphs with maximum degree ratio
- 15 September 2024
- Published by Springer Nature
- p. 197-213
An Optimised Version of Differential Evolution Heuristic for Feature Selection
- 15 September 2024
- Published by Springer Nature
- p. 197-213
An Optimised Version of Differential Evolution Heuristic for Feature Selection
- Open Access
Machine Learning and Feature Selection Methods to Predict 1-Year Disease Progression for Amyotrophic Lateral Sclerosis
Background: This study focuses on Amyotrophic Lateral Sclerosis (ALS), a progressive neurodegenerative disease that affects motor neurons. ALS patients suffer from motor weakness, atrophy, spasticity, and difficulties in speaking, swallowing and breathing. Predicting the survival and progression of ALS is essential for optimising patient care, interventions and informed decision-making. Methods: Using the PRO-ACT (Pooled Resource Open-Access ALS Clinical Trials) database and clinical trial data from Exonhit Therapeutics, we applied machine learning techniques to predict disease progression based on ALS Functional Rating Scale (ALSFRS) scores and patient survival over one year of follow-up. Our models were validated through 10-fold cross-validation. Kaplan-Meier estimation was used to cluster patients effectively according to their profiles. To enhance the predictive accuracy of our models, we performed feature selection prior to analysis. Results: Logistic regression combined with feature selection yielded a Balanced Accuracy score of 76% (68.6% to 79.8% in each fold) on validation data and 76.33% on test data. Integrating model results with a Kaplan-Meier estimates, we identified four patient clusters, with a C-Index of 0.81 and an overall log-rank test p-value ≤ 0.0001. Our method demonstrated high accuracy in predicting ALS-FRS score progression at 3 months (RMSE = 2.88 and adjusted R² = 0.784 with random forest). This study showcases the potential of machine learning models to provide significant predictive insights in ALS, enhancing the understanding of disease dynamics and supporting patient care.
Open AccessMachine Learning and Feature Selection Methods to Predict 1-Year Disease Progression for Amyotrophic Lateral Sclerosis
Background: This study focuses on Amyotrophic Lateral Sclerosis (ALS), a progressive neurodegenerative disease that affects motor neurons. ALS patients suffer from motor weakness, atrophy, spasticity, and difficulties in speaking, swallowing and breathing. Predicting the survival and progression of ALS is essential for optimising patient care, interventions and informed decision-making. Methods: Using the PRO-ACT (Pooled Resource Open-Access ALS Clinical Trials) database and clinical trial data from Exonhit Therapeutics, we applied machine learning techniques to predict disease progression based on ALS Functional Rating Scale (ALSFRS) scores and patient survival over one year of follow-up. Our models were validated through 10-fold cross-validation. Kaplan-Meier estimation was used to cluster patients effectively according to their profiles. To enhance the predictive accuracy of our models, we performed feature selection prior to analysis. Results: Logistic regression combined with feature selection yielded a Balanced Accuracy score of 76% (68.6% to 79.8% in each fold) on validation data and 76.33% on test data. Integrating model results with a Kaplan-Meier estimates, we identified four patient clusters, with a C-Index of 0.81 and an overall log-rank test p-value ≤ 0.0001. Our method demonstrated high accuracy in predicting ALS-FRS score progression at 3 months (RMSE = 2.88 and adjusted R² = 0.784 with random forest). This study showcases the potential of machine learning models to provide significant predictive insights in ALS, enhancing the understanding of disease dynamics and supporting patient care.
- Open Access
On the complexity of Dominating Set for graphs with fixed diameter
A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size at most $k$. It is well known that this problem is $\mathsf{NP}$-complete even for claw-free graphs. We give a complexity dichotomy for Dominating Set for the class of claw-free graphs with diameter $d$. We show that the problem is $\mathsf{NP}$-complete for every fixed $d\ge 3$ and polynomial time solvable for $d\le 2$. To prove the case $d=2$, we show that Minimum Maximal Matching can be solved in polynomial time for $2K_2$-free graphs.Open AccessOn the complexity of Dominating Set for graphs with fixed diameter
A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size at most $k$. It is well known that this problem is $\mathsf{NP}$-complete even for claw-free graphs. We give a complexity dichotomy for Dominating Set for the class of claw-free graphs with diameter $d$. We show that the problem is $\mathsf{NP}$-complete for every fixed $d\ge 3$ and polynomial time solvable for $d\le 2$. To prove the case $d=2$, we show that Minimum Maximal Matching can be solved in polynomial time for $2K_2$-free graphs. - 10 June 2022
- Published by Springer Nature
- p. 194-205
Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context
- 10 June 2022
- Published by Springer Nature
- p. 194-205
Experimental Comparison of Metaheuristics for Feature Selection in Machine Learning in the Medical Context
- Open Access
Partition of graphs with maximum degree ratio
Given a graph $G$ and a non trivial partition $(V_1,V_2)$ of its vertex-set, the satisfaction of a vertex $v\in V_i$ is the ratio between the size of it's closed neighborhood in $V_i$ and the size of its closed neighborhood in $G$. The worst ratio over all the vertices defines the quality of the partition. We define $q(G)$ the degree ratio of a graph as the maximum of the worst ratio over all the non trivial partitions. We give bounds and exact values of $q(G)$ for some classes of graphs. We also show some complexity results for the associated optimization or decision problems.Open AccessPartition of graphs with maximum degree ratio
Given a graph $G$ and a non trivial partition $(V_1,V_2)$ of its vertex-set, the satisfaction of a vertex $v\in V_i$ is the ratio between the size of it's closed neighborhood in $V_i$ and the size of its closed neighborhood in $G$. The worst ratio over all the vertices defines the quality of the partition. We define $q(G)$ the degree ratio of a graph as the maximum of the worst ratio over all the non trivial partitions. We give bounds and exact values of $q(G)$ for some classes of graphs. We also show some complexity results for the associated optimization or decision problems. - Open Access
On Minimum Dominating Sets in cubic and (claw,H)-free graphs
Given a graph $G=(V,E)$, $S\subseteq V$ is a dominating set if every $v\in V\setminus S$ is adjacent to an element of $S$. The Minimum Dominating Set problem asks for a dominating set with minimum cardinality. It is well known that its decision version is $NP$-complete even when $G$ is a claw-free graph. We give a complexity dichotomy for the Minimum Dominating Set problem for the class of $(claw, H)$-free graphs when $H$ has at most six vertices. In an intermediate step we show that the Minimum Dominating Set problem is $NP$-complete for cubic graphs.Open AccessOn Minimum Dominating Sets in cubic and (claw,H)-free graphs
Given a graph $G=(V,E)$, $S\subseteq V$ is a dominating set if every $v\in V\setminus S$ is adjacent to an element of $S$. The Minimum Dominating Set problem asks for a dominating set with minimum cardinality. It is well known that its decision version is $NP$-complete even when $G$ is a claw-free graph. We give a complexity dichotomy for the Minimum Dominating Set problem for the class of $(claw, H)$-free graphs when $H$ has at most six vertices. In an intermediate step we show that the Minimum Dominating Set problem is $NP$-complete for cubic graphs.