Mondrian Forests under Limited and Contaminated Data
2026
MSc dissertation, marked at 80%
An empirical study of Mondrian forests against CART and random forests under changes in sample size, label noise and feature-space outliers. I implemented the method from the algorithms of Lakshminarayanan, Roy and Teh (2014) and ran every comparison on paired seeds. Choosing the lifetime by validation reduced excess error by a factor of 7 to 23.
Road-Collision Severity Prediction
Spring 2026
Research paper, Data Science with Machine Learning
Four classifiers compared on 29,628 police collision records from the East Midlands with nested cross-validation (10 outer folds, 3 inner). Random forest had the highest macro-F1 (0.555 ± 0.014) and came first in all ten outer folds. The lecturer chose the analysis as a teaching example for the 2026–27 cohort.
Spectral Clustering in Machine Learning
Autumn 2025
Group report (team of four), Statistical Machine Learning
I wrote the mathematical sections, from the graph Laplacian to the relaxations of RatioCut and the normalised cut as eigenvalue problems, with every step worked on an 11-node example graph. I also wrote the discussion and most of the conclusion.