activity
20182026
most citedComprehensive Algorithm Portfolio Evaluation using Item Response Theory

5 citations · 9 across the 21 of their papers we have counts for

collaborators

24 papers

cs.LG2026

Transfer Learning of Keystroke Dynamics for Cross-Device User Authentication

Nuwan Kaluarachchi, Sevvandi Kandanaarachchi, Kristen Moore +2

Keystroke dynamics (typing patterns) can be used as a behavioural biometric modality for user authentication, with applications such as fraud prevention. While the modality has bee…

math.OC2026

A Combinatorial Optimisation Approach to Multi-factorial Gap-filling in Genome-scale Metabolic Models (GEMs)

Philip Kilby, Sevvandi Kandanaarachchi, Matthew J. Morgan +4

Genome-Scale Metabolic Models (GEMs) describe the interactions between genes, proteins, and the biochemical reactions that underpin an organism's metabolism aiming to computational…

stat.ME2026

When lookout sees crackle: Anomaly detection via kernel density estimation

Rob J Hyndman, Sevvandi Kandanaarachchi, Katharine Turner

We present an updated version of lookout -- an algorithm for detecting anomalies using kernel density estimates with bandwidth based on Rips death diameters -- with theoretical gua…

cs.LG2026

Flowette: Flow Matching with Graphette Priors for Graph Generation

Asiri Wijesinghe, Sevvandi Kandanaarachchi, Daniel M. Steinberg +1

We study generative modeling of graphs with recurring subgraph motifs. We propose Flowette, a continuous flow matching framework that employs a graph neural network-based transform…

cs.LG2025

Revisiting Pre-processing Group Fairness: A Modular Benchmarking Framework

Brodie Oldfield, Ziqi Xu, Sevvandi Kandanaarachchi

As machine learning systems become increasingly integrated into high-stakes decision-making processes, ensuring fairness in algorithmic outcomes has become a critical concern. Meth…

stat.ML2025

A pseudo-inverse of a line graph

Sevvandi Kandanaarachchi, Philip Kilby, Cheng Soon Ong

Line graphs are an alternative representation of graphs where each vertex of the original (root) graph becomes an edge. However not all graphs have a corresponding root graph, henc…