2016
DOI: 10.1016/j.epsr.2016.05.023
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic clustering of residential electricity consumption time series data based on Hausdorff distance

Abstract: As the analysis of electrical loads is reaching data measured from low voltage power distribution networks, there is a need for the main agents involved in the operation and management of the power grids to segment the end users as a function of their shapes of daily energy consumption or load profiles, and to obtain patterns that allow to classify the users in groups based on how they consume the energy. However, this analysis is usually limited to the analysis of single days. Since the smart metering data ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(11 citation statements)
references
References 10 publications
0
11
0
Order By: Relevance
“…A few studies in the literature have addressed the "dynamic"/"online" clustering of load data and the problem of big data. Dynamic clustering of time series data is considered in [104] and [105] to deal with the dynamic evolution of the consumption data through time. The presented framework in [104] for dynamic clustering of load curves compares the performance of K-means and FCM algorithms with different similarity measures including the Euclidean distance, the Pearson correlation coefficient, and another measure called Hausdorff distance.…”
Section: Future Trendsmentioning
confidence: 99%
“…A few studies in the literature have addressed the "dynamic"/"online" clustering of load data and the problem of big data. Dynamic clustering of time series data is considered in [104] and [105] to deal with the dynamic evolution of the consumption data through time. The presented framework in [104] for dynamic clustering of load curves compares the performance of K-means and FCM algorithms with different similarity measures including the Euclidean distance, the Pearson correlation coefficient, and another measure called Hausdorff distance.…”
Section: Future Trendsmentioning
confidence: 99%
“…SG failures deals with fault status detection, fault type classification, power distribution reliability. [3], [26], [40], [75], [84], [94], [112], [129], [160], [167], [173], [204], [212], [214], [232], [233], [239], [245]), power consumption pattern recognition ( [7], [44], [49], [64], [67], [131], [150], [153], [183], [265], [266]), power load forecasting ( [56], [250]), events/tasks extraction ( [50])…”
Section: B Rq2mentioning
confidence: 99%
“…Other algorithms such as follow-the-leader [3], density-based spatial clustering of applications with noise (DBSCAN) [12], [13], and K-shapes [14] are examined in some publications. Since the consumption values are continuously recorded over time, dynamic [15], [16] and online [17], [18] clusterings of time series data are also considered in a few studies.…”
Section: Clustering Of Householdsmentioning
confidence: 99%