2017
DOI: 10.1080/00401706.2017.1345700
|View full text |Cite
|
Sign up to set email alerts
|

Band Depth Clustering for Nonstationary Time Series and Wind Speed Behavior

Abstract: We explore the behavior of wind speed over time, using the Eastern Wind Dataset published by the National Renewable Energy Laboratory. This dataset gives wind speeds over three years at hundreds of potential wind farm sites. Wind speed analysis is necessary to the integration of wind energy into the power grid; short-term variability in wind speed affects decisions about usage of other power sources, so that the shape of the wind speed curve becomes as important as the overall level. To assess differences in i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(14 citation statements)
references
References 31 publications
0
14
0
Order By: Relevance
“…Bosq (2000), Horváth and Kokoszka (2012), Kokoszka and Reimherr (2017), but research on spatial fields or panels of time series of functions is relatively new, e.g. Kokoszka et al (2016), Gromenko et al (2016Gromenko et al ( , 2017, French et al (2016), Tupper et al (2017), Liu et al (2017), and Shang and Hyndman (2017). Testing separability of spatiotemporal functional data of the above form is investigated in Constantinou et al (2017), Aston et al (2017), and Bagchi and Dette (2017) under the assumption that the fields X n (⋅, ⋅), 1 ≤ n ≤ N, are independent.…”
Section: Introduction Supposementioning
confidence: 99%
“…Bosq (2000), Horváth and Kokoszka (2012), Kokoszka and Reimherr (2017), but research on spatial fields or panels of time series of functions is relatively new, e.g. Kokoszka et al (2016), Gromenko et al (2016Gromenko et al ( , 2017, French et al (2016), Tupper et al (2017), Liu et al (2017), and Shang and Hyndman (2017). Testing separability of spatiotemporal functional data of the above form is investigated in Constantinou et al (2017), Aston et al (2017), and Bagchi and Dette (2017) under the assumption that the fields X n (⋅, ⋅), 1 ≤ n ≤ N, are independent.…”
Section: Introduction Supposementioning
confidence: 99%
“…Combining these types of data leads to its own methodological questions, and points to the potential usefulness of the band distance. Euclidean distance is sensitive to the relative scaling of each dimension, and does not handle skewed data well; as discussed in [18], L p -norm distances also become less informative in high dimensions. The band distance, by contrast, uses only the ordering of the observations on each dimension, and so could accommodate features that are scaled differently, skewed, or even not strictly numeric (such as ordinal estimates of non-quantitative factors like those discussed in [9]).…”
Section: Discussionmentioning
confidence: 99%
“…An alternative method is to use the band distance introduced in [18]. This measure examines the dissimilarity of the rider curves at each pair of stops relative to the overall body of data, from all stops.…”
Section: Distance and Classificationmentioning
confidence: 99%
“…This clustering algorithm was used by numerous authors [14,19,41,55,57,58,74,78,86,139,141,149,150,159,[163][164][165][166][167], either by using the partitioning around medoids (PAM) introduced by Kaufman et al [168] or by using an MILP formulation introduced by Vinod et al [169] and used in several studies [14,41,55,57,139,159,164]. The MILP can be formulated as follows:…”
Section: Partitional Clusteringmentioning
confidence: 99%
“…However, it is unclear how it was guaranteed that different attributes were not compared to each other within the warping window which remains a field of future research. Furthermore, a band distance, which is also a pairwise rather than a pointwise distance measure, was used in a k-medoids algorithm by Tupper et al [167], leading to significantly less loss of load when deriving operational decisions for the next day using a stochastic optimization model.…”
Section: Time Shift-tolerant Clustering Algorithmsmentioning
confidence: 99%