4,038 research outputs found
Parameterizing the cost function of Dynamic Time Warping with application to time series classification
Dynamic Time Warping (DTW) is a popular time series distance measure that
aligns the points in two series with one another. These alignments support
warping of the time dimension to allow for processes that unfold at differing
rates. The distance is the minimum sum of costs of the resulting alignments
over any allowable warping of the time dimension. The cost of an alignment of
two points is a function of the difference in the values of those points. The
original cost function was the absolute value of this difference. Other cost
functions have been proposed. A popular alternative is the square of the
difference. However, to our knowledge, this is the first investigation of both
the relative impacts of using different cost functions and the potential to
tune cost functions to different tasks. We do so in this paper by using a
tunable cost function {\lambda}{\gamma} with parameter {\gamma}. We show that
higher values of {\gamma} place greater weight on larger pairwise differences,
while lower values place greater weight on smaller pairwise differences. We
demonstrate that training {\gamma} significantly improves the accuracy of both
the DTW nearest neighbor and Proximity Forest classifiers
Optimal Sparse Regression Trees
Regression trees are one of the oldest forms of AI models, and their
predictions can be made without a calculator, which makes them broadly useful,
particularly for high-stakes applications. Within the large literature on
regression trees, there has been little effort towards full provable
optimization, mainly due to the computational hardness of the problem. This
work proposes a dynamic-programming-with-bounds approach to the construction of
provably-optimal sparse regression trees. We leverage a novel lower bound based
on an optimal solution to the k-Means clustering algorithm in 1-dimension over
the set of labels. We are often able to find optimal sparse trees in seconds,
even for challenging datasets that involve large numbers of samples and
highly-correlated features.Comment: AAAI 2023, final archival versio
Modelling transport energy demand : a socio-technical approach
Peer reviewedPostprin
- âŠ