SearcharxivSearch

arXiv subjects

Javier Escudero

Publications and source records attributed to Javier Escudero.

At least 19 recordsLinked to original sources

Learning Kernels by Alignment for Multiclass Bayes Classification

Kernel methods separate data representation from decision-making, but typically require the kernel to be chosen in advance. We show that this kernel can instead be learned by alignment, and develop the resulting framework through the recently introduced Collaborative Learning and Inference (CLaI). We show that Collaborative Learning can be viewed as a kernel alignment process, in which an embedding is trained so that its induced similarity matches a label-derived target kernel. We also prove that Collaborative Inference is equivalent to kernel Bayes classification with Parzen-window density estimation. Motivated by these perspectives, we generalise CLaI by replacing cosine similarity with a learned Mahalanobis distance and extend it to multiclass classification. On CIFAR-10, PathMNIST, and SleepEDF, the Mahalanobis formulation improves accuracy, converges faster, and yields lower calibration error than the cosine-based variant. Auxiliary experiments further support these connections, showing that CLaI produces latent signals of the same form as a Gaussian process, while achieving competitive calibration on sepsis prediction. Together, these results establish a principled learned-kernel framework that unifies representation learning, kernel alignment, and Bayesian classification, and extends naturally to the multiclass setting.

cs.LG

Sample entropy for graph signals: An approach to nonlinear analysis of graph signals

We introduce a graph-signal generalisation of Sample Entropy, denoted SampEn$_{G}$, to quantify irregularity of graph signals on a continuous state space, complementing existing methods on symbolic dynamics. Our approach replaces the temporal delay embedding of classical SampEn with a multi-hop graph-based embedding: for each node, we aggregate patterns from local walk-weighted neighbourhood averages computed via powers of the graph shift operator. We show empirically that SampEn$_{G}$ reduces to classical 1D SampEn on directed path graphs, and validate its nonlinear sensitivity using the logistic map. Experiments on directed Erd\H{o}s--R\'enyi graph signals further characterise its behaviour with connectivity and pattern length $m$, with practical runtimes on the order of thousands of nodes. We expect SampEn$_{G}$ to open up new ways to analyse graph signals, generalising SampEn and the concept of conditional entropy to extending nonlinear analysis to a wide variety of network data.

eess.SP

Sample entropy for graph signals: An approach to nonlinear dynamic analysis of data on networks

The recent extension of permutation entropy and its derivatives to graph signals has opened up new horizons for the analysis of complex, high-dimensional systems evolving on networks. However, these measures are all fundamentally rooted in Shannon entropy and symbol dynamics. In this paper, we explore, for the first time, whether and how a popular conditional-entropy based measure --Sample Entropy (SampEn)-- can be effectively defined for graph signals and used to characterise the nonlinear dynamics of data on complex networks. We introduce sample entropy for graph signals (SampEnG), a unified framework that generalises classical sample entropy from uni- and bi-dimensional signals, including time series and images, by building on topology-aware embeddings using multi-hop neighbourhoods and computing finite scale of correlation sums in the continuous embedding state space. Experiments on synthetic and real-world datasets, including weather station, wireless sensor monitoring, and traffic systems, verify that SampEnG recovers known nonlinear dynamical features on paths and grids. In the traffic-flow analysis, SampEnG on a directed topology (encoding causal flow constraint) shows promise to detect phase transitions between free-flow and congestion, offering information that is complementary to existing Shannon-entropy based approaches. We expect SampEnG to open up new ways to analyse graph signals, generalising sample entropy and the concept of conditional entropy to extending nonlinear analysis to a wide variety of network data.

eess.SP

PySeizure: A single machine learning classifier framework to detect seizures in diverse datasets

Reliable seizure detection is critical for diagnosing and managing epilepsy, yet clinical workflows remain dependent on time-consuming manual EEG interpretation. While machine learning has shown promise, existing approaches often rely on dataset-specific optimisations, limiting their real-world applicability and reproducibility. Here, we introduce an innovative, open-source machine-learning framework that enables robust and generalisable seizure detection across varied clinical datasets. We evaluate our approach on two publicly available EEG datasets that differ in patient populations and electrode configurations. To enhance robustness, the framework incorporates an automated pre-processing pipeline to standardise data and a majority voting mechanism, in which multiple models independently assess each second of EEG before reaching a final decision. We train, tune, and evaluate models within each dataset, assessing their cross-dataset transferability. Our models achieve high within-dataset performance (AUC 0.904+/-0.059 for CHB-MIT and 0.864+/-0.060 for TUSZ) and demonstrate strong generalisation across datasets despite differences in EEG setups and populations (AUC 0.615+/-0.039 for models trained on CHB-MIT and tested on TUSZ and 0.762+/-0.175 in the reverse case) without any post-processing. Furthermore, a mild post-processing improved the within-dataset results to 0.913+/-0.064 and 0.867+/-0.058 and cross-dataset results to 0.619+/-0.036 and 0.768+/-0.172. These results underscore the potential of, and essential considerations for, deploying our framework in diverse clinical settings. By making our methodology fully reproducible, we provide a foundation for advancing clinically viable, dataset-agnostic seizure detection systems. This approach has the potential for widespread adoption, complementing rather than replacing expert interpretation, and accelerating clinical integration.

cs.LG

Multiplex Nodal Modularity: A novel network metric for the regional analysis of amnestic mild cognitive impairment during a working memory binding task

Modularity is a well-established concept for assessing community structures in various single and multi-layer networks, including those in biological and social domains. Brain networks are known to exhibit community structure at local, meso, and global scale. However, modularity is limited as a metric to a global scale describing the overall strength of community structure, overlooking important variations in community structure at node level. To address this limitation, we extended modularity to individual nodes. This novel measure of nodal modularity (nQ) captures both mesoscale and local-scale changes in modularity. We hypothesized that nQ would illuminate granular changes in the brain due to diseases such as Alzheimer's disease (AD), which are known to disrupt the brain's modular structure. We explored nQ in multiplex networks of a visual short-term memory binding task in fMRI and DTI data in the early stages of AD. While limited by sample size, changes in nQ for individual regions of interest (ROIs) in our fMRI networks were predominantly observed in visual, limbic, and paralimbic systems in the brain, aligning with known AD trajectories and linked to amyloid-$\beta$ and tau deposition. Furthermore, observed changes in white-matter microstructure in our DTI networks in parietal and frontal regions may compliment studies of white-matter integrity in poor memory binders. Additionally, nQ clearly differentiated MCI from MCI converters indicating that nQ may be sensitive to this key turning point of AD. Our findings demonstrate the utility of nQ as a measure of localized group structure, providing novel insights into task and disease-related variability at the node level. Given the widespread application of modularity as a global measure, nQ represents a significant advancement, providing a granular measure of network organization applicable to a wide range of disciplines.

q-bio.NC

Preictal Period Optimization for Deep Learning-Based Epileptic Seizure Prediction

Accurate prediction of epileptic seizures could prove critical for improving patient safety and quality of life in drug-resistant epilepsy. Although deep learning-based approaches have shown promising seizure prediction performance using scalp electroencephalogram (EEG) signals, substantial limitations still impede their clinical adoption. Furthermore, identifying the optimal preictal period (OPP) for labeling EEG segments remains a challenge. Here, we not only develop a competitive deep learning model for seizure prediction but, more importantly, leverage it to demonstrate a methodology to comprehensively evaluate the predictive performance in the seizure prediction task. For this, we introduce a CNN-Transformer deep learning model to detect preictal spatiotemporal dynamics, alongside a novel Continuous Input-Output Performance Ratio (CIOPR) metric to determine the OPP. We trained and evaluated our model on 19 pediatric patients of the open-access CHB-MIT dataset in a subject-specific manner. Using the OPP of each patient, preictal and interictal segments were correctly identified with an average sensitivity of 99.31%, specificity of 95.34%, AUC of 99.35%, and F1- score of 97.46%, while prediction time averaged 76.8 minutes before onset. Notably, our novel CIOPR metric allowed outlining the impact of different preictal period definitions on prediction time, accuracy, output stability, and transition time between interictal and preictal states in a comprehensive and quantitative way and highlighted the importance of considering both inter- and intra-patient variability in seizure prediction.

eess.SP

Graph Permutation Entropy: Extensions to the Continuous Case, A step towards Ordinal Deep Learning, and More

Nonlinear dynamics play an important role in the analysis of signals. A popular, readily interpretable nonlinear measure is Permutation Entropy. It has recently been extended for the analysis of graph signals, thus providing a framework for non-linear analysis of data sampled on irregular domains. Here, we introduce a continuous version of Permutation Entropy, extend it to the graph domain, and develop a ordinal activation function akin to the one of neural networks. This is a step towards Ordinal Deep Learning, a potentially effective and very recently posited concept. We also formally extend ordinal contrasts to the graph domain. Continuous versions of ordinal contrasts of length 3 are also introduced and their advantage is shown in experiments. We also integrate specific contrasts for the analysis of images and show that it generalizes well to the graph domain allowing a representation of images, represented as graph signals, in a plane similar to the entropy-complexity one. Applications to synthetic data, including fractal patterns and popular non-linear maps, and real-life MRI data show the validity of these novel extensions and potential benefits over the state of the art. By extending very recent concepts related to permutation entropy to the graph domain, we expect to accelerate the development of more graph-based entropy methods to enable nonlinear analysis of a broader kind of data and establishing relationships with emerging ideas in data science.

nlin.CD

Graph-Based Multivariate Multiscale Dispersion Entropy: Efficient Implementation and Applications to Real-World Network Data

We introduce Multivariate Multiscale Graph-based Dispersion Entropy (mvDEG), a novel, computationally efficient method for analyzing multivariate time series data in graph and complex network frameworks, and demonstrate its application in real-world data. mvDEG effectively combines temporal dynamics with topological relationships, offering enhanced analysis compared to traditional nonlinear entropy methods. Its efficacy is established through testing on synthetic signals, such as uncorrelated and correlated noise, showcasing its adeptness in discerning various levels of dependency and complexity. The robustness of mvDEG is further validated with real-world datasets, effectively differentiating various two-phase flow regimes and capturing distinct dynamics in weather data analysis. An important advancement of mvDEG is its computational efficiency. Our optimized algorithm displays a computational time that grows linearly with the number of vertices or nodes, in contrast to the exponential growth observed in classical methods. This efficiency is achieved through refined matrix power calculations that exploit matrix and Kronecker product properties, making our method faster than the state of the art. The significant acceleration in computational time positions mvDEG as a transformative tool for extensive and real-time applications, setting a new benchmark in the analysis of time series recorded at distributed locations and opening avenues for innovative applications.

math.CO

Collaborative learning of common latent representations in routinely collected multivariate ICU physiological signals

In Intensive Care Units (ICU), the abundance of multivariate time series presents an opportunity for machine learning (ML) to enhance patient phenotyping. In contrast to previous research focused on electronic health records (EHR), here we propose an ML approach for phenotyping using routinely collected physiological time series data. Our new algorithm integrates Long Short-Term Memory (LSTM) networks with collaborative filtering concepts to identify common physiological states across patients. Tested on real-world ICU clinical data for intracranial hypertension (IH) detection in patients with brain injury, our method achieved an area under the curve (AUC) of 0.889 and average precision (AP) of 0.725. Moreover, our algorithm outperforms autoencoders in learning more structured latent representations of the physiological signals. These findings highlight the promise of our methodology for patient phenotyping, leveraging routinely collected multivariate time series to improve clinical care practices.

cs.LG

Graph-Based Permutation Patterns for the Analysis of Task-Related fMRI Signals on DTI Networks in Mild Cognitive Impairment

Permutation Entropy ($PE$) is a powerful nonlinear analysis technique for univariate time series. Recently, Permutation Entropy for Graph signals ($PEG$) has been proposed to extend PE to data residing on irregular domains. However, $PEG$ is limited as it provides a single value to characterise a whole graph signal. Here, we introduce a novel approach to evaluate graph signals \emph{at the vertex level}: graph-based permutation patterns. Synthetic datasets show the efficacy of our method. We reveal that dynamics in graph signals, undetectable with $PEG$, can be discerned using our graph-based patterns. These are then validated in DTI and fMRI data acquired during a working memory task in mild cognitive impairment, where we explore functional brain signals on structural white matter networks. Our findings suggest that graph-based permutation patterns in individual brain regions change as the disease progresses, demonstrating potential as a method of analyzing graph-signals at a granular scale.

q-bio.NC

Core consistency diagnosis for Block Term Decomposition in rank $(L_r, L_r, 1)$

Determining the underlying number of components $R$ in tensor decompositions is challenging. Diverse techniques exist for various decompositions, notably the core consistency diagnostic (CORCONDIA) for Canonical Polyadic Decomposition (CPD). Here, we propose a model that intuitively adapts CORCONDIA for rank estimation in Block Term Decomposition (BTD) of rank $(L_r, L_r, 1)$: BTDCORCONDIA. Our metric was tested on simulated and real-world tensor data, including assessments of its sensitivity to noise and the indeterminacy of BTD $(L_r, L_r, 1)$. We found that selecting appropriate $R$ and $L_r$ led to core consistency reaching or close to 100%, and BTDCORCONDIA is efficient when the tensor has significantly more elements than the core. Our results confirm that CORCONDIA can be extended to BTD $(L_r, L_r, 1)$, and the resulting metric can assist in the process of determining the number of components in this tensor factorisation.

eess.SP

VAE-IF: Deep feature extraction with averaging for fully unsupervised artifact detection in routinely acquired ICU time-series

Artifacts are a common problem in physiological time series collected from intensive care units (ICU) and other settings. They affect the quality and reliability of clinical research and patient care. Manual annotation of artifacts is costly and time-consuming, rendering it impractical. Automated methods are desired. Here, we propose a novel fully unsupervised approach to detect artifacts in clinical-standard, minute-by-minute resolution ICU data without any prior labeling or signal-specific knowledge. Our approach combines a variational autoencoder (VAE) and an isolation forest (IF) into a hybrid model to learn features and identify anomalies in different types of vital signs, such as blood pressure, heart rate, and intracranial pressure. We evaluate our approach on a real-world ICU dataset and compare it with supervised benchmark models based on long short-term memory (LSTM) and XGBoost and statistical methods such as ARIMA. We show that our unsupervised approach achieves comparable sensitivity to fully supervised methods and generalizes well to an external dataset. We also visualize the latent space learned by the VAE and demonstrate its ability to disentangle clean and noisy samples. Our approach offers a promising solution for cleaning ICU data in clinical research and practice without the need for any labels whatsoever.

cs.LG

Dispersion entropy: A Measure of Irregularity for Graph Signals

We introduce a novel method, called Dispersion Entropy for Graph Signals, $DE_G$, as a powerful tool for analysing the irregularity of signals defined on graphs. We demonstrate the effectiveness of $DE_G$ in detecting changes in the dynamics of signals defined on synthetic and real-world graphs, by defining mixed processing on random geometric graphs or those exhibiting with small-world properties. Remarkably, $DE_G$ generalises the classical dispersion entropy for univariate time series, enabling its application in diverse domains such as image processing, time series analysis, and network analysis, as well as in establishing theoretical relationships (i.e., graph centrality measures, spectrum). Our results indicate that $DE_G$ effectively captures the irregularity of graph signals across various network configurations, successfully differentiating between distinct levels of randomness and connectivity. Consequently, $DE_G$ provides a comprehensive framework for entropy analysis of various data types, enabling new applications of dispersion entropy not previously feasible, and revealing relationships between graph signals and its graph topology.

math.CO

Stratified Multivariate Multiscale Dispersion Entropy for Physiological Signal Analysis

Multivariate entropy quantification algorithms are becoming a prominent tool for the extraction of information from multi-channel physiological time-series. However, in the analysis of physiological signals from heterogeneous organ systems, certain channels may overshadow the patterns of others, resulting in information loss. Here, we introduce the framework of Stratified Entropy to prioritize each channels' dynamics based on their allocation to respective strata, leading to a richer description of the multi-channel time-series. As an implementation of the framework, three algorithmic variations of the Stratified Multivariate Multiscale Dispersion Entropy are introduced. These variations and the original algorithm are applied to synthetic time-series, waveform physiological time-series, and derivative physiological data. Based on the synthetic time-series experiments, the variations successfully prioritize channels following their strata allocation while maintaining the low computation time of the original algorithm. In experiments on waveform physiological time-series and derivative physiological data, increased discrimination capacity was noted for multiple strata allocations in the variations when benchmarked to the original algorithm. This suggests improved physiological state monitoring by the variations. Furthermore, our variations can be modified to utilize a priori knowledge for the stratification of channels. Thus, our research provides a novel approach for the extraction of previously inaccessible information from multi-channel time series acquired from heterogeneous systems.

cs.IT

A noise-robust Multivariate Multiscale Permutation Entropy for two-phase flow characterisation

Using a graph-based approach, we propose a multiscale permutation entropy to explore the complexity of multivariate time series over multiple time scales. This multivariate multiscale permutation entropy (MPEG) incorporates the interaction between channels by constructing an underlying graph for each coarse-grained time series and then applying the recent permutation entropy for graph signals. Given the challenge posed by noise in real-world data analysis, we investigate the robustness to noise of MPEG using synthetic time series and demonstrating better performance than similar multivariate entropy metrics. Two-phase flow data is an important industrial process characterised by complex, dynamic behaviour. MPEG characterises the flow behaviour transition of two-phase flow by incorporating information from different scales. The experimental results show that MPEG is sensitive to the dynamic of flow patterns, allowing us to distinguish between different flow patterns.

physics.data-an

Hybrid Artifact Detection System for Minute Resolution Blood Pressure Signals from ICU

Physiological monitoring in intensive care units (ICU) generates data that can be used in clinical research. However, the recording conditions in clinical settings limit the automated extraction of relevant information from physiological signals due to noise and artifacts. Therefore, removing artifacts before clinical research is essential. Manual annotation by experienced researchers, which is the gold standard for removing artifacts, is time-consuming and costly due to the volume of the data generated in the ICU. In this study, we propose a hybrid artifact detection system that combines a Variational Autoencoder with a statistical detection component for the labeling of artifactual samples to automate the costly process of cleaning physiological recordings. The system is applied to minute-by-minute mean blood pressure signals from an intensive care unit dataset. Its performance is verified by manual annotations made by an expert. We benchmark the performance of our system with two other systems that combine an ARIMA or an autoencoder-based model with our statistical detection component. Our results indicate that the system consistently achieves sensitivity and specificity levels of over 90%. Thus, it provides an initial foundation to automate data cleaning in recordings from ICU.

eess.SP

Multivariate permutation entropy, a Cartesian graph product approach

Entropy metrics are nonlinear measures to quantify the complexity of time series. Among them, permutation entropy is a common metric due to its robustness and fast computation. Multivariate entropy metrics techniques are needed to analyse data consisting of more than one time series. To this end, we present a multivariate permutation entropy, $MPE_G$, using a graph-based approach. Given a multivariate signal, the algorithm $MPE_G$ involves two main steps: 1) we construct an underlying graph G as the Cartesian product of two graphs G1 and G2, where G1 preserves temporal information of each times series together with G2 that models the relations between different channels, and 2) we consider the multivariate signal as samples defined on the regular graph G and apply the recently introduced permutation entropy for graphs. Our graph-based approach gives the flexibility to consider diverse types of cross channel relationships and signals, and it overcomes with the limitations of current multivariate permutation entropy.

math.CO

Permutation Entropy for Graph Signals

Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (one-dimensional data). Some of these entropy metrics can be generalised to data on periodic structures such as a grid or lattice pattern (two-dimensional data) using its symmetry, thus enabling their application to images. However, these metrics have not been developed for signals sampled on irregular domains, defined by a graph. Here, we define for the first time an entropy metric to analyse signals measured over irregular graphs by generalising permutation entropy, a well-established nonlinear metric based on the comparison of neighbouring values within patterns in a time series. Our algorithm is based on comparing signal values on neighbouring nodes, using the adjacency matrix. We show that this generalisation preserves the properties of classical permutation for time series and the recent permutation entropy for images, and it can be applied to any graph structure with synthetic and real signals. We expect the present work to enable the extension of other nonlinear dynamic approaches to graph signals.

math.CO