dynamic time warping algorithm with optional constraints#250
Draft
lewardo wants to merge 158 commits intoflucoma:mainfrom
Draft
dynamic time warping algorithm with optional constraints#250lewardo wants to merge 158 commits intoflucoma:mainfrom
lewardo wants to merge 158 commits intoflucoma:mainfrom
Conversation
…into dtime-warp
…lly check the max length dynamically zero pad ceil(log10(maxlen)) zero padding would do but maybe we should store a new "maxlength" key
# Conflicts: # include/clients/nrt/DataSeriesClient.hpp # include/data/FluidJSON.hpp
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
@weefuzzy @tremblap @AlexHarker
Beginning of the implementation of the DTW and FastDTW algorithms now that #247 allows time-based manipulation, the pr is mostly for discussion about interface until something functional is built (branch
data-seriesmerged in from lewardo/flucoma-core@7d15aaf)Interface is still up for discussion, since it is merely a complicated but funkier version of a distance between two tensors (take that pythagoras). Algorithms such as
KMeanswould benefit very much from this algorithm, henceDTWandFastDTWbeing functors is an interesting paradigm to explore, so that there is not as much refactoring for distance-using objects.As a proof of concept it will be the distance algorithm used in the
kNearestinterface indataSeries(as provided bydataSetwith squared euclidian distance)