Efthyvoulos Drousiotis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Efthyvoulos Drousiotis has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Paul G. Spirakis
University of Liverpool
11 shared publications - Simon Maskell
University of Liverpool
10 shared publications - Alessandro Varsi
University of Liverpool
6 shared publications - Lei Shi
School of Computing, Newcastle University, Newcastle upon Tyne, United Kingdom
5 shared publications - Dan W. Joyce
University of Liverpool
2 shared publications - Panagiotis Pentaliotis
University of Liverpool
2 shared publications
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 97-112
A Shared Memory Optimal Parallel Redistribution Algorithm for SMC Samplers with Variable Size Samples
- 2 January 2026
- Published by Springer Nature
- p. 97-112
A Shared Memory Optimal Parallel Redistribution Algorithm for SMC Samplers with Variable Size Samples
- 22 June 2025
- Published by Springer Nature
- p. 315-328
Adversarial Attacks on Trees: Size Matters
- 3 January 2025
- Published by Springer Nature
- p. 123-137
An SMC Sampler for Decision Trees with Enhanced Initial Proposal for Stochastic Metaheuristic Optimization
- 3 January 2025
- Published by Springer Nature
- p. 123-137
An SMC Sampler for Decision Trees with Enhanced Initial Proposal for Stochastic Metaheuristic Optimization
- 3 January 2025
- Published by Springer Nature
- p. 169-184
Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler
- 3 January 2025
- Published by Springer Nature
- p. 169-184
Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler
- Open Access
- 2 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (1) , 14
A Massively Parallel SMC Sampler for Decision Trees
Bayesian approaches to decision trees (DTs) using Markov Chain Monte Carlo (MCMC) samplers have recently demonstrated state-of-the-art accuracy performance when it comes to training DTs to solve classification problems. Despite the competitive classification accuracy, MCMC requires a potentially long runtime to converge. A widely used approach to reducing an algorithm’s runtime is to employ modern multi-core computer architectures, either with shared memory (SM) or distributed memory (DM), and use parallel computing to accelerate the algorithm. However, the inherent sequential nature of MCMC makes it unsuitable for parallel implementation unless the accuracy is sacrificed. This issue is particularly evident in DM architectures, which normally provide access to larger numbers of cores than SM. Sequential Monte Carlo (SMC) samplers are a parallel alternative to MCMC, which do not trade off accuracy for parallelism. However, the performance of SMC samplers in the context of DTs is underexplored, and the parallelization is complicated by the challenges in parallelizing its bottleneck, namely redistribution, especially on variable-size data types such as DTs. In this work, we study the problem of parallelizing SMC in the context of DTs both on SM and DM. On both memory architectures, we show that the proposed parallelization strategies achieve asymptotically optimal time complexity. Numerical results are presented for a 32-core SM machine and a 256-core DM cluster. For both computer architectures, the experimental results show that our approach has comparable or better accuracy than MCMC but runs up to 51 times faster on SM and 640 times faster on DM. In this paper, we share the GitHub link to the source code.- 2 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (1) , 14
Open AccessA Massively Parallel SMC Sampler for Decision Trees
Bayesian approaches to decision trees (DTs) using Markov Chain Monte Carlo (MCMC) samplers have recently demonstrated state-of-the-art accuracy performance when it comes to training DTs to solve classification problems. Despite the competitive classification accuracy, MCMC requires a potentially long runtime to converge. A widely used approach to reducing an algorithm’s runtime is to employ modern multi-core computer architectures, either with shared memory (SM) or distributed memory (DM), and use parallel computing to accelerate the algorithm. However, the inherent sequential nature of MCMC makes it unsuitable for parallel implementation unless the accuracy is sacrificed. This issue is particularly evident in DM architectures, which normally provide access to larger numbers of cores than SM. Sequential Monte Carlo (SMC) samplers are a parallel alternative to MCMC, which do not trade off accuracy for parallelism. However, the performance of SMC samplers in the context of DTs is underexplored, and the parallelization is complicated by the challenges in parallelizing its bottleneck, namely redistribution, especially on variable-size data types such as DTs. In this work, we study the problem of parallelizing SMC in the context of DTs both on SM and DM. On both memory architectures, we show that the proposed parallelization strategies achieve asymptotically optimal time complexity. Numerical results are presented for a 32-core SM machine and a 256-core DM cluster. For both computer architectures, the experimental results show that our approach has comparable or better accuracy than MCMC but runs up to 51 times faster on SM and 640 times faster on DM. In this paper, we share the GitHub link to the source code. - Open Access
- 9 July 2024
- Published by Springer Nature in Research Square
Intrinsically Interpretable Decision Trees for Healthcare Applications
The deployment of machine learning for high-stakes decision support may demand algorithms that are intrinsically interpretable so that a model can be interrogated by a user to understand how the model arrived at an output given an input. Decision trees exemplify intrinsically interpretable machine learning but to achieve acceptable performance they rely on ensemble methods which sacrifice their interpretability because there is no single, or ‘canonical’ tree for the user to inspect. Sequential Monte Carlo Decision Trees are a novel method for training populations of decision trees that do not rely on ensembles or subspace sampling and achieve comparable performance to other tree-based methods. With SMC-DTs, each of the population of trees are trained on the entire feature space and each is a candidate for an intrinsically interpretable canonical decision tree. In this paper, we propose a tree-similarity algorithm to assist a user in choosing a final, canonical high-performing tree that is consistent (in structure) with other high-performing candidate trees. This enables the user to reduce the pool of candidates to a small number that can be inspected to select a final tree for deployment. We show that SMC-DTs are competitive with well-established methods Random Forest, Extreme Gradient Boosting Trees and Classification and Regression Trees on four benchmark health-related data sets. We then demonstrate the combination of SMC-DTs with the tree similarity method to derive and present an interpretable decision tree to identify university students likely to experience suicidal ideation using summary and administrative data university welfare services would be able to access for their students (i.e. without detailed clinical information). We conclude that combining SMC-DTs with tree-similarity offers a plausible way of delivering intrinsic interpretability for use in mixed-data type tabular data sets.
- 9 July 2024
- Published by Springer Nature in Research Square
Open AccessIntrinsically Interpretable Decision Trees for Healthcare Applications
The deployment of machine learning for high-stakes decision support may demand algorithms that are intrinsically interpretable so that a model can be interrogated by a user to understand how the model arrived at an output given an input. Decision trees exemplify intrinsically interpretable machine learning but to achieve acceptable performance they rely on ensemble methods which sacrifice their interpretability because there is no single, or ‘canonical’ tree for the user to inspect. Sequential Monte Carlo Decision Trees are a novel method for training populations of decision trees that do not rely on ensembles or subspace sampling and achieve comparable performance to other tree-based methods. With SMC-DTs, each of the population of trees are trained on the entire feature space and each is a candidate for an intrinsically interpretable canonical decision tree. In this paper, we propose a tree-similarity algorithm to assist a user in choosing a final, canonical high-performing tree that is consistent (in structure) with other high-performing candidate trees. This enables the user to reduce the pool of candidates to a small number that can be inspected to select a final tree for deployment. We show that SMC-DTs are competitive with well-established methods Random Forest, Extreme Gradient Boosting Trees and Classification and Regression Trees on four benchmark health-related data sets. We then demonstrate the combination of SMC-DTs with the tree similarity method to derive and present an interpretable decision tree to identify university students likely to experience suicidal ideation using summary and administrative data university welfare services would be able to access for their students (i.e. without detailed clinical information). We conclude that combining SMC-DTs with tree-similarity offers a plausible way of delivering intrinsic interpretability for use in mixed-data type tabular data sets.
- 25 October 2023
- Published by Springer Nature
- p. 318-331
Bayesian Decision Trees Inspired from Evolutionary Algorithms
- 25 October 2023
- Published by Springer Nature
- p. 318-331
Bayesian Decision Trees Inspired from Evolutionary Algorithms
- Open Access
- 2 July 2023
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (1) , 219-232
Single MCMC chain parallelisation on decision trees
Decision trees (DT) are highly famous in machine learning and usually acquire state-of-the-art performance. Despite that, well-known variants like CART, ID3, random forest, and boosted trees miss a probabilistic version that encodes prior assumptions about tree structures and shares statistical strength between node parameters. Existing work on Bayesian DT depends on Markov Chain Monte Carlo (MCMC), which can be computationally slow, especially on high dimensional data and expensive proposals. In this study, we propose a method to parallelise a single MCMC DT chain on an average laptop or personal computer that enables us to reduce its run-time through multi-core processing while the results are statistically identical to conventional sequential implementation. We also calculate the theoretical and practical reduction in run time, which can be obtained utilising our method on multi-processor architectures. Experiments showed that we could achieve 18 times faster running time provided that the serial and the parallel implementation are statistically identical.
- 2 July 2023
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (1) , 219-232
Open AccessSingle MCMC chain parallelisation on decision trees
Decision trees (DT) are highly famous in machine learning and usually acquire state-of-the-art performance. Despite that, well-known variants like CART, ID3, random forest, and boosted trees miss a probabilistic version that encodes prior assumptions about tree structures and shares statistical strength between node parameters. Existing work on Bayesian DT depends on Markov Chain Monte Carlo (MCMC), which can be computationally slow, especially on high dimensional data and expensive proposals. In this study, we propose a method to parallelise a single MCMC DT chain on an average laptop or personal computer that enables us to reduce its run-time through multi-core processing while the results are statistically identical to conventional sequential implementation. We also calculate the theoretical and practical reduction in run time, which can be obtained utilising our method on multi-processor architectures. Experiments showed that we could achieve 18 times faster running time provided that the serial and the parallel implementation are statistically identical.
- 1 June 2023
- Published by Springer Nature
- p. 475-487
Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation
- 1 June 2023
- Published by Springer Nature
- p. 475-487
Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation
- Open Access
- 30 September 2022
- Published by MDPI AG in Education Sciences
- Vol. 12 (10) , 671
Student Engagement, Learning Environments and the COVID-19 Pandemic: A Comparison between Psychology and Engineering Undergraduate Students in the UK
This study compared student learning engagement from two UK departments exploring their participation in face-to-face and synchronous online learning environments. Overall, 446 undergraduate students from Psychology (soft/non-Science, Technology, Engineering, and Mathematics (STEM) discipline) and Electrical Engineering and Electronics (EEE) (hard/STEM discipline) completed an online questionnaire over the second semester of the 2020–2021 academic year, where the teaching was mainly online. The questionnaire included validated scales regarding teaching and students’ characteristics and an open-ended question regarding the role of learning environments. There was a significant difference between the two learning environments in both departments, with most of the students believing that they were better engaged with their learning process in face-to-face environments (quantitative analysis). Additionally, the thematic analysis of student qualitative responses revealed that online student engagement was influenced by (1) Behaviour, (2) Affective, and (3) Cognitive challenges (i.e., additional workload, lack of communication and distractions in the home environment) and opportunities (i.e., the effective use of study time and online content through interactive learning environments). This study could assist academics, university policymakers, and researchers to understand student engagement alongside learning environments, reconsidering the opportunities and challenges that were gained from online learning due to the COVID-19 pandemic.
- 30 September 2022
- Published by MDPI AG in Education Sciences
- Vol. 12 (10) , 671
Open AccessStudent Engagement, Learning Environments and the COVID-19 Pandemic: A Comparison between Psychology and Engineering Undergraduate Students in the UK
This study compared student learning engagement from two UK departments exploring their participation in face-to-face and synchronous online learning environments. Overall, 446 undergraduate students from Psychology (soft/non-Science, Technology, Engineering, and Mathematics (STEM) discipline) and Electrical Engineering and Electronics (EEE) (hard/STEM discipline) completed an online questionnaire over the second semester of the 2020–2021 academic year, where the teaching was mainly online. The questionnaire included validated scales regarding teaching and students’ characteristics and an open-ended question regarding the role of learning environments. There was a significant difference between the two learning environments in both departments, with most of the students believing that they were better engaged with their learning process in face-to-face environments (quantitative analysis). Additionally, the thematic analysis of student qualitative responses revealed that online student engagement was influenced by (1) Behaviour, (2) Affective, and (3) Cognitive challenges (i.e., additional workload, lack of communication and distractions in the home environment) and opportunities (i.e., the effective use of study time and online content through interactive learning environments). This study could assist academics, university policymakers, and researchers to understand student engagement alongside learning environments, reconsidering the opportunities and challenges that were gained from online learning due to the COVID-19 pandemic.