Marilyn Bello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marilyn Bello has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Rafael Bello
Universidad Central “Marta Abreu” de Las Villas
4 shared publications - María Matilde García Lorenzo
Universidad Central “Marta Abreu” de Las Villas
3 shared publications - Francisco Herrera
University of Granada
2 shared publications - Gonzalo Nápoles
Department of Intelligent Systems, Tilburg University, 5037 AB Tilburg, The Netherlands
2 shared publications - Rosalís Amador
Hospital Santa Cruz , Lisbon , Portugal
2 shared publications Óscar Cordón
2 shared publications
Latest Publications
- 1 February 2026
- Published by Springer Nature
- p. 487-498
A New Explanation Approach Based on Meta-Explainers
- 1 February 2026
- Published by Springer Nature
- p. 487-498
A New Explanation Approach Based on Meta-Explainers
- Open Access
- 22 December 2025
- Published by Springer Nature in Information Systems Frontiers
- p. 1-22
A Three-level Framework for LLM-enhanced Explainable AI: From Technical Explanations to Natural Language
- 22 December 2025
- Published by Springer Nature in Information Systems Frontiers
- p. 1-22
Open AccessA Three-level Framework for LLM-enhanced Explainable AI: From Technical Explanations to Natural Language
- Open Access
- 23 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 654
Age-at-death estimation from 3D bone models of the pubic symphysis by using a deep multi-view learning approach
- 23 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 654
Open AccessAge-at-death estimation from 3D bone models of the pubic symphysis by using a deep multi-view learning approach
- Open Access
- 1 January 2025
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 2025 (1)
Meta‐Explainers: A Unified Ensemble Approach for Multifaceted XAI
Artificial intelligence (AI) systems are increasingly adopted in high‐stakes domains such as healthcare and finance, so the demand for transparency and interpretability has grown substantially. EXplainable AI (XAI) methods have emerged to address this challenge, but individual techniques often offer limited, fragmented insights. This paper introduces Meta‐explainers, a novel ensemble‐based XAI framework that integrates multiple explanation types—specifically relevance‐based and counterfactual methods—into unified, multifaceted and complementary meta‐explanations. Inspired by meta‐classification principles, our approach structures the explanation process into five stages: generation, grouping, evaluation, aggregation, and visualization. Each stage is designed to preserve the unique strengths of individual XAI techniques while enhancing their interpretability and coherence when combined. Experimental results on both image (MNIST) and tabular (Breast Cancer) datasets show that Meta‐explainers consistently outperform individual and state‐of‐the‐art ensemble explanation methods in terms of explanation quality, as measured by established metrics. This work paves the way toward more holistic and user‐centered AI explainability with a flexible methodology that can be extended to incorporate additional explanation paradigms.
- 1 January 2025
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 2025 (1)
Open AccessMeta‐Explainers: A Unified Ensemble Approach for Multifaceted XAI
Artificial intelligence (AI) systems are increasingly adopted in high‐stakes domains such as healthcare and finance, so the demand for transparency and interpretability has grown substantially. EXplainable AI (XAI) methods have emerged to address this challenge, but individual techniques often offer limited, fragmented insights. This paper introduces Meta‐explainers, a novel ensemble‐based XAI framework that integrates multiple explanation types—specifically relevance‐based and counterfactual methods—into unified, multifaceted and complementary meta‐explanations. Inspired by meta‐classification principles, our approach structures the explanation process into five stages: generation, grouping, evaluation, aggregation, and visualization. Each stage is designed to preserve the unique strengths of individual XAI techniques while enhancing their interpretability and coherence when combined. Experimental results on both image (MNIST) and tabular (Breast Cancer) datasets show that Meta‐explainers consistently outperform individual and state‐of‐the‐art ensemble explanation methods in terms of explanation quality, as measured by established metrics. This work paves the way toward more holistic and user‐centered AI explainability with a flexible methodology that can be extended to incorporate additional explanation paradigms.
- Open Access
- 5 April 2024
- Published by Elsevier in Information Fusion
- Vol. 108
ExplainLFS: Explaining neural architectures for similarity learning from local perturbations in the latent feature space
- 5 April 2024
- Published by Elsevier in Information Fusion
- Vol. 108
Open AccessExplainLFS: Explaining neural architectures for similarity learning from local perturbations in the latent feature space
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 19 (1) , 26-35
Forward Composition Propagation for Explainable Neural Reasoning
This paper proposes an algorithm called Forward Composition Propagation (FCP) to explain the predictions of feed-forward neural networks operating on structured classification problems. In the proposed FCP algorithm, each neuron is described by a composition vector indicating the role of each problem feature in that neuron. Composition vectors are initialized using a given input instance and subsequently propagated through the whole network until reaching the output layer. The sign of each composition value indicates whether the corresponding feature excites or inhibits the neuron, while the absolute value quantifies its impact. The FCP algorithm is executed on a post-hoc basis, i.e., once the learning process is completed. Aiming to illustrate the FCP algorithm, this paper develops a case study concerning bias detection in a fairness problem in which the ground truth is known. The simulation results show that the composition values closely align with the expected behavior of protected features. The source code and supplementary material for this paper are available at https://github.com/igraugar/fcp.
- 8 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 19 (1) , 26-35
Forward Composition Propagation for Explainable Neural Reasoning
This paper proposes an algorithm called Forward Composition Propagation (FCP) to explain the predictions of feed-forward neural networks operating on structured classification problems. In the proposed FCP algorithm, each neuron is described by a composition vector indicating the role of each problem feature in that neuron. Composition vectors are initialized using a given input instance and subsequently propagated through the whole network until reaching the output layer. The sign of each composition value indicates whether the corresponding feature excites or inhibits the neuron, while the absolute value quantifies its impact. The FCP algorithm is executed on a post-hoc basis, i.e., once the learning process is completed. Aiming to illustrate the FCP algorithm, this paper develops a case study concerning bias detection in a fairness problem in which the ground truth is known. The simulation results show that the composition values closely align with the expected behavior of protected features. The source code and supplementary material for this paper are available at https://github.com/igraugar/fcp.
- 4 December 2020
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 24 (S1) , 167-183
On the generation of multi-label prototypes
Data reduction techniques play a key role in instance-based classification to lower the amount of data to be processed. Prototype generation aims to obtain a reduced training set in order to obtain accurate results with less effort. This translates into a significant reduction in both algorithms’ spatial and temporal burden. This issue is particularly relevant in multi-label classification, which is a generalization of multiclass classification that allows objects to belong to several classes simultaneously. Although this field is quite active in terms of learning algorithms, there is a lack of data reduction methods. In this paper, we propose several prototype generation methods from multi-label datasets based on Granular Computing. The simulations show that these methods significantly reduce the number of examples to a set of prototypes without significantly affecting classifiers’ performance.
- 4 December 2020
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 24 (S1) , 167-183
On the generation of multi-label prototypes
Data reduction techniques play a key role in instance-based classification to lower the amount of data to be processed. Prototype generation aims to obtain a reduced training set in order to obtain accurate results with less effort. This translates into a significant reduction in both algorithms’ spatial and temporal burden. This issue is particularly relevant in multi-label classification, which is a generalization of multiclass classification that allows objects to belong to several classes simultaneously. Although this field is quite active in terms of learning algorithms, there is a lack of data reduction methods. In this paper, we propose several prototype generation methods from multi-label datasets based on Granular Computing. The simulations show that these methods significantly reduce the number of examples to a set of prototypes without significantly affecting classifiers’ performance.