Rafael Cabañas
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
Rafael Cabañas has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Manuel Gómez-Olmedo
Computer Science and Artificial Intelligent Department, University of Granada, 18071 Granada, Spain
10 shared publications - Antonio Salmerón
University of Almeria
9 shared publications - Andrés Cano
Computer Science and Artificial Intelligent Department, University of Granada, 18071 Granada, Spain
7 shared publications - Andrés R. Masegosa
Department of Mathematics University of Almería Spain
6 shared publications Anders L. Madsen
5 shared publications- Thomas Dyhre Nielsen
Aalborg University
4 shared publications
Latest Publications
- Open Access
- 17 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (7) , 1-50
How Do Machine Learning Models Change?
The proliferation of Machine Learning (ML) models and their open source implementations has transformed AI research and applications. Platforms like Hugging Face (HF) enable this evolving ecosystem, yet a large-scale longitudinal study of how these models change is lacking. This study addresses this gap by analyzing over 680,000 commits from 100,000 models and 2,251 releases from 202 of these models on HF using repository mining and longitudinal methods. We apply an extended ML change taxonomy to classify commits and use Bayesian networks to model temporal patterns in commit and release activities. Our findings show that commit activities align with established data science methodologies, such as the Cross-Industry Standard Process for Data Mining (CRISP-DM), emphasizing iterative refinement. Release patterns tend to consolidate significant updates, particularly in model outputs, sharing, and documentation, distinguishing them from granular commits. Furthermore, projects with higher popularity exhibit distinct evolutionary paths, often starting from a more mature baseline with fewer foundational commits in their public history. In contrast, those with intensive collaboration show unique documentation and technical evolution patterns. These insights enhance the understanding of model changes on community platforms and provide valuable guidance for best practices in model maintenance.
- 17 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (7) , 1-50
Open AccessHow Do Machine Learning Models Change?
The proliferation of Machine Learning (ML) models and their open source implementations has transformed AI research and applications. Platforms like Hugging Face (HF) enable this evolving ecosystem, yet a large-scale longitudinal study of how these models change is lacking. This study addresses this gap by analyzing over 680,000 commits from 100,000 models and 2,251 releases from 202 of these models on HF using repository mining and longitudinal methods. We apply an extended ML change taxonomy to classify commits and use Bayesian networks to model temporal patterns in commit and release activities. Our findings show that commit activities align with established data science methodologies, such as the Cross-Industry Standard Process for Data Mining (CRISP-DM), emphasizing iterative refinement. Release patterns tend to consolidate significant updates, particularly in model outputs, sharing, and documentation, distinguishing them from granular commits. Furthermore, projects with higher popularity exhibit distinct evolutionary paths, often starting from a more mature baseline with fewer foundational commits in their public history. In contrast, those with intensive collaboration show unique documentation and technical evolution patterns. These insights enhance the understanding of model changes on community platforms and provide valuable guidance for best practices in model maintenance.
- Open Access
- 16 October 2025
- Published by Springer Nature in Journal of Medical Systems
- Vol. 49 (1) , 1-8
On Counterfactual Explanations of Cardiovascular Risk in Adolescent and Young Adult Breast Cancer Survivors
Cancer treatments might lead to several long-term effects. In this work we investigate their causal role on ischemic heart disease and their potential precursors (i.e. hypertension and dyslipidemia) of the ovarian suppression therapy in adolescent and young adult (AYA) breast cancer (BC) survivors. Additionally, we assess the external validity of our findings through comparative analysis of regional data. We take advantage of a causal network model that leverage on observational data on 1-year AYA BC survivors living the Lombardy region in Italy. Using a structural causal model (SCM) and counterfactual analysis within Pearl’s causal inference framework, we estimate the Average Causal Effect (ACE), Probability of Necessity (PN), and Probability of Sufficiency (PS) for the cause-effect relationships. Data of a regional cohort of AYA BC patients living in the Veneto region were used to externally validate results. Ovarian suppression was found to be a necessary but not sufficient cause for ischemic heart disease (PN > 97.8%; PS < 1.97%). While PN is high for both hypertension and dyslipidemia, PS varied suggesting ovarian suppression alone could induce hypertension in about 30% of cases but was rarely sufficient for dyslipidemia onset. External validation confirmed the robustness of findings across regions. Our experimental results may be of interest for clinicians who aim at personalizing the follow-up of AYA BC survivors, with particular attention to be paid in monitoring the hypertension onset or in its prevention. The study demonstrates the value of counterfactual reasoning and causal inference when working with real-world data.
- 16 October 2025
- Published by Springer Nature in Journal of Medical Systems
- Vol. 49 (1) , 1-8
Open AccessOn Counterfactual Explanations of Cardiovascular Risk in Adolescent and Young Adult Breast Cancer Survivors
Cancer treatments might lead to several long-term effects. In this work we investigate their causal role on ischemic heart disease and their potential precursors (i.e. hypertension and dyslipidemia) of the ovarian suppression therapy in adolescent and young adult (AYA) breast cancer (BC) survivors. Additionally, we assess the external validity of our findings through comparative analysis of regional data. We take advantage of a causal network model that leverage on observational data on 1-year AYA BC survivors living the Lombardy region in Italy. Using a structural causal model (SCM) and counterfactual analysis within Pearl’s causal inference framework, we estimate the Average Causal Effect (ACE), Probability of Necessity (PN), and Probability of Sufficiency (PS) for the cause-effect relationships. Data of a regional cohort of AYA BC patients living in the Veneto region were used to externally validate results. Ovarian suppression was found to be a necessary but not sufficient cause for ischemic heart disease (PN > 97.8%; PS < 1.97%). While PN is high for both hypertension and dyslipidemia, PS varied suggesting ovarian suppression alone could induce hypertension in about 30% of cases but was rarely sufficient for dyslipidemia onset. External validation confirmed the robustness of findings across regions. Our experimental results may be of interest for clinicians who aim at personalizing the follow-up of AYA BC survivors, with particular attention to be paid in monitoring the hypertension onset or in its prevention. The study demonstrates the value of counterfactual reasoning and causal inference when working with real-world data.
- 24 September 2025
- Published by Springer Nature
- p. 92-103
Noise-Robust Weighted Logistic Regression Based on Outlier Detection with Expectation Maximization
- 24 September 2025
- Published by Springer Nature
- p. 92-103
Noise-Robust Weighted Logistic Regression Based on Outlier Detection with Expectation Maximization
- Open Access
- 13 May 2025
- Published by Elsevier in Ecological Informatics
- Vol. 89
Bayesian networks for causal analysis in socioecological systems
- 13 May 2025
- Published by Elsevier in Ecological Informatics
- Vol. 89
Open AccessBayesian networks for causal analysis in socioecological systems
- Open Access
- 28 February 2024
- Published by MDPI AG in Education Sciences
- Vol. 14 (3) , 250
Learning Styles Impact Students’ Perceptions on Active Learning Methodologies: A Case Study on the Use of Live Coding and Short Programming Exercises
This research paper explores the effectiveness of live coding as an active learning methodology in teaching programming, particularly in the context of diverse learning styles. Live coding, characterized by real-time coding demonstrations by instructors, has been increasingly adopted to enhance the learning experience in programming education. It offers immediate feedback, demonstrates problem-solving in action, and allows instructors to incorporate student suggestions, making it a dynamic and engaging teaching tool. However, its effectiveness varies among students with different learning preferences. This study investigates the impact of various learning style dimensions, as defined by the Felder–Silverman model, on the effectiveness of live coding in an introductory object-oriented programming course. The study was conducted at Aalborg University, Denmark, with students from the BSc Software program. It aims to provide empirical evidence on how different learning style dimensions influence student preferences and the effectiveness of live coding, offering insights to educators for tailoring active learning methodologies in programming courses to diverse learner needs.
- 28 February 2024
- Published by MDPI AG in Education Sciences
- Vol. 14 (3) , 250
Open AccessLearning Styles Impact Students’ Perceptions on Active Learning Methodologies: A Case Study on the Use of Live Coding and Short Programming Exercises
This research paper explores the effectiveness of live coding as an active learning methodology in teaching programming, particularly in the context of diverse learning styles. Live coding, characterized by real-time coding demonstrations by instructors, has been increasingly adopted to enhance the learning experience in programming education. It offers immediate feedback, demonstrates problem-solving in action, and allows instructors to incorporate student suggestions, making it a dynamic and engaging teaching tool. However, its effectiveness varies among students with different learning preferences. This study investigates the impact of various learning style dimensions, as defined by the Felder–Silverman model, on the effectiveness of live coding in an introductory object-oriented programming course. The study was conducted at Aalborg University, Denmark, with students from the BSc Software program. It aims to provide empirical evidence on how different learning style dimensions influence student preferences and the effectiveness of live coding, offering insights to educators for tailoring active learning methodologies in programming courses to diverse learner needs.
- Open Access
Bounding Counterfactuals under Selection Bias
Causal analysis may be affected by selection bias, which is defined as the systematic exclusion of data from a certain subpopulation. Previous work in this area focused on the derivation of identifiability conditions. We propose instead a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal. This enables us to use the causal expectation-maximisation scheme to obtain the values of causal queries in the identifiable case, and to compute bounds otherwise. Experiments demonstrate the approach to be practically viable. Theoretical convergence characterisations are provided.
Open AccessBounding Counterfactuals under Selection Bias
Causal analysis may be affected by selection bias, which is defined as the systematic exclusion of data from a certain subpopulation. Previous work in this area focused on the derivation of identifiability conditions. We propose instead a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal. This enables us to use the causal expectation-maximisation scheme to obtain the values of causal queries in the identifiable case, and to compute bounds otherwise. Experiments demonstrate the approach to be practically viable. Theoretical convergence characterisations are provided.
- Open Access
Causal Expectation-Maximisation
Structural causal models are the basic modelling unit in Pearl's causal theory; in principle they allow us to solve counterfactuals, which are at the top rung of the ladder of causation. But they often contain latent variables that limit their application to special settings. This appears to be a consequence of the fact, proven in this paper, that causal inference is NP-hard even in models characterised by polytree-shaped graphs. To deal with such a hardness, we introduce the causal EM algorithm. Its primary aim is to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. Counterfactual inference is then addressed via standard algorithms for Bayesian networks. The result is a general method to approximately compute counterfactuals, be they identifiable or not (in which case we deliver bounds). We show empirically, as well as by deriving credible intervals, that the approximation we provide becomes accurate in a fair number of EM runs. These results lead us finally to argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
Open AccessCausal Expectation-Maximisation
Structural causal models are the basic modelling unit in Pearl's causal theory; in principle they allow us to solve counterfactuals, which are at the top rung of the ladder of causation. But they often contain latent variables that limit their application to special settings. This appears to be a consequence of the fact, proven in this paper, that causal inference is NP-hard even in models characterised by polytree-shaped graphs. To deal with such a hardness, we introduce the causal EM algorithm. Its primary aim is to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. Counterfactual inference is then addressed via standard algorithms for Bayesian networks. The result is a general method to approximately compute counterfactuals, be they identifiable or not (in which case we deliver bounds). We show empirically, as well as by deriving credible intervals, that the approximation we provide becomes accurate in a fair number of EM runs. These results lead us finally to argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
- Open Access
- 26 July 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 36 (11) , 6913-6943
Value‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models
- 26 July 2021
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 36 (11) , 6913-6943
Open AccessValue‐based potentials: Exploiting quantitative information regularity patterns in probabilistic graphical models
- Open Access
Probabilistic Models with Deep Neural Networks
Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to very restricted model classes, where exact or approximate probabilistic inference is feasible. However, developments in variational inference, a general form of approximate probabilistic inference that originated in statistical physics, have enabled probabilistic modeling to overcome these limitations: (i) Approximate probabilistic inference is now possible over a broad class of probabilistic models containing a large number of parameters, and (ii) scalable inference methods based on stochastic gradient descent and distributed computing engines allow probabilistic modeling to be applied to massive data sets. One important practical consequence of these advances is the possibility to include deep neural networks within probabilistic models, thereby capturing complex non-linear stochastic relationships between the random variables. These advances, in conjunction with the release of novel probabilistic modeling toolboxes, have greatly expanded the scope of applications of probabilistic models, and allowed the models to take advantage of the recent strides made by the deep learning community. In this paper, we provide an overview of the main concepts, methods, and tools needed to use deep neural networks within a probabilistic modeling framework.
Open AccessProbabilistic Models with Deep Neural Networks
Recent advances in statistical inference have significantly expanded the toolbox of probabilistic modeling. Historically, probabilistic modeling has been constrained to very restricted model classes, where exact or approximate probabilistic inference is feasible. However, developments in variational inference, a general form of approximate probabilistic inference that originated in statistical physics, have enabled probabilistic modeling to overcome these limitations: (i) Approximate probabilistic inference is now possible over a broad class of probabilistic models containing a large number of parameters, and (ii) scalable inference methods based on stochastic gradient descent and distributed computing engines allow probabilistic modeling to be applied to massive data sets. One important practical consequence of these advances is the possibility to include deep neural networks within probabilistic models, thereby capturing complex non-linear stochastic relationships between the random variables. These advances, in conjunction with the release of novel probabilistic modeling toolboxes, have greatly expanded the scope of applications of probabilistic models, and allowed the models to take advantage of the recent strides made by the deep learning community. In this paper, we provide an overview of the main concepts, methods, and tools needed to use deep neural networks within a probabilistic modeling framework.
- Open Access
- 1 November 2020
- Published by Elsevier in Neurocomputing
- Vol. 415, 408-410
InferPy: Probabilistic modeling with deep neural networks made easy
- 1 November 2020
- Published by Elsevier in Neurocomputing
- Vol. 415, 408-410
Open AccessInferPy: Probabilistic modeling with deep neural networks made easy