Efthyvoulos Drousiotis

University of Liverpool | UoL · School of Electrical Engineering, Electronics and Computer Science

Bayesian Decision Trees (DTs) are generally considered a more advanced and accurate model than a regular Decision Tree (DT) as they can handle complex and uncertain data. Existing work on Bayesian DTs uses Markov Chain Monte Carlo (MCMC) with an accept-reject mechanism and sample using naive proposals to proceed to the next iteration. This method c...

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 Bay...

Environmental stressors combined with a predisposition to experience mental health problems increase the risk for SI (Suicidal Ideation) among college/university students. However, university health and wellbeing services know little about machine learning methods and techniques to identify as early as possible students with higher risk. We develop...

Bayesian Decision Trees (DTs) are generally considered a more advanced and accurate model than a regular Decision Tree (DT) because they can handle complex and uncertain data. Existing work on Bayesian DTs uses Markov Chain Monte Carlo (MCMC) with an accept-reject mechanism and sample using naive proposals to proceed to the next iteration, which ca...

Environmental stressors combined with a predisposition to experience mental health problems increase the risk for SI (Suicidal Ideation) among college/university students. However, university health and wellbeing services know little about machine learning methods and techniques to identify as early as possible students with higher risk. We develop...

Decision trees 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...

Markov Chain Monte Carlo (MCMC) is a well-established family of algorithms primarily used in Bayesian statistics to sample from a target distribution when direct sampling is challenging. Existing work on Bayesian decision trees uses MCMC. Unfortunately, this can be slow, especially when considering large volumes of data. It is hard to parallelise t...

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/...

Decision trees 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...

Decision Forests have attracted the academic community’s interest mainly due to their simplicity and transparency. This paper proposes two novel decision forest building techniques, called Maximal Information Coefficient Forest (MICF) and Pearson’s Correlation Coefficient Forest (PCCF). The proposed new algorithms use Pearson’s Correlation Coeffici...

As the largest distance learning university in the UK, the Open University has more than 250,000 students enrolled, making it also the largest academic institute in the UK. However, many students end up failing or withdrawing from online courses, which makes it extremely crucial to identify those “at risk” students and inject necessary intervention...

This study aims to explore and improve ways of handling a continuous variable dataset, in order to predict student dropout in MOOCs, by implementing various models, including the ones most successful across various domains, such as recurrent neural network (RNN), and tree-based algorithms. Unlike existing studies, we arguably fairly compare each al...