Speeding up similarity search under dynamic time warping by pruning unpromising alignments (Q1741398)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7050707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up similarity search under dynamic time warping by pruning unpromising alignments |
scientific article; zbMATH DE number 7050707 |
Statements
Speeding up similarity search under dynamic time warping by pruning unpromising alignments (English)
0 references
3 May 2019
0 references
time series
0 references
similarity search
0 references
dynamic time warping
0 references
0.8067682981491089
0 references
0.7944309711456299
0 references
0.7784209251403809
0 references
0.7678233981132507
0 references
0.749478816986084
0 references
