Search Results for author:
Found 7 papers, 5 papers with code
An Approach to Multiple Comparison Benchmark Evaluations that is Stable Under Manipulation of the Comparate Set
The measurement of progress using benchmarks evaluations is ubiquitous in computer science and machine learning.
Proximity Forest 2.0: A new effective and scalable similarity-based classifier for time series
Time series classification (TSC) is a challenging task due to the diversity of types of feature that may be relevant for different classification tasks, including trends, variance, frequency, magnitude, and various patterns.
Parameterizing the cost function of Dynamic Time Warping with application to time series classification
The cost of an alignment of two points is a function of the difference in the values of those points.
Amercing: An Intuitive, Elegant and Effective Constraint for Dynamic Time Warping
CDTW and WDTW have been introduced because DTW is too permissive in its alignments.
Early Abandoning and Pruning for Elastic Distances including Dynamic Time Warping
This threshold, provided by the similarity search process, also allows to early abandon the computation of a distance itself.
Early Abandoning PrunedDTW and its application to similarity search
We show that EAPrunedDTW significantly improves the computation time of similarity search in the UCR Suite, and renders lower bounds dispensable.
BARD: A structured technique for group elicitation of Bayesian networks to support analytic reasoning
In many complex, real-world situations, problem solving and decision making require effective reasoning about causation and uncertainty.
