Luis Bote-Curiel
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
Luis Bote-Curiel has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- José Luis Rojo-Álvarez
Universidad Rey Juan Carlos Madrid Spain
16 shared publications - Ismael Gómez-Talal
International Gaming Institute at the University of Nevada, Las Vegas., 4505 S. Maryland Pkwy, Las Vegas, 89154, NV, USA; Department of Signal Theory and Communications and Telematic Systems and Computation at Rey Juan Carlos University, Camino del Molino, s/n, Fuenlabrada, 28943, Madrid, Spain
8 shared publications - Sergio Muñoz-Romero
Department of Signal Theory and Communications, Telematics, and Computing Systems, Universidad Rey Juan Carlos, Madrid, Spain
7 shared publications - Dafne Lozano-Paredes
Department of Signal Theory and Communications and Telematic Systems and Computation, Rey Juan Carlos University, Fuenlabrada Campus, Madrid, Spain
6 shared publications - Arantzazu Barquín García
Unit of Gynecological, Genitourinary and Skin Tumors, Hospital HM Sanchinarro, Fundación Investigación HM Hospitales, Madrid, Spain
5 shared publications - Monica Yague-Fernandez
Unit of Gynecological, Genitourinary and Skin Tumors, Hospital HM Sanchinarro, Fundación Investigación HM Hospitales, Madrid, Spain
4 shared publications
Latest Publications
- Open Access
- 14 July 2026
- Published by Elsevier in Information Sciences
- Vol. 757
Highlighting true alerts in false-positive-heavy intrusion detection systems outputs through unsupervised community detection and large language models
- 14 July 2026
- Published by Elsevier in Information Sciences
- Vol. 757
Open AccessHighlighting true alerts in false-positive-heavy intrusion detection systems outputs through unsupervised community detection and large language models
- Open Access
- 6 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 71029-71042
Explainable Autoencoder-Based Anomaly Detection in IEC 61850 GOOSE Networks
The IEC 61850 Generic Object-Oriented Substation Event (GOOSE) protocol plays a critical role in real-time protection and automation of digital substations, yet its lack of native security mechanisms can expose power systems to sophisticated cyberattacks. Traditional rule-based and supervised intrusion detection techniques struggle to detect protocol-compliant and zero-day attacks under significant class imbalance and limited availability of labeled data. This paper proposes an explainable, unsupervised multi-view anomaly detection framework for IEC 61850 GOOSE networks that explicitly separates semantic integrity and temporal availability. The approach employs asymmetric autoencoders trained only on real operational GOOSE traffic to learn distinct latent representations of sequence-based protocol semantics and timing-related transmission dynamics in normal traffic. Anomaly detection is implemented using reconstruction errors mixed with statistically grounded thresholds, enabling robust detection without specified attack types. Feature-level reconstruction analysis provides intrinsic explainability by directly linking detection outcomes to IEC 61850 protocol characteristics. The proposed framework is evaluated using real substation traffic for training and a public dataset containing normal traffic and message suppression, data manipulation, and denial-of-service attacks for testing. Experimental results show that the semantic view provides the strongest discrimination, achieving perfect recall for message suppression and denial-of-service attacks in several window configurations. For message suppression attacks, the semantic model reaches F1-scores of 0.78 and 0.88 for window sizes of 0.5 s and 3.0 s, respectively, while for data manipulation it attains F1-scores up to 0.79 at intermediate window sizes. The temporal view, although less precise, remains sensitive to timing-related anomalies, especially for denial-of-service attacks, for which it achieves perfect recall across all evaluated window sizes. Overall, the proposed framework achieves strong detection performance in its best configurations while maintaining low false-positive rates, demonstrating strong generalization across environments, effective operation under extreme class imbalance, and interpretable anomaly attribution.
- 6 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 71029-71042
Open AccessExplainable Autoencoder-Based Anomaly Detection in IEC 61850 GOOSE Networks
The IEC 61850 Generic Object-Oriented Substation Event (GOOSE) protocol plays a critical role in real-time protection and automation of digital substations, yet its lack of native security mechanisms can expose power systems to sophisticated cyberattacks. Traditional rule-based and supervised intrusion detection techniques struggle to detect protocol-compliant and zero-day attacks under significant class imbalance and limited availability of labeled data. This paper proposes an explainable, unsupervised multi-view anomaly detection framework for IEC 61850 GOOSE networks that explicitly separates semantic integrity and temporal availability. The approach employs asymmetric autoencoders trained only on real operational GOOSE traffic to learn distinct latent representations of sequence-based protocol semantics and timing-related transmission dynamics in normal traffic. Anomaly detection is implemented using reconstruction errors mixed with statistically grounded thresholds, enabling robust detection without specified attack types. Feature-level reconstruction analysis provides intrinsic explainability by directly linking detection outcomes to IEC 61850 protocol characteristics. The proposed framework is evaluated using real substation traffic for training and a public dataset containing normal traffic and message suppression, data manipulation, and denial-of-service attacks for testing. Experimental results show that the semantic view provides the strongest discrimination, achieving perfect recall for message suppression and denial-of-service attacks in several window configurations. For message suppression attacks, the semantic model reaches F1-scores of 0.78 and 0.88 for window sizes of 0.5 s and 3.0 s, respectively, while for data manipulation it attains F1-scores up to 0.79 at intermediate window sizes. The temporal view, although less precise, remains sensitive to timing-related anomalies, especially for denial-of-service attacks, for which it achieves perfect recall across all evaluated window sizes. Overall, the proposed framework achieves strong detection performance in its best configurations while maintaining low false-positive rates, demonstrating strong generalization across environments, effective operation under extreme class imbalance, and interpretable anomaly attribution.
- Open Access
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 25370-25387
Evaluating Manifold Learning Techniques for Dimensionality Reduction on Industrial IoT Cybersecurity Data
The Industrial Internet of Things (IIoT) generates high-dimensional traffic data that challenge conventional intrusion detection systems. This paper presents a comparative study of ten manifold learning methods evaluated across five heterogeneous IIoT cybersecurity datasets, including trust-based routing, malware traffic, edge-device telemetry, large-scale network flows, and private Spanish Power Grid data. Performance was assessed using bootstrap-aggregated metrics covering neighborhood preservation, global fidelity, and supervised cluster separation. Results showed that nonlinear methods dominated local structure preservation: t-distributed Stochastic Neighbor Embedding (t-SNE) and Uniform Manifold Approximation and Projection (UMAP) consistently achieved the highest Trustworthiness, reaching 0.999 (on Spanish Power Grid data) and 0.998 (on WUSTL-IIoT-2021 dataset). In contrast, multidimensional scaling (MDS) minimized Stress (as low as 0.096 in WUSTL-IIoT-2021), confirming its superiority in global geometry preservation. Principal Component Analysis (PCA) delivered competitive supervised separation, obtaining the best Davies–Bouldin index (0.750) and Silhouette score (0.851) on WUSTL-IIoT-2021, outperforming nonlinear methods in these metrics. Malware traffic in CIMD-2024 proved most challenging, where even the best embeddings yielded Davies–Bouldin scores above 20, highlighting the complexity of polymorphic attack families. Overall, findings demonstrate that no single method is universally optimal: t-SNE and UMAP maximize local fidelity, MDS ensures global consistency, and PCA remained highly competitive for anomaly separation with low computational cost. These results support the design of IIoT security pipelines that strategically combine complementary dimensionality reduction methods for effective and scalable intrusion detection.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 25370-25387
Open AccessEvaluating Manifold Learning Techniques for Dimensionality Reduction on Industrial IoT Cybersecurity Data
The Industrial Internet of Things (IIoT) generates high-dimensional traffic data that challenge conventional intrusion detection systems. This paper presents a comparative study of ten manifold learning methods evaluated across five heterogeneous IIoT cybersecurity datasets, including trust-based routing, malware traffic, edge-device telemetry, large-scale network flows, and private Spanish Power Grid data. Performance was assessed using bootstrap-aggregated metrics covering neighborhood preservation, global fidelity, and supervised cluster separation. Results showed that nonlinear methods dominated local structure preservation: t-distributed Stochastic Neighbor Embedding (t-SNE) and Uniform Manifold Approximation and Projection (UMAP) consistently achieved the highest Trustworthiness, reaching 0.999 (on Spanish Power Grid data) and 0.998 (on WUSTL-IIoT-2021 dataset). In contrast, multidimensional scaling (MDS) minimized Stress (as low as 0.096 in WUSTL-IIoT-2021), confirming its superiority in global geometry preservation. Principal Component Analysis (PCA) delivered competitive supervised separation, obtaining the best Davies–Bouldin index (0.750) and Silhouette score (0.851) on WUSTL-IIoT-2021, outperforming nonlinear methods in these metrics. Malware traffic in CIMD-2024 proved most challenging, where even the best embeddings yielded Davies–Bouldin scores above 20, highlighting the complexity of polymorphic attack families. Overall, findings demonstrate that no single method is universally optimal: t-SNE and UMAP maximize local fidelity, MDS ensures global consistency, and PCA remained highly competitive for anomaly separation with low computational cost. These results support the design of IIoT security pipelines that strategically combine complementary dimensionality reduction methods for effective and scalable intrusion detection.
- Open Access
Explainable Autoencoder-Based Anomaly Detection in IEC 61850 GOOSE Networks
The IEC 61850 Generic Object-Oriented Substation Event (GOOSE) protocol plays a critical role in real-time protection and automation of digital substations, yet its lack of native security mechanisms can expose power systems to sophisticated cyberattacks. Traditional rule-based and supervised intrusion detection techniques struggle to detect protocol-compliant and zero-day attacks under significant class imbalance and limited availability of labeled data. This paper proposes an explainable, unsupervised multi-view anomaly detection framework for IEC 61850 GOOSE networks that explicitly separates semantic integrity and temporal availability. The approach employs asymmetric autoencoders trained only on real operational GOOSE traffic to learn distinct latent representations of sequence-based protocol semantics and timing-related transmission dynamics in normal traffic. Anomaly detection is implemented using reconstruction errors mixed with statistically grounded thresholds, enabling robust detection without specified attack types. Feature-level reconstruction analysis provides intrinsic explainability by directly linking detection outcomes to IEC 61850 protocol characteristics. The proposed framework is evaluated using real substation traffic for training and a public dataset containing normal traffic and message suppression, data manipulation, and denial-of-service attacks for testing. Experimental results show attack detection rates above 99% with false positives remaining below 5% of total traffic, demonstrating strong generalization across environments and effective operation under extreme class imbalance and interpretable anomaly attribution.
Open AccessExplainable Autoencoder-Based Anomaly Detection in IEC 61850 GOOSE Networks
The IEC 61850 Generic Object-Oriented Substation Event (GOOSE) protocol plays a critical role in real-time protection and automation of digital substations, yet its lack of native security mechanisms can expose power systems to sophisticated cyberattacks. Traditional rule-based and supervised intrusion detection techniques struggle to detect protocol-compliant and zero-day attacks under significant class imbalance and limited availability of labeled data. This paper proposes an explainable, unsupervised multi-view anomaly detection framework for IEC 61850 GOOSE networks that explicitly separates semantic integrity and temporal availability. The approach employs asymmetric autoencoders trained only on real operational GOOSE traffic to learn distinct latent representations of sequence-based protocol semantics and timing-related transmission dynamics in normal traffic. Anomaly detection is implemented using reconstruction errors mixed with statistically grounded thresholds, enabling robust detection without specified attack types. Feature-level reconstruction analysis provides intrinsic explainability by directly linking detection outcomes to IEC 61850 protocol characteristics. The proposed framework is evaluated using real substation traffic for training and a public dataset containing normal traffic and message suppression, data manipulation, and denial-of-service attacks for testing. Experimental results show attack detection rates above 99% with false positives remaining below 5% of total traffic, demonstrating strong generalization across environments and effective operation under extreme class imbalance and interpretable anomaly attribution.
- 6 November 2025
- Published by Springer Nature
- p. 239-250
AI-Based Data Augmentation for Cleft Lip Assessment: Generating Realistic Synthetic Videos to Improve Clinical Outcomes
- 6 November 2025
- Published by Springer Nature
- p. 239-250
AI-Based Data Augmentation for Cleft Lip Assessment: Generating Realistic Synthetic Videos to Improve Clinical Outcomes
- 6 November 2025
- Published by Springer Nature
- p. 445-456
A Comparative Study of Machine Learning Models for Two-Tier Android Malware Classification with Dynamic Behavioral Analysis
- 6 November 2025
- Published by Springer Nature
- p. 445-456
A Comparative Study of Machine Learning Models for Two-Tier Android Malware Classification with Dynamic Behavioral Analysis
- Open Access
- 26 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (4) , 1822-1835
Discovering Genetic Variants in Hypertrophic Cardiomyopathy With Multiple Machine Learning Techniques
Hypertrophic cardiomyopathy is known to have strong genetic foundations. However, only some studies have addressed the complex network of co-expressed genes and variants that modify the phenotype. Machine learning methods offer robust information discovery when dealing with high-dimensional datasets. We aimed to perform relevance and interaction analysis on genetic variants from hypertrophic cardiomyopathy patients using diverse machine learning techniques, with the following stages: (a) Statistical univariate techniques (with various $p$-value adjustment methods) identified relevant variants; (b) Linear classifiers (support vector machines, Fisher discriminant analysis) provided combined relevance based on feature weights; (c) Informative variable identifier method and Bayesian networks explained inter-variant relationships; (d) Manifold learning of low-dimensional latent spaces gave interpretable representations of groups; (e) Linkage disequilibrium matrices and frequency tables discovered associations between variants. We analyzed 61 patients and 67 controls with genetic information comprising 216 variants from a genetic panel of 15 genes. Across all methodologies, ten variants were consistently identified as significant, with 22 total variants significant in at least three out of five methods. Machine learning has been found to detect disease-associated variants, including pathogenic founder variants (11:47357494, 11:47360070, 11:47372137). This methodology allows for identifying potential disease modulators while accounting for relevance and interactions among variants.
- 26 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Biology and Bioinformatics
- Vol. 22 (4) , 1822-1835
Open AccessDiscovering Genetic Variants in Hypertrophic Cardiomyopathy With Multiple Machine Learning Techniques
Hypertrophic cardiomyopathy is known to have strong genetic foundations. However, only some studies have addressed the complex network of co-expressed genes and variants that modify the phenotype. Machine learning methods offer robust information discovery when dealing with high-dimensional datasets. We aimed to perform relevance and interaction analysis on genetic variants from hypertrophic cardiomyopathy patients using diverse machine learning techniques, with the following stages: (a) Statistical univariate techniques (with various $p$-value adjustment methods) identified relevant variants; (b) Linear classifiers (support vector machines, Fisher discriminant analysis) provided combined relevance based on feature weights; (c) Informative variable identifier method and Bayesian networks explained inter-variant relationships; (d) Manifold learning of low-dimensional latent spaces gave interpretable representations of groups; (e) Linkage disequilibrium matrices and frequency tables discovered associations between variants. We analyzed 61 patients and 67 controls with genetic information comprising 216 variants from a genetic panel of 15 genes. Across all methodologies, ten variants were consistently identified as significant, with 22 total variants significant in at least three out of five methods. Machine learning has been found to detect disease-associated variants, including pathogenic founder variants (11:47357494, 11:47360070, 11:47372137). This methodology allows for identifying potential disease modulators while accounting for relevance and interactions among variants.
- Open Access
- 9 May 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 155
Towards Explainable Artificial Intelligence in Machine Learning: A study on efficient Perturbation-Based Explanations
- 9 May 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 155
Open AccessTowards Explainable Artificial Intelligence in Machine Learning: A study on efficient Perturbation-Based Explanations
- Open Access
- 5 May 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 154
Interpreting frequency evolution in ventricular fibrillation using embeddings and deep learning methods
- 5 May 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 154
Open AccessInterpreting frequency evolution in ventricular fibrillation using embeddings and deep learning methods
- Open Access
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 27371-27397
Interpretable Machine Learning Models for PISA Results in Mathematics
The Program for International Student Assessment (PISA) 2022 provides a global framework for assessing educational performance worldwide. We addressed a principled observation of characteristics and disparities in Mathematics performance among Spanish adolescents while showing the factors influencing these results. To address this question, we proposed using advanced Machine Learning techniques through possibly non-linear predictive models that identify key drivers of Mathematics performance to inform data-driven educational policies and interventions that improve learning outcomes. By preprocessing the PISA dataset, we categorized students into Low, Medium, and High proficiency levels and employed various binary classification models to discern predictive patterns. In addition, a stacking meta-model integrating the strengths of eight distinct predictive models was developed to enhance prediction accuracy. Our results demonstrated that the meta-model outperforms individual models in predicting student performance across various proficiency levels, consistently showing superior metrics in Precision, Recall, and Area Under Curve (AUC) scores. Specifically, the meta-model achieved an AUC score of 0.9766 when classifying students in the Low and High proficiency categories. We adopted the Shapley Additive exPlanations method to demystify the model decisions, highlighting significant predictors such as grade repetition, access to digital devices, and extracurricular Mathematics classes. We also introduced an interactive dashboard, harnessing Uniform Manifold Approximation and Projection for dimensionality reduction and enabling a granular view of the educational landscape. The intention of all this is to contribute to an education system that is well-informed and effectively adapts to the diverse needs of students.
- 4 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 27371-27397
Open AccessInterpretable Machine Learning Models for PISA Results in Mathematics
The Program for International Student Assessment (PISA) 2022 provides a global framework for assessing educational performance worldwide. We addressed a principled observation of characteristics and disparities in Mathematics performance among Spanish adolescents while showing the factors influencing these results. To address this question, we proposed using advanced Machine Learning techniques through possibly non-linear predictive models that identify key drivers of Mathematics performance to inform data-driven educational policies and interventions that improve learning outcomes. By preprocessing the PISA dataset, we categorized students into Low, Medium, and High proficiency levels and employed various binary classification models to discern predictive patterns. In addition, a stacking meta-model integrating the strengths of eight distinct predictive models was developed to enhance prediction accuracy. Our results demonstrated that the meta-model outperforms individual models in predicting student performance across various proficiency levels, consistently showing superior metrics in Precision, Recall, and Area Under Curve (AUC) scores. Specifically, the meta-model achieved an AUC score of 0.9766 when classifying students in the Low and High proficiency categories. We adopted the Shapley Additive exPlanations method to demystify the model decisions, highlighting significant predictors such as grade repetition, access to digital devices, and extracurricular Mathematics classes. We also introduced an interactive dashboard, harnessing Uniform Manifold Approximation and Projection for dimensionality reduction and enabling a granular view of the educational landscape. The intention of all this is to contribute to an education system that is well-informed and effectively adapts to the diverse needs of students.