<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>04014naa a22005537i 4500</leader>
  <controlfield tag="001">UMUN-OA-20261005-CS-049</controlfield>
  <controlfield tag="003">local</controlfield>
  <controlfield tag="005">20261005174812.0</controlfield>
  <controlfield tag="006">m     o  d        </controlfield>
  <controlfield tag="007">cr||||||||||||</controlfield>
  <controlfield tag="008">261005s2016    xx      o    u000 0 eng d</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/s10618-016-0483-9</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(local)OpenAlex:W2555077524</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">local</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">local</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Anthony Bagnall</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="4">
    <subfield code="a">The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances /</subfield>
    <subfield code="c">Anthony Bagnall; Jason Lines; Aaron Bostrom [and others].</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">[Place of publication not identified] :</subfield>
    <subfield code="b">Springer Science+Business Media,</subfield>
    <subfield code="c">2016.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">1 online resource (1 article).</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Publication type: Journal article.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Linked open-access copy: published version.</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access; no subscription required for the linked open-access version.</subfield>
    <subfield code="f">Unrestricted online access</subfield>
    <subfield code="2">star</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">In 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.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution. See the linked licence for the applicable terms.</subfield>
    <subfield code="u">http://creativecommons.org/licenses/by/4.0</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">In English.</subfield>
  </datafield>
  <datafield tag="588" ind1="0" ind2=" ">
    <subfield code="a">Description generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">Course allocation: B. Sc. Computer Science.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">time series classification</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">benchmark dataset</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">algorithm comparison</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">classification accuracy</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">reproducibility</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">Java implementation</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">B. Sc. Computer Science</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">UMUN open access collection</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">algorithms</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">Journal articles.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Jason Lines</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Aaron Bostrom</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">James Large</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Eamonn Keogh</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Data Mining and Knowledge Discovery</subfield>
    <subfield code="g">Vol. 31, no. 3, (2016), pages/article 606-660</subfield>
    <subfield code="x">1384-5810</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://europepmc.org/articles/PMC6404674</subfield>
    <subfield code="y">Read open-access publication</subfield>
    <subfield code="z">Open access.</subfield>
    <subfield code="7">0</subfield>
  </datafield>
  <datafield tag="884" ind1=" " ind2=" ">
    <subfield code="a">Course selection and automated MARC21 enrichment from OpenAlex metadata.</subfield>
    <subfield code="g">20261005</subfield>
    <subfield code="k">https://openalex.org/W2555077524</subfield>
    <subfield code="q">local</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="n">0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">411</subfield>
    <subfield code="d">411</subfield>
  </datafield>
</record>
