A power load forecast approach based on spatial‐temporal clustering of load data. (11th December 2017)

• Record Type: Journal Article
• Authors: Zhang, Wei; Mu, Gang; Yan, Gangui; An, Jun
• Other Names: Barbosa Jorge G. guestEditor.; Jeannot Emmanuel guestEditor.; Li Maozhen guestEditor.
• Is Part Of: Concurrency and computation. Volume 30:Number 23(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-12-11
• Subjects: clustering -- load forecast -- MapReduce -- power system -- spatial‐temporal; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4386
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Load forecast is very important for power system operation. Pursuing higher accuracy of load forecast is always the major target of this field. The existence of bad historical load data could badly affect the forecast accuracies of time series–based load forecast techniques. Within the multi‐node load data, the outliers of them are merely appeared instantaneously; the bad impact of the outliers could be decreased by making use of the spatial relativity of multi‐node load data. A novel load forecasting approach based on spatial‐temporal feature clustering is proposed in this paper. The temporal regular load pattern is extracted from the total load for an individual node. The spatial distribution characteristics of the individual incremental load have been categorized by the k ‐medoids clustering algorithm. The MapReduce computing mode is used to manipulate multi‐node load data to raise computation efficiency. This new forecasting approach could reduce the influence of outliers and provide reliable and efficient load forecast with high accuracy. Testing in a real power system data set with up to 6.6% of outliers, the results of this approach show a lower forecasting error, about 6.2%, compared with three other time series–based methods (between 9.8% and 10.6%).