no code implementations • 4 Mar 2019 • Brijnesh Jain
The literature postulates that the dynamic time warping (dtw) distance can cope with temporal variations but stores and processes time series in a form as if the dtw-distance cannot cope with such variations.
1 code implementation • 15 Oct 2018 • Vincent Froese, Brijnesh Jain, Rolf Niedermeier, Malte Renken
Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs.
no code implementations • 7 Sep 2018 • Brijnesh Jain
Furthermore, they conjectured that such inaccuracies are caused by the lack of triangle inequality.
no code implementations • 24 Oct 2017 • Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh Jain, Rolf Niedermeier, David Schultz
Dynamic time warping constitutes a major tool for analyzing time series.
no code implementations • 24 Mar 2017 • Brijnesh Jain, David Schultz
The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification.
no code implementations • 23 Jan 2017 • David Schultz, Brijnesh Jain
The class of subgradient methods generalizes existing sample mean algorithms such as DTW Barycenter Averaging (DBA).
no code implementations • 18 Dec 2015 • Brijnesh Jain
Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering.
no code implementations • 17 Feb 2015 • Brijnesh Jain
Results indicate that generalized gradient learning via elastic functions have the potential to complement the state-of-the-art in statistical pattern recognition on time series.
no code implementations • 30 May 2014 • Brijnesh Jain
We prove that there is no class-dual for almost all sublinear models on graphs.