Patricia Riddle

Patricia Riddle

Auto-generated profile, based on publicly available information

Patricia Riddle

School of Computer Science, University of Auckland, Auckland, New Zealand

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 May 2021 in Machine Learning
Verified
Journal Article
Closed access
PDF file
BHBen Halstead
Ben Halstead
YKYun Sing Koh
Yun Sing Koh
PRPatricia Riddle
Patricia Riddle
RPRussel Pears
Russel Pears
MPMykola Pechenizkiy
Mykola Pechenizkiy
GCGuy Coulson
Guy Coulson

12 May 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
BHBen Halstead
Ben Halstead
YKYun Sing Koh
Yun Sing Koh
PRPatricia Riddle
Patricia Riddle
MPMykola Pechenizkiy
Mykola Pechenizkiy
Albert BifetAlbert Bifet
Albert Bifet
Learning from streaming data is challenging as the distribution of incoming data may change over time, a phenomenon known as concept drift. The predictive patterns, or experience learned under one distribution may become irrelevant as conditions change under concept drift, but may become relevant once again when conditions reoccur. Adaptive learning methods adapt a classifier to concept drift by identifying which distribution, or concept , is currently present in order to determine which experience is relevant. Identifying a concept requires some representation to be stored for comparison, with the quality of the representation being key to accurate identification. Existing concept representations are based on meta-features, efficient univariate summaries of a concept. However, no single meta-feature can fully represent a concept, leading to severe accuracy loss when existing representations cannot describe concept drift. To avoid these failure cases, we propose the first general framework for combining a diverse range of meta-features into a single representation. We solve two main challenges, first presenting a method of efficiently computing, storing, and querying an arbitrary set of meta-features as a single representation, showing that a combination of meta-features may successfully avoid failure cases seen with existing methods. Second, we present the first method for dynamically learning which meta-features distinguish concepts in any given dataset, significantly improving performance. Our proposed approach enables state-of-the-art feature selection methods, such as mutual information, to be applied to concept representation meta-features for the first time. We investigate tradeoffs between memory budget and classification performance, observing accuracy increases of up to 16% by dynamically weighting the contribution of each meta-feature.

29 November 2022 in BMC Medical Informatics and Decision Making
Verified
Journal Article
Open access
PDF file
WHWilliam Hsu
William Hsu
JWJames R. Warren
James R. Warren
PRPatricia J. Riddle
Patricia J. Riddle
Background: Chronic conditions place a considerable burden on modern healthcare systems. Within New Zealand and worldwide cardiovascular disease (CVD) affects a significant proportion of the population and it is the leading cause of death. Like other chronic diseases, the course of cardiovascular disease is usually prolonged and its management necessarily long-term. Despite being highly effective in reducing CVD risk, non-adherence to long-term medication continues to be a longstanding challenge in healthcare delivery. The study investigates the benefits of integrating patient history and assesses the contribution of explicitly temporal models to medication adherence prediction in the context of lipid-lowering therapy.Methods: Data from a CVD risk assessment tool is linked to routinely collected national and regional data sets including pharmaceutical dispensing, hospitalisation, lab test results and deaths. The study extracts a sub-cohort from 564,180 patients who had primary CVD risk assessment for analysis. Based on community pharmaceutical dispensing record, proportion of days covered (PDC) $$\ge$$≥ 80 is used as the threshold for adherence. Two years (8 quarters) of patient history before their CVD risk assessment is used as the observation window to predict patient adherence in the subsequent 5 years (20 quarters). The predictive performance of temporal deep learning models long short-term memory (LSTM) and simple recurrent neural networks (Simple RNN) are compared against non-temporal models multilayer perceptron (MLP), ridge classifier (RC) and logistic regression (LR). Further, the study investigates the effect of lengthening the observation window on the task of adherence prediction.Results: Temporal models that use sequential data outperform non-temporal models, with LSTM producing the best predictive performance achieving a ROC AUC of 0.805. A performance gap is observed between models that can discover non-linear interactions between predictor variables and their linear counter parts, with neural network (NN) based models significantly outperforming linear models. Additionally, the predictive advantage of temporal models become more pronounced when the length of the observation window is increased.Conclusion: The findings of the study provide evidence that using deep temporal models to integrate patient history in adherence prediction is advantageous. In particular, the RNN architecture LSTM significantly outperforms all other model comparators.

13 June 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
XRXiaobin Ren
Xiaobin Ren
KZKaiqi Zhao
Kaiqi Zhao
PRPatricia J. Riddle
Patricia J. Riddle
KTKaterina Taskova
Katerina Taskova
QPQingyi Pan
Qingyi Pan
LLLianyan Li
Lianyan Li
Missing data imputation for location-based sensor data has attracted much attention in recent years. The state-of-the-art imputation methods based on graph neural networks have a priori assumption that the spatial correlations between sensor locations are static. However, real-world data sets often exhibit dynamic spatial correlations. This paper proposes a novel approach to capturing the dynamics of spatial correlations between geographical locations as a composition of the constant, long-term trends and periodic patterns. To this end, we design a new method called Dynamic Adjacency Matrix Representation (DAMR) that extracts various dynamic patterns of spatial correlations and represents them as adjacency matrices. The adjacency matrices are then aggregated and fed into a well-designed graph representation learning layer for predicting the missing values. Through extensive experiments on six real-world data sets, we demonstrate that DAMR reduces the MAE by up to 19.4% compared with the state-of-the-art methods for the missing value imputation task

14 February 2021 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
BHBen Halstead
Ben Halstead
YKYun Sing Koh
Yun Sing Koh
PRPatricia Riddle
Patricia Riddle
RPRussel Pears
Russel Pears
MPMykola Pechenizkiy
Mykola Pechenizkiy
Albert BifetAlbert Bifet
Albert Bifet