Fast Big Data Analytics for Smart Meter Data
Open Access
- 17 November 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 1, 1864-1871
Abstract
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
This publication has 21 references indexed in Scilit:
- Clustering of Electricity Consumption Behavior Dynamics Toward Big Data ApplicationsIEEE Transactions on Smart Grid, 2016
- Incremental Semi-Supervised Clustering Ensemble for High Dimensional Data ClusteringIEEE Transactions on Knowledge and Data Engineering, 2015
- Efficient Face Recognition Research Based on Random Projection Dimension Reduction2015
- Analysis and Clustering of Residential Customers Energy Behavioral Demand Using Smart Meter DataIEEE Transactions on Smart Grid, 2015
- Smart Electricity Meter Data Intelligence for Future Energy Systems: A SurveyIEEE Transactions on Industrial Informatics, 2015
- Identification of typical load profiles using K-means clustering algorithm2014
- Dimension Reduction with Coevolutionary Genetic Algorithm for Text Classification2014
- Dimension Selection for Feature Selection and Dimension Reduction with Principal and Independent Component AnalysisNeural Computation, 2007
- Survey of Clustering AlgorithmsIEEE Transactions on Neural Networks, 2005
- c-means clustering with the l/sub l/ and l/sub infinity / normsIEEE Transactions on Systems, Man, and Cybernetics, 1991