2021
DOI: 10.1016/j.egyr.2021.08.049
|View full text |Cite
|
Sign up to set email alerts
|

Clustering analysis of typical scenarios of island power supply system by using cohesive hierarchical clustering based K-Means clustering method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(17 citation statements)
references
References 5 publications
0
16
0
1
Order By: Relevance
“…This iterative process persists until no more items are left to designate as new clusters. The primary objective of the algorithm is to optimize the grouping of items into clusters, refining the centroids with each iteration (Niu et al, 2021;Sinan et al, 2023;Wang et al, 2023).…”
Section: K-means Clustering Methodsmentioning
confidence: 99%
“…This iterative process persists until no more items are left to designate as new clusters. The primary objective of the algorithm is to optimize the grouping of items into clusters, refining the centroids with each iteration (Niu et al, 2021;Sinan et al, 2023;Wang et al, 2023).…”
Section: K-means Clustering Methodsmentioning
confidence: 99%
“…Clustering-based techniques streamline load forecasting by grouping similar load patterns, which aids in managing the variability from different energy sources and consumer behaviors. Techniques like K-means, hierarchical clustering, combined locally linear embedding (LLE), principal component analysis (PCA), and multi-layer perceptrons (MLPs), enhance accuracy, integrate renewable energy sources (RESs), aid demandside management (DSM), and bolster SG functions [15,[43][44][45][46]80]. Time series load forecasting (TSLF) methods utilize historical data, enhanced by advanced algorithms such as ARIMA and neural networks, to predict future demand.…”
Section: Comprehensive Approaches To Forecastingmentioning
confidence: 99%
“…The main idea of this algorithm is to define one K-center for each cluster, the cluster center must be randomly selected [22]. Euclidean distance can be found using Equation 1 [23].…”
Section: K-meansmentioning
confidence: 99%