default search action
Matthieu Herrmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Matthieu Herrmann, Chang Wei Tan
, Geoffrey I. Webb:
Parameterizing the cost function of dynamic time warping with application to time series classification. Data Min. Knowl. Discov. 37(5): 2024-2045 (2023) - [j3]Chang Wei Tan
Ultra-fast meta-parameter optimization for time series similarity measures with application to nearest neighbour classification. Knowl. Inf. Syst. 65(5): 2123-2157 (2023) - [j2]Matthieu Herrmann
Amercing: An intuitive and effective constraint for dynamic time warping. Pattern Recognit. 137: 109333 (2023) - [i8]Matthieu Herrmann, Chang Wei Tan, Geoffrey I. Webb:
Parameterizing the cost function of Dynamic Time Warping with application to time series classification. CoRR abs/2301.10350 (2023) - [i7]Matthieu Herrmann, Chang Wei Tan, Mahsa Salehi
Proximity Forest 2.0: A new effective and scalable similarity-based classifier for time series. CoRR abs/2304.05800 (2023) - [i6]Ali Ismail-Fawaz, Angus Dempster, Chang Wei Tan, Matthieu Herrmann, Lynn Miller
An Approach to Multiple Comparison Benchmark Evaluations that is Stable Under Manipulation of the Comparate Set. CoRR abs/2305.11921 (2023) - 2021
- [j1]Matthieu Herrmann
Early abandoning and pruning for elastic distances including dynamic time warping. Data Min. Knowl. Discov. 35(6): 2577-2601 (2021) - [c3]Chang Wei Tan
Ultra fast warping window optimization for Dynamic Time Warping. ICDM 2021: 589-598 - [i5]Matthieu Herrmann, Geoffrey I. Webb:
Early Abandoning and Pruning for Elastic Distances. CoRR abs/2102.05221 (2021) - [i4]Matthieu Herrmann, Geoffrey I. Webb:
Amercing: An Intuitive, Elegant and Effective Constraint for Dynamic Time Warping. CoRR abs/2111.13314 (2021) - 2020
- [i3]Ann E. Nicholson, Kevin B. Korb, Erik P. Nyberg, Michael Wybrow, Ingrid Zukerman, Steven Mascaro, Shreshth Thakur, Abraham Oshni Alvandi, Jeff Riley, Ross Pearson
BARD: A structured technique for group elicitation of Bayesian networks to support analytic reasoning. CoRR abs/2003.01207 (2020) - [i2]Matthieu Herrmann, Geoffrey I. Webb:
Early Abandoning PrunedDTW and its application to similarity search. CoRR abs/2010.05371 (2020)
2010 – 2019
- 2018
- [c2]Chang Wei Tan
Efficient search of the best warping window for Dynamic Time Warping. SDM 2018: 225-233 - 2016
- [i1]Matthieu Herrmann
On the dependent conjunction and implication. CoRR abs/1606.06005 (2016) - 2011
- [c1]Alexandra Jimborean
VMAD: A virtual machine for advanced dynamic analysis of programs. ISPASS 2011: 125-126
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: