2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) 2019
DOI: 10.1109/itnec.2019.8729249
|View full text |Cite
|
Sign up to set email alerts
|

A Power Load Clustering Method Based on Limited DTW Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…However, the most common one is setting a window for warping, restricting the path to the diagonal region. Different structures of warping windows are proposed in [17] and dynamic time window strategy is presented in [18].…”
Section: Missing Value Treatmentmentioning
confidence: 99%
“…However, the most common one is setting a window for warping, restricting the path to the diagonal region. Different structures of warping windows are proposed in [17] and dynamic time window strategy is presented in [18].…”
Section: Missing Value Treatmentmentioning
confidence: 99%
“…Existing studies have effectively improved DTW and suppressed pathological alignments. The LimitDTW algorithm was proposed in [17] to restrict the search area to the regions close to the diagonal area of the distance matrix. However, limiting the number of connection points may cause incorrect alignment owing to its rigidity.…”
Section: Introductionmentioning
confidence: 99%
“…There are a lot of methods have been designed and proposed [7][8][9][10][11][12][13][14] to increase the quality of similarity measurement. Euclidean distance (ED) [7] and dynamic time warping distance (DTW) [8] are two typical examples.…”
Section: Introductionmentioning
confidence: 99%