000 04014naa a22005537i 4500
001 UMUN-OA-20261005-CS-049
003 local
005 20261005174812.0
006 m o d
007 cr||||||||||||
008 261005s2016 xx o u000 0 eng d
024 7 _a10.1007/s10618-016-0483-9
_2doi
035 _a(local)OpenAlex:W2555077524
040 _alocal
_beng
_clocal
041 0 _aeng
100 0 _aAnthony Bagnall
_eauthor.
245 1 4 _aThe great time series classification bake off: a review and experimental evaluation of recent algorithmic advances /
_cAnthony Bagnall; Jason Lines; Aaron Bostrom [and others].
264 1 _a[Place of publication not identified] :
_bSpringer Science+Business Media,
_c2016.
300 _a1 online resource (1 article).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aPublication type: Journal article.
500 _aLinked open-access copy: published version.
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 3 _aIn the last 5 years there have been a large number of new time series classification algorithms proposed in the literature. These algorithms have been evaluated on subsets of the 47 data sets in the University of California, Riverside time series classification archive. The archive has recently been expanded to 85 data sets, over half of which have been donated by researchers at the University of East Anglia. Aspects of previous evaluations have made comparisons between algorithms difficult. For example, several different programming languages have been used, experiments involved a single train/test split and some used normalised data whilst others did not. The relaunch of the archive provides a timely opportunity to thoroughly evaluate algorithms on a larger number of datasets. We have implemented 18 recently proposed algorithms in a common Java framework and compared them against two standard benchmark classifiers (and each other) by performing 100 resampling experiments on each of the 85 datasets. We use these results to test several hypotheses relating to whether the algorithms are significantly more accurate than the benchmarks and each other. Our results indicate that only nine of these algorithms are significantly more accurate than both benchmarks and that one classifier, the collective of transformation ensembles, is significantly more accurate than all of the others. All of our experiments and results are reproducible: we release all of our code, results and experimental details and we hope these experiments form the basis for more robust testing of new algorithms in the future.
540 _aCreative Commons Attribution. See the linked licence for the applicable terms.
_uhttp://creativecommons.org/licenses/by/4.0
546 _aIn English.
588 0 _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.
590 _aCourse allocation: B. Sc. Computer Science.
650 4 _atime series classification
650 4 _abenchmark dataset
650 4 _aalgorithm comparison
650 4 _aclassification accuracy
650 4 _areproducibility
650 4 _aJava implementation
653 _aB. Sc. Computer Science
653 _aUMUN open access collection
653 _aalgorithms
655 4 _aJournal articles.
700 0 _aJason Lines
_eauthor.
700 0 _aAaron Bostrom
_eauthor.
700 0 _aJames Large
_eauthor.
700 0 _aEamonn Keogh
_eauthor.
773 0 _tData Mining and Knowledge Discovery
_gVol. 31, no. 3, (2016), pages/article 606-660
_x1384-5810
856 4 0 _uhttps://europepmc.org/articles/PMC6404674
_yRead open-access publication
_zOpen access.
_70
884 _aCourse selection and automated MARC21 enrichment from OpenAlex metadata.
_g20261005
_khttps://openalex.org/W2555077524
_qlocal
942 _n0
999 _c411
_d411