Demo Data from EDBT 2026 / reviewers in the wild / expert
Boris P. Hejblum
dblp:165/1372
· DBLP profile ↗
9ranked-venue papers
1as first author
5since 2021 · last 2026
0000-0003-0646-452XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 7 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 50% Medical and health informatics · 38% Computational science and engineering · 12% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 77% Time series and sequential data · 23% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › recurrent neural network
reservoir computing |
0.8 | 1 | 2024 | Reservoir Computing for Short High-Dimensional Time Series: an Application to SARS-CoV-2 Hospitalization Forecast · ICML 2024 |
Medical and health informatics › public health › public health informatics
epidemic forecasting |
0.8 | 1 | 2024 | Reservoir Computing for Short High-Dimensional Time Series: an Application to SARS-CoV-2 Hospitalization Forecast · ICML 2024 |
Bioinformatics and computational biology › biostatistics › statistical bioinformatics
statistical genomics |
0.4 | 1 | 2019 | Benefits of dimension reduction in penalized regression methods for high-dimensional grouped data: a case study in low sample size · Bioinform. 2019 |
Bioinformatics and computational biology
multi-omics data integration |
0.2 | 1 | 2016 | Group and sparse group partial least square approaches applied in genomics context · Bioinform. 2016 |
Computational science and engineering › regression modeling
partial least squares |
0.2 | 1 | 2016 | Group and sparse group partial least square approaches applied in genomics context · Bioinform. 2016 |
Bioinformatics and computational biology
statistical genetics |
0.2 | 1 | 2016 | Group and sparse group partial least square approaches applied in genomics context · Bioinform. 2016 |
Machine learning › Time series and sequential data › time series analysis
time series forecasting |
0.2 | 1 | 2024 | Reservoir Computing for Short High-Dimensional Time Series: an Application to SARS-CoV-2 Hospitalization Forecast · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
transformer · 1.5reservoir computing · 1.5genetic algorithm · 1.5feature selection · 1.5XGBoost · 1.5LSTM · 1.5sparse group lasso · 0.4group lasso · 0.4elastic net · 0.4LASSO · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Gene set analysis for time-to-event outcome: comparison of a new approach based on the generalized Berk-Jones statistic with existing methods in presence of intra gene-set correlationabstractGene set analysis evaluates the collective impact of groups of genes on an outcome of interest, such as disease occurrence. By incorporating biological knowledge through predefined gene sets, this approach enhances the interpretability of results and improves statistical power compared with gene-wise analyses. In the context of time-to-event data, existing methods are limited and fail to account for potentially strong correlations within gene sets. Given the strong performance of the Generalized Berk-Jones (GBJ) statistic, which effectively incorporates correlation within the test statistic, we adapted this method to the time-to-event framework using a Cox model. We then compared its performance with established methods, including the Cauchy, Harmonic Mean, Wald test, global test, and global boost test. We further benchmarked these methods in two different real-world datasets: gliomas and breast cancer. Our proposed method, sGBJ, shows an overcontrol of Type I error, leading to reduced statistical power compared with other methods in numerical studies particularly when the number of genes is greater than or equal to the number of observations. The Wald test and global boost test generally exhibited the highest power, except in very high-correlation settings for the global boost test, while the Wald test could not adjust for confounders in current implementations. Thomas Ferté, Laura Villain, Rodolphe Thiébaut, Boris P. Hejblum |
Briefings Bioinform. | 4 |
| 2024 | Reservoir Computing for Short High-Dimensional Time Series: an Application to SARS-CoV-2 Hospitalization ForecastabstractIn this work, we aimed at forecasting the number of SARS-CoV-2 hospitalized patients at 14 days to help anticipate the bed requirements of a large scale hospital using public data and electronic health records data. Previous attempts led to mitigated performance in this high-dimension setting; we introduce a novel approach to time series forecasting by providing an alternative to conventional methods to deal with high number of potential features of interest (409 predictors). We integrate Reservoir Computing (RC) with feature selection using a genetic algorithm (GA) to gather optimal non-linear combinations of inputs to improve prediction in sample-efficient context. We illustrate that the RC-GA combination exhibits excellent performance in forecasting SARS-CoV-2 hospitalizations. This approach outperformed the use of RC alone and other conventional methods: LSTM, Transformers, Elastic-Net, XGBoost. Notably, this work marks the pioneering use of RC (along with GA) in the realm of short and high-dimensional time series, positioning it as a competitive and innovative approach in comparison to standard methods. Thomas Ferté, Dan Dutartre, Boris P. Hejblum, Romain Griffier, Vianney Jouhet, Rodolphe Thiébaut, Pierrick Legrand, Xavier Hinaut |
ICML | 3 |
| 2021 | EpidemiOptim: A Toolbox for the Optimization of Control Policies in Epidemiological ModelsabstractModeling the dynamics of epidemics helps to propose control strategies based on pharmaceuticaland non-pharmaceutical interventions (contact limitation, lockdown, vaccination,etc). Hand-designing such strategies is not trivial because of the number of possibleinterventions and the difficulty to predict long-term effects. This task can be cast as an optimization problem where state-of-the-art machine learning methods such as deep reinforcement learning might bring significant value. However, the specificity of each domain|epidemic modeling or solving optimization problems|requires strong collaborationsbetween researchers from different fields of expertise. This is why we introduce EpidemiOptim, a Python toolbox that facilitates collaborations between researchers inepidemiology and optimization. EpidemiOptim turns epidemiological models and cost functions into optimization problems via a standard interface commonly used by optimization practitioners (OpenAI Gym). Reinforcement learning algorithms based on QLearning with deep neural networks (DQN) and evolutionary algorithms (NSGA-II) are already implemented. We illustrate the use of EpidemiOptim to find optimal policies fordynamical on-o lockdown control under the optimization of the death toll and economic recess using a Susceptible-Exposed-Infectious-Removed (SEIR) model for COVID-19. Using EpidemiOptim and its interactive visualization platform in Jupyter notebooks, epidemiologists, optimization practitioners and others (e.g. economists) can easily compare epidemiological models, costs functions and optimization algorithms to address important choicesto be made by health decision-makers. Trained models can be explored by experts and non-experts via a web interface. This article is part of the special track on AI and COVID-19. Cédric Colas, Boris P. Hejblum, Sébastien Rouillon, Rodolphe Thiébaut, Pierre-Yves Oudeyer, Clément Moulin-Frier, Mélanie Prague |
J. Artif. Intell. Res. | 2 |
| 2021 | ATLAS: an automated association test using probabilistically linked health records with application to genetic studiesabstractOBJECTIVE: Large amounts of health data are becoming available for biomedical research. Synthesizing information across databases may capture more comprehensive pictures of patient health and enable novel research studies. When no gold standard mappings between patient records are available, researchers may probabilistically link records from separate databases and analyze the linked data. However, previous linked data inference methods are constrained to certain linkage settings and exhibit low power. Here, we present ATLAS, an automated, flexible, and robust association testing algorithm for probabilistically linked data. MATERIALS AND METHODS: Missing variables are imputed at various thresholds using a weighted average method that propagates uncertainty from probabilistic linkage. Next, estimated effect sizes are obtained using a generalized linear model. ATLAS then conducts the threshold combination test by optimally combining P values obtained from data imputed at varying thresholds using Fisher's method and perturbation resampling. RESULTS: In simulations, ATLAS controls for type I error and exhibits high power compared to previous methods. In a real-world genetic association study, meta-analysis of ATLAS-enabled analyses on a linked cohort with analyses using an existing cohort yielded additional significant associations between rheumatoid arthritis genetic risk score and laboratory biomarkers. DISCUSSION: Weighted average imputation weathers false matches and increases contribution of true matches to mitigate linkage error-induced bias. The threshold combination test avoids arbitrarily choosing a threshold to rule a match, thus automating linked data-enabled analyses and preserving power. CONCLUSION: ATLAS promises to enable novel and powerful research studies using linked data to capitalize on all available data sources. Harrison G. Zhang, Boris P. Hejblum, Griffin M. Weber, Nathan P. Palmer, Susanne E. Churchill, Peter Szolovits, Shawn N. Murphy, Katherine P. Liao, Isaac S. Kohane, Tianxi Cai |
J. Am. Medical Informatics Assoc. | 2 |
| 2021 | Automatic phenotyping of electronical health record: PheVis algorithm
Thomas Ferté, Sébastien Cossin, Thierry Schaeverbeke, Thomas Barnetche, Vianney Jouhet, Boris P. Hejblum |
J. Biomed. Informatics | 6 |
| 2019 | Benefits of dimension reduction in penalized regression methods for high-dimensional grouped data: a case study in low sample sizeabstractMOTIVATION: In some prediction analyses, predictors have a natural grouping structure and selecting predictors accounting for this additional information could be more effective for predicting the outcome accurately. Moreover, in a high dimension low sample size framework, obtaining a good predictive model becomes very challenging. The objective of this work was to investigate the benefits of dimension reduction in penalized regression methods, in terms of prediction performance and variable selection consistency, in high dimension low sample size data. Using two real datasets, we compared the performances of lasso, elastic net, group lasso, sparse group lasso, sparse partial least squares (PLS), group PLS and sparse group PLS. RESULTS: Considering dimension reduction in penalized regression methods improved the prediction accuracy. The sparse group PLS reached the lowest prediction error while consistently selecting a few predictors from a single group. AVAILABILITY AND IMPLEMENTATION: R codes for the prediction methods are freely available at https://github.com/SoufianeAjana/Blisar. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Soufiane Ajana, Niyazi Acar, Lionel Bretillon, Boris P. Hejblum, Hélène Jacqmin-Gadda, Cécile Delcourt |
Bioinform. | 4 |
| 2018 | PheProb: probabilistic phenotyping using diagnosis codes to improve power for genetic association studiesabstractObjective: Standard approaches for large scale phenotypic screens using electronic health record (EHR) data apply thresholds, such as ≥2 diagnosis codes, to define subjects as having a phenotype. However, the variation in the accuracy of diagnosis codes can impair the power of such screens. Our objective was to develop and evaluate an approach which converts diagnosis codes into a probability of a phenotype (PheProb). We hypothesized that this alternate approach for defining phenotypes would improve power for genetic association studies. Methods: The PheProb approach employs unsupervised clustering to separate patients into 2 groups based on diagnosis codes. Subjects are assigned a probability of having the phenotype based on the number of diagnosis codes. This approach was developed using simulated EHR data and tested in a real world EHR cohort. In the latter, we tested the association between low density lipoprotein cholesterol (LDL-C) genetic risk alleles known for association with hyperlipidemia and hyperlipidemia codes (ICD-9 272.x). PheProb and thresholding approaches were compared. Results: Among n = 1462 subjects in the real world EHR cohort, the threshold-based p-values for association between the genetic risk score (GRS) and hyperlipidemia were 0.126 (≥1 code), 0.123 (≥2 codes), and 0.142 (≥3 codes). The PheProb approach produced the expected significant association between the GRS and hyperlipidemia: p = .001. Conclusions: PheProb improves statistical power for association studies relative to standard thresholding approaches by leveraging information about the phenotype in the billing code counts. The PheProb approach has direct applications where efficient approaches are required, such as in Phenome-Wide Association Studies. Jennifer A. Sinnott, Fiona Cai, Sheng Yu 0002, Boris P. Hejblum, Chuan Hong, Isaac S. Kohane, Katherine P. Liao |
J. Am. Medical Informatics Assoc. | 4 |
| 2016 | Group and sparse group partial least square approaches applied in genomics contextabstractMOTIVATION: The association between two blocks of 'omics' data brings challenging issues in computational biology due to their size and complexity. Here, we focus on a class of multivariate statistical methods called partial least square (PLS). Sparse version of PLS (sPLS) operates integration of two datasets while simultaneously selecting the contributing variables. However, these methods do not take into account the important structural or group effects due to the relationship between markers among biological pathways. Hence, considering the predefined groups of markers (e.g. genesets), this could improve the relevance and the efficacy of the PLS approach. RESULTS: We propose two PLS extensions called group PLS (gPLS) and sparse gPLS (sgPLS). Our algorithm enables to study the relationship between two different types of omics data (e.g. SNP and gene expression) or between an omics dataset and multivariate phenotypes (e.g. cytokine secretion). We demonstrate the good performance of gPLS and sgPLS compared with the sPLS in the context of grouped data. Then, these methods are compared through an HIV therapeutic vaccine trial. Our approaches provide parsimonious models to reveal the relationship between gene abundance and the immunological response to the vaccine. AVAILABILITY AND IMPLEMENTATION: The approach is implemented in a comprehensive R package called sgPLS available on the CRAN. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Benoit Liquet, Pierre Lafaye de Micheaux, Boris P. Hejblum, Rodolphe Thiébaut |
Bioinform. | 3 |
| 2015 | Time-Course Gene Set Analysis for Longitudinal Gene Expression DataabstractGene set analysis methods, which consider predefined groups of genes in the analysis of genomic data, have been successfully applied for analyzing gene expression data in cross-sectional studies. The time-course gene set analysis (TcGSA) introduced here is an extension of gene set analysis to longitudinal data. The proposed method relies on random effects modeling with maximum likelihood estimates. It allows to use all available repeated measurements while dealing with unbalanced data due to missing at random (MAR) measurements. TcGSA is a hypothesis driven method that identifies a priori defined gene sets with significant expression variations over time, taking into account the potential heterogeneity of expression within gene sets. When biological conditions are compared, the method indicates if the time patterns of gene sets significantly differ according to these conditions. The interest of the method is illustrated by its application to two real life datasets: an HIV therapeutic vaccine trial (DALIA-1 trial), and data from a recent study on influenza and pneumococcal vaccines. In the DALIA-1 trial TcGSA revealed a significant change in gene expression over time within 69 gene sets during vaccination, while a standard univariate individual gene analysis corrected for multiple testing as well as a standard a Gene Set Enrichment Analysis (GSEA) for time series both failed to detect any significant pattern change over time. When applied to the second illustrative data set, TcGSA allowed the identification of 4 gene sets finally found to be linked with the influenza vaccine too although they were found to be associated to the pneumococcal vaccine only in previous analyses. In our simulation study TcGSA exhibits good statistical properties, and an increased power compared to other approaches for analyzing time-course expression patterns of gene sets. The method is made available for the community through an R package. Boris P. Hejblum, Jason Skinner, Rodolphe Thiébaut |
PLoS Comput. Biol. | 1 |