Search

The complex landscape of cardiovascular diseases encompasses a wide range of related pathologies arising from diverse molecular mechanisms and exhibiting heterogeneous phenotypes. This variety of manifestations poses significant challenges in the development of treatment strategies. The increasing availability of precise phenotypic and multiomics data of cardiovascular disease patient populations has spurred the development of a variety of computational disease subtyping techniques to identify distinct subgroups with unique underlying pathogeneses. In this review, we outline the essential components of computational approaches to select, integrate, and cluster omics and clinical data in the context of cardiovascular disease research. We delve into the challenges faced during different stages of the analysis, including feature selection and extraction, data integration, and clustering algorithms. Next, we highlight representative applications of subtyping pipelines in heart failure and coronary artery disease. Finally, we discuss the current challenges and future directions in the development of robust subtyping approaches that can be implemented in clinical workflows, ultimately contributing to the ongoing evolution of precision medicine in health care.

Accurate modeling of electrochemical cells is nowadays mandatory for achieving effective upgrades in the fields of energetic efficiency and sustainable mobility. Indeed, these models are often used for performing accurate State-of-Charge (SoC) estimations in energy storage systems used in microgrids or powering pure electric and hybrid cars. To this aim, a novel neural networks ensemble approach for modeling electrochemical cells is proposed in this paper. Herein, the system identification has been faced by means of a gray box technique, in which different and specialized neural networks are used for identifying the unknown internal behaviors of the cell. In particular, the a priori knowledge on the system dynamic is used for defining the network architecture. Specifically, each nonlinear function appearing in the system equations is approximated by a distinct neural network. The proposed model has been validated upon three different data sets both in terms of model accuracy and effectiveness in the SoC estimation task. The achieved performances have been compared with those of other computational intelligence approaches proposed in the literature. The results prove the effectiveness of the gray box scheme, achieving very promising performances in both the system identification accuracy and the SoC estimation task.

In this paper, we propose a novel data-driven approach for removing trends (detrending) from nonstationary, fractal and multifractal time series. We consider real-valued time series relative to measurements of an underlying dynamical system that evolves through time. We assume that such a dynamical process is predictable to a certain degree by means of a class of recurrent networks called Echo State Network (ESN), which are capable to model a generic dynamical process. In order to isolate the superimposed (multi)fractal component of interest, we define a data-driven filter by leveraging on the ESN prediction capability to identify the trend component of a given input time series. Specifically, the (estimated) trend is removed from the original time series and the residual signal is analyzed with the multifractal detrended fluctuation analysis procedure to verify the correctness of the detrending procedure. In order to demonstrate the effectiveness of the proposed technique, we consider several synthetic time series consisting of different types of trends and fractal noise components with known characteristics. We also process a real-world dataset, the sunspot time series, which is well-known for its multifractal features and has recently gained attention in the complex systems field. Results demonstrate the validity and generality of the proposed detrending method based on ESNs. [ABSTRACT FROM AUTHOR]

In this paper, we present a generative model for protein contact networks (PCNs). The soundness of the proposed model is investigated by focusing primarily on mesoscopic properties elaborated from the spectra of the graph Laplacian. To complement the analysis, we also study the classical topological descriptors, such as statistics of the shortest paths and the important feature of modularity. Our experiments show that the proposed model results in a considerable improvement with respect to two suitably chosen generative mechanisms, mimicking with better approximation real PCNs in terms of diffusion properties elaborated from the normalized Laplacian spectra. However, as well as the other network models, it does not reproduce with sufficient accuracy the shortest paths structure. To compensate this drawback, we designed a second step involving a targeted edge reconfiguration process. The ensemble of reconfigured networks denotes further improvements that are statistically significant. As an important byproduct of our study, we demonstrate that modularity, a well-known property of proteins, does not entirely explain the actual network architecture characterizing PCNs. In fact, we conclude that modularity, intended as a quantification of an underlying community structure, should be considered as an emergent property of the structural organization of proteins. Interestingly, such a property is suitably optimized in PCNs together with the feature of path efficiency.