Ben Halstead

Ben Halstead

Auto-generated profile, based on publicly available information

Ben Halstead

School of Computer Science University of Auckland New Zealand

Research Focus & Metrics

Academic Career Length

6Years (2021-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.

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

18 August 2024 in arXiv
Verified
Preprint
Open access
PDF file
BHBen Halstead
Ben Halstead
YKYun Sing Koh
Yun Sing Koh
PRPatricia Riddle
Patricia Riddle
MPMykola Pechenizkiy
Mykola Pechenizkiy
Albert BifetAlbert Bifet
Albert Bifet
The distribution of streaming data often changes over time as conditions change, a phenomenon known as concept drift. Only a subset of previous experience, collected in similar conditions, is relevant to learning an accurate classifier for current data. Learning from irrelevant experience describing a different concept can degrade performance. A system learning from streaming data must identify which recent experience is irrelevant when conditions change and which past experience is relevant when concepts reoccur, \textit{e.g.,} when weather events or financial patterns repeat. Existing streaming approaches either do not consider experience to change in relevance over time and thus cannot handle concept drift, or only consider the recency of experience and thus cannot handle recurring concepts, or only sparsely evaluate relevance and thus fail when concept drift is missed. To enable learning in changing conditions, we propose SELeCT, a probabilistic method for continuously evaluating the relevance of past experience. SELeCT maintains a distinct internal state for each concept, representing relevant experience with a unique classifier. We propose a Bayesian algorithm for estimating state relevance, combining the likelihood of drawing recent observations from a given state with a transition pattern prior based on the system's current state.