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

A hybrid method based on a new clustering technique and multilayer perceptron neural networks for hourly solar radiation forecasting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
46
0
2

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 125 publications
(48 citation statements)
references
References 23 publications
0
46
0
2
Order By: Relevance
“…The objective of a clustering algorithm is to identify groups of similar objects, where objects in a cluster are more similar to each other than objects in different clusters (Halkidi et al, 2001). This study applied the well-known and commonly-used k-means clustering technique (MacQueen, 1967;Azimi et al, 2016;Bae et al, 2017). According to Hartigan and Wong (1979), the aim of the k-means algorithm is to divide m objects in n dimensions into k (where k ≤ n) partitions (or clusters), such that the within-cluster sum of squares is minimised.…”
Section: Methods 31 the K-means Clustering Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The objective of a clustering algorithm is to identify groups of similar objects, where objects in a cluster are more similar to each other than objects in different clusters (Halkidi et al, 2001). This study applied the well-known and commonly-used k-means clustering technique (MacQueen, 1967;Azimi et al, 2016;Bae et al, 2017). According to Hartigan and Wong (1979), the aim of the k-means algorithm is to divide m objects in n dimensions into k (where k ≤ n) partitions (or clusters), such that the within-cluster sum of squares is minimised.…”
Section: Methods 31 the K-means Clustering Methodsmentioning
confidence: 99%
“…According to Hartigan and Wong (1979), the aim of the k-means algorithm is to divide m objects in n dimensions into k (where k ≤ n) partitions (or clusters), such that the within-cluster sum of squares is minimised. The similarity between a pair of objects is defined by their distance, where the Euclidean distance is often used as a distance measure (Azimi et al, 2016). In the present study, each object is a daily profile of CC.…”
Section: Methods 31 the K-means Clustering Methodsmentioning
confidence: 99%
“…raw data clustering and classification to create multiple homogeneous data groups with uniform patterns, for facilitating more efficient AI learning processes and leading to better prediction performances. Data classification methods observed in this review include principal component analysis [204], k-means clustering algorithm [205], k-fold cross validation [206], decision tree, SVM [207], and game theoretic self-organising map (GTSOM) [208]. Significant performance improvements were observed in these studies relative to model formulation without data classification.…”
Section: Referencesmentioning
confidence: 97%
“…The results revealed good concordance among measures, and estimates with RMSE ranged from 2.727 to 2.807 MJ m À2 . There are several ML models and the Artificial Neural Network (ANN) and Support Vector Machine (SVM) are the most widely used [12][13][14][15][16]. Yadav and Chandel [13] reviewed the main studies in the literature using ANN to estimate solar radiation.…”
Section: Introductionmentioning
confidence: 99%