.png){kind=icon}
Return
Fast Big Data Analytics for Smart Meter Data
.png){kind=icon}
OA
AI
DOI：10.1109/OJCOMS.2020.3038590.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A polar projection-based algorithm is proposed to reduce the computational complexity associated with dimension reduction in unsupervised learning. This algorithm employs K-means clustering. A new distance metric is developed to account for peak consumption in cluster consumer load profiles. It is used to cluster the load profiles according to both total and peak consumption. To accelerate the clustering process, a stochastic-based approach is developed to reduce the search space to find the cluster centers. Numerical results are presented which show a significant reduction in computational complexity using both polar-based and stochastic-based clustering compared to conventional approaches. Further, the estimation error is low.
Keywords:
Clustering
computational complexity
dimension reduction
smart grid
Journal
I
IF:
4.3
Papers:
1.7K
Citations:
991
Organization
Cited Papers
Identification of one novel causative mutation in exon 4 of WFS1 gene in two Italian siblings with classical DIDMOAD syndrome phenotype.png)
Gene
GeneIF0
PREAI
ShareSave
ShareSaveShareSave
View more