2017 IEEE 14th International Scientific Conference on Informatics 2017
DOI: 10.1109/informatics.2017.8327236
|View full text |Cite
|
Sign up to set email alerts
|

Energy load forecast using S2S deep neural networks with k-Shape clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 6 publications
0
10
0
Order By: Relevance
“…It employs a deep embedded clustering which is able to extract the new features and forms the clusters jointly. A combination of deep neural networks and K-shape clustering is used in [108] for load forecasting. Ryu et al [109] propose a joint deep learning and clustering process that captures daily and seasonal variations.…”
Section: Future Trendsmentioning
confidence: 99%
“…It employs a deep embedded clustering which is able to extract the new features and forms the clusters jointly. A combination of deep neural networks and K-shape clustering is used in [108] for load forecasting. Ryu et al [109] propose a joint deep learning and clustering process that captures daily and seasonal variations.…”
Section: Future Trendsmentioning
confidence: 99%
“…Further, the household energy demand is much more volatile than an aggregated load of multiple households, meaning researchers need to consider other external inputs such as occupancy behavior, building characteristics, and even income and employment status (Ramokone et al, 2020;Yuce et al, 2017). Regarding grid control, researchers leverage clustering algorithms on households before training their models to ensure that volatile patterns do not become an issue and increase accuracy (Aurangzeb et al, 2021;Jarábek et al, 2018;Khan & Jayaweera, 2018).…”
Section: Resultsmentioning
confidence: 99%
“…In this study, the K-shape algorithm developed by Paparrizos and Gravano ( 38 ) is used, which proposes a normalized version of the cross-correlation measure. It has been verified to perform well in creating homogeneous and well-separated clusters ( 39 ). The theory of the K-shape algorithm is introduced as follows.…”
Section: Methodsmentioning
confidence: 99%