Pierre Geurts

Platelets have been involved in both immune surveillance and host defense against severe infection. To date, whether platelet phenotype or other hemostasis components could be associated with predisposition to sepsis in critical illness remains unknown. The aim of this work was to identify platelet markers that could predict sepsis occurrence in critically ill injured patients. This single-center, prospective, observational, 7-month study was based on a cohort of 99 non-infected adult patients admitted to ICUs for elective cardiac surgery, trauma, acute brain injury, and post-operative prolonged ventilation and followed up during ICU stay. Clinical characteristics and severity score (SOFA) were recorded on admission. Platelet activation markers, including fibrinogen binding to platelets, platelet membrane P-selectin expression, plasma soluble CD40L, and platelet-leukocytes aggregates were assayed by flow cytometry at admission and 48 h later, and then at the time of sepsis diagnosis (Sepsis-3 criteria) and 7 days later for sepsis patients. Hospitalization data and outcomes were also recorded. Of the 99 patients, 19 developed sepsis after a median time of 5 days. These patients had a higher SOFA score at admission; levels of fibrinogen binding to platelets (platelet-Fg) and of D-dimers were also significantly increased compared to the other patients. Levels 48 h after ICU admission no longer differed between the two patient groups. Platelet-Fg % was an independent predictor of sepsis (P = 0.0031). By ROC curve analysis, cutoff point for Platelet-Fg (AUC = 0.75) was 50%. In patients with a SOFA cutoff of 8, the risk of sepsis reached 87% when Platelet-Fg levels were above 50%. Patients with sepsis had longer ICU and hospital stays and higher death rate. Platelet-bound fibrinogen levels assayed by flow cytometry within 24 h of ICU admission help identifying critically ill patients at risk of developing sepsis.

This paper studies the link between resting-state functional connectivity (FC), measured by the correlations of fMRI BOLD time courses, and structural connectivity (SC), estimated through fiber tractography. Instead of a static analysis based on the correlation between SC and FC averaged over the entire fMRI time series, we propose a dynamic analysis, based on the time evolution of the correlation between SC and a suitably windowed FC. Assessing the statistical significance of the time series against random phase permutations, our data show a pronounced peak of significance for time window widths around 20–30 TR (40–60 s). Using the appropriate window width, we show that FC patterns oscillate between phases of high modularity, primarily shaped by anatomy, and phases of low modularity, primarily shaped by inter-network connectivity. Building upon recent results in dynamic FC, this emphasizes the potential role of SC as a transitory architecture between different highly connected resting-state FC patterns. Finally, we show that the regions contributing the most to these whole-brain level fluctuations of FC on the supporting anatomical architecture belong to the default mode and the executive control networks suggesting that they could be capturing consciousness-related processes such as mind wandering.

This paper studies the link between resting-state functional connectivity (FC), measured by the correlations of the fMRI BOLD time courses, and structural connectivity (SC), estimated through fiber tractography. Instead of a static analysis based on the correlation between SC and the FC averaged over the entire fMRI time series, we propose a dynamic analysis, based on the time evolution of the correlation between SC and a suitably windowed FC. Assessing the statistical significance of the time series against random phase permutations, our data show a pronounced peak of significance for time window widths around 20-30 TR (40-60 sec). Using the appropriate window width, we show that FC patterns oscillate between phases of high modularity, primarily shaped by anatomy, and phases of low modularity, primarily shaped by inter-network connectivity. Building upon recent results in dynamic FC, this emphasizes the potential role of SC as a transitory architecture between different highly connected resting state FC patterns. Finally, we show that networks implied in consciousness-related processes, such as the default mode network (DMN), contribute more to these brain-level fluctuations compared to other networks, such as the motor or somatosensory networks. This suggests that the fluctuations between FC and SC are capturing mind-wandering effects.

Networks provide a natural representation of molecular biology knowledge, in particular to model relationships between biological entities such as genes, proteins, drugs, or diseases. Because of the effort, the cost, or the lack of the experiments necessary for the elucidation of these networks, computational approaches for network inference have been frequently investigated in the literature. In this paper, we examine the assessment of supervised network inference. Supervised inference is based on machine learning techniques that infer the network from a training sample of known interacting and possibly non-interacting entities and additional measurement data. While these methods are very effective, their reliable validation in silico poses a challenge, since both prediction and validation need to be performed on the basis of the same partially known network. Cross-validation techniques need to be specifically adapted to classification problems on pairs of objects. We perform a critical review and assessment of protocols and measures proposed in the literature and derive specific guidelines how to best exploit and evaluate machine learning techniques for network inference. Through theoretical considerations and in silico experiments, we analyze in depth how important factors influence the outcome of performance estimation. These factors include the amount of information available for the interacting entities, the sparsity and topology of biological networks, and the lack of experimentally verified non-interacting pairs.

This paper addresses the large-scale acquisition of end-to-end network performance. We made two distinct contributions: ordinal rating of network performance and inference by matrix completion. The former reduces measurement costs and unifies various metrics which eases their processing in applications. The latter enables scalable and accurate inference with no requirement of structural information of the network nor geometric constraints. By combining both, the acquisition problem bears strong similarities to recommender systems. This paper investigates the applicability of various matrix factorization models used in recommender systems. We found that the simple regularized matrix factorization is not only practical but also produces accurate results that are beneficial for peer selection.

Motivation: Univariate statistical tests are widely used for biomarker discovery in bioinformatics. These procedures are simple, fast and their output is easily interpretable by biologists but they can only identify variables that provide a significant amount of information in isolation from the other variables. As biological processes are expected to involve complex interactions between variables, univariate methods thus potentially miss some informative biomarkers. Variable relevance scores provided by machine learning techniques, however, are potentially able to highlight multivariate interacting effects, but unlike the p-values returned by univariate tests, these relevance scores are usually not statistically interpretable. This lack of interpretability hampers the determination of a relevance threshold for extracting a feature subset from the rankings and also prevents the wide adoption of these methods by practicians. Results: We evaluated several, existing and novel, procedures that extract relevant features from rankings derived from machine learning approaches. These procedures replace the relevance scores with measures that can be interpreted in a statistical way, such as p-values, false discovery rates, or family wise error rates, for which it is easier to determine a significance level. Experiments were performed on several artificial problems as well as on real microarray datasets. Although the methods differ in terms of computing times and the tradeoff, they achieve in terms of false positives and false negatives, some of them greatly help in the extraction of truly relevant biomarkers and should thus be of great practical interest for biologists and physicians. As a side conclusion, our experiments also clearly highlight that using model performance as a criterion for feature selection is often counter-productive. Availability and implementation: Python source codes of all tested methods, as well as the MATLAB scripts used for data simulation, can be found in the Supplementary Material . Contact:vahuynh@ulg.ac.be, or p.geurts@ulg.ac.be Supplementary information: Supplementary data are available at Bioinformatics online.

A large variety of proteins involved in inflammation, coagulation, lipid-oxidation and lipid metabolism have been associated with high-density lipoprotein (HDL) and it is anticipated that changes in the HDL proteome have implications for the multiple functions of HDL. Here, SELDI-TOF mass spectrometry (MS) was used to study the dynamic changes of HDL protein composition in a human experimental low-dose endotoxemia model. Ten healthy men with low HDL cholesterol (0.7+/-0.1 mmol/L) and 10 men with high HDL cholesterol levels (1.9+/-0.4 mmol/L) were challenged with endotoxin (LPS) intravenously (1 ng/kg bodyweight). We previously showed that subjects with low HDL cholesterol are more susceptible to an inflammatory challenge. The current study tested the hypothesis that this discrepancy may be related to differences in the HDL proteome.

At the intersection between artificial intelligence and statistics, supervised learning allows algorithms to automatically build predictive models from just observations of a system. During the last twenty years, supervised learning has been a tool of choice to analyze the always increasing and complexifying data generated in the context of molecular biology, with successful applications in genome annotation, function prediction, or biomarker discovery. Among supervised learning methods, decision tree-based methods stand out as non parametric methods that have the unique feature of combining interpretability, efficiency, and, when used in ensembles of trees, excellent accuracy. The goal of this paper is to provide an accessible and comprehensive introduction to this class of methods. The first part of the review is devoted to an intuitive but complete description of decision tree-based methods and a discussion of their strengths and limitations with respect to other supervised learning methods. The second part of the review provides a survey of their applications in the context of computational and systems biology.