1 code implementation • 28 Jan 2024 • Angus Dempster, Geoffrey I. Webb, Daniel F. Schmidt
Logistic regression is a ubiquitous method for probabilistic classification.
no code implementations • 2 Nov 2023 • Xueying Long, Quang Bui, Grady Oktavian, Daniel F. Schmidt, Christoph Bergmeir, Rakshitha Godahewa, Seong Per Lee, Kaifeng Zhao, Paul Condylis
We are able to show the differences in characteristics of the e-commerce and brick-and-mortar retail datasets.
no code implementations • 13 Oct 2023 • Loong Kuan Lee, Geoffrey I. Webb, Daniel F. Schmidt, Nico Piatkowski
Doing so tractably is non-trivial as we need to decompose the divergence between these distributions and therefore, require a decomposition over the marginal and conditional distributions of these models.
1 code implementation • 2 Aug 2023 • Angus Dempster, Daniel F. Schmidt, Geoffrey I. Webb
We show that it is possible to achieve the same accuracy, on average, as the most accurate existing interval methods for time series classification on a standard set of benchmark datasets using a single type of feature (quantiles), fixed intervals, and an 'off the shelf' classifier.
2 code implementations • 19 May 2023 • Ali Ismail-Fawaz, Angus Dempster, Chang Wei Tan, Matthieu Herrmann, Lynn Miller, Daniel F. Schmidt, Stefano Berretti, Jonathan Weber, Maxime Devanne, Germain Forestier, Geoffrey I. Webb
The measurement of progress using benchmarks evaluations is ubiquitous in computer science and machine learning.
1 code implementation • 7 Nov 2022 • Shu Yu Tew, Daniel F. Schmidt, Enes Makalic
A particular strength of our approach is that the M-step depends only on the form of the prior and it is independent of the form of the likelihood.
1 code implementation • 25 Mar 2022 • Angus Dempster, Daniel F. Schmidt, Geoffrey I. Webb
We present HYDRA, a simple, fast, and accurate dictionary method for time series classification using competing convolutional kernels, combining key aspects of both ROCKET and conventional dictionary methods.
2 code implementations • 16 Dec 2020 • Angus Dempster, Daniel F. Schmidt, Geoffrey I. Webb
ROCKET achieves state-of-the-art accuracy with a fraction of the computational expense of most existing methods by transforming input time series using random convolutional kernels, and using the transformed features to train a linear classifier.
10 code implementations • 11 Sep 2019 • Hassan Ismail Fawaz, Benjamin Lucas, Germain Forestier, Charlotte Pelletier, Daniel F. Schmidt, Jonathan Weber, Geoffrey I. Webb, Lhassane Idoumghar, Pierre-Alain Muller, François Petitjean
TSC is the area of machine learning tasked with the categorization (or labelling) of time series.
no code implementations • 8 Jan 2018 • Daniel F. Schmidt, Enes Makalic
Simulations show that the adaptive log-$t$ procedure appears to always perform well, irrespective of the level of sparsity or signal-to-noise ratio of the underlying model.