Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Gavin C. Cawley

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with James Large

> Home > Persons > Gavin C. Cawley

Publications

2021
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2105-03841
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2105-03841
Matthew Middlehurst, James Large, Gavin C. Cawley, Anthony J. Bagnall:
The Temporal Dictionary Ensemble (TDE) Classifier for Time Series Classification. CoRR abs/2105.03841 (2021)
2020
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/pkdd/MiddlehurstLCB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/MiddlehurstLCB20
Matthew Middlehurst, James Large, Gavin C. Cawley, Anthony J. Bagnall:
The Temporal Dictionary Ensemble (TDE) Classifier for Time Series Classification. ECML/PKDD (1) 2020: 660-676
2018
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1809-06705
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1809-06705
Anthony J. Bagnall, Aaron Bostrom, Gavin C. Cawley, Michael Flynn, James Large, Jason Lines:
Is rotation forest the best classifier for problems with continuous features? CoRR abs/1809.06705 (2018)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.