Matthieu Herrmann

Orcid: 0000-0002-0074-470X

According to our database1, Matthieu Herrmann authored at least 14 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Parameterizing the cost function of dynamic time warping with application to time series classification.
Data Min. Knowl. Discov., September, 2023

Amercing: An intuitive and effective constraint for dynamic time warping.
Pattern Recognit., May, 2023

Ultra-fast meta-parameter optimization for time series similarity measures with application to nearest neighbour classification.
Knowl. Inf. Syst., May, 2023

An Approach to Multiple Comparison Benchmark Evaluations that is Stable Under Manipulation of the Comparate Set.
CoRR, 2023

Proximity Forest 2.0: A new effective and scalable similarity-based classifier for time series.
CoRR, 2023

2021
Early abandoning and pruning for elastic distances including dynamic time warping.
Data Min. Knowl. Discov., 2021

Amercing: An Intuitive, Elegant and Effective Constraint for Dynamic Time Warping.
CoRR, 2021

Early Abandoning and Pruning for Elastic Distances.
CoRR, 2021

Ultra fast warping window optimization for Dynamic Time Warping.
Proceedings of the IEEE International Conference on Data Mining, 2021

2020
Early Abandoning PrunedDTW and its application to similarity search.
CoRR, 2020

BARD: A structured technique for group elicitation of Bayesian networks to support analytic reasoning.
CoRR, 2020

2018
Efficient search of the best warping window for Dynamic Time Warping.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

2016
On the dependent conjunction and implication.
CoRR, 2016

2011
VMAD: A virtual machine for advanced dynamic analysis of programs.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2011


  Loading...