Abstract
Accurate electric load forecasting can prevent the waste of power resources and plays a crucial role in smart grid. The time series of electric load collected by smart meters are non-linear and non-stationary, which poses a great challenge to the traditional forecasting methods. In this paper, sparse representation model (SRM) is proposed as a novel approach to tackle this challenge. The main idea of SRM is to obtain sparse representation coefficients by the training set and the part of over-complete dictionary, and the rest part of over-complete dictionary multiplied with sparse representation coefficients can be used to predict the future load value. Experimental results demonstrate that SRM is capable of forecasting the complex electric load time series effectively. It outperforms some popular machine learning methods such as Neural Network, SVM, and Random Forest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zheng, J., Xu, C., Zhang, Z., Li, X.: Electric load forecasting in smart grids using long-short-term-memory based recurrent neural network. In: Information Sciences and Systems. IEEE (2017)
Ertugrul, Ö.F.: Forecasting electricity load by a novel recurrent extreme learning machines approach. Int. J. Electr. Power Energy Syst. 78, 429–435 (2016)
Zhang, Z., Xu, Y., Yang, J., Li, X., Zhang, D.: A survey of sparse representation: algorithms and applications. IEEE Access 3, 490–530 (2015)
Alfares, H., Nazeeruddin, M.: Electric load forecasting: literature survey and classification of methods. Int. J. Syst. Sci. 33(1), 23–34 (2002)
Weron, R.: Modeling and Forecasting Electricity Loads and Prices: A Statistical Approach, vol. 403. Wiley, Hoboken (2007)
Raza, M.Q., Khosravi, A.: A review on artificial intelligence based load demand forecasting techniques for smart grid and buildings. Renew. Sustain. Energy Rev. 50, 1352–1372 (2015)
Hinton, G.E., Osindero, S., Teh, Y.W.: A fast learning algorithm for deep belief nets. Neural Comput. 18(7), 1527–1554 (2006)
Kuremoto, T., Kimura, S., Kobayashi, K., Obayashi, M.: Time series forecasting using restricted Boltzmann machine. In: Huang, D.S., Gupta, P., Zhang, X., Premaratne, P. (eds.) ICIC 2012. CCIS, vol. 304, pp. 17–22. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31837-5_3
Busseti, E., Osband, I., Wong, S.: Deep learning for time series modeling. Technical report, Stanford University (2012)
Xiao, L., Wang, J., Yang, X., Xiao, L.: A hybrid model based on data preprocessing for electrical power forecasting. Int. J. Electr. Power Energy Syst. 64(64), 311–327 (2015)
Lewicki, M.S., Sejnowski, T.J.: Learning overcomplete representations. Neural Comput. 12(2), 337–365 (2000)
Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227–234 (1995)
Mallat, S.G., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397–3415 (1993)
Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: 1993 Conference Record of the Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, pp. 40–44. IEEE (1993)
Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655–4666 (2007)
Donoho, D.L.: For most large underdetermined systems of linear equations the minimal ℓ1-norm solution is also the sparsest solution. Commun. Pure Appl. Math. 59(6), 797–829 (2006)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129–159 (2001)
Qayyum, A., et al.: Designing of overcomplete dictionaries based on DCT and DWT. In: Biomedical Engineering & Sciences, pp. 134–139. IEEE (2016)
Daubechies, I.: The wavelet transform, time-frequency localization and signal analysis. IEEE Trans. Inf. Theory 36(5), 961–1005 (1990)
Do, M.N., Vetterli, M.: The contourlet transform: an efficient directional multiresolution image representation. IEEE Trans. Image Process. 14(12), 2091–2106 (2005)
Ma, J., Plonka, G.: The curvelet transform. IEEE Signal Process. Mag. 27(2), 118–133 (2010)
Lewis, J.J., O’Callaghan, R.J., Nikolov, S.G., Bull, D.R., Canagarajah, N.: Pixel- and region-based image fusion with complex wavelets. Inf. Fusion 8(2), 119–130 (2007)
Abdi, H., Williams, L.J.: Principal component analysis. Wiley Interdisc. Rev. Comput. Stat. 2(4), 433–459 (2010)
Engan, K., Aase, S.O., Husoy, J.H.: Method of optimal directions for frame design. In: Proceedings of the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 5, pp. 2443–2446. IEEE (1999)
Aharon, M., Elad, M., Bruckstein, A.: k-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311–4322 (2006)
Acknowledgement
This work is supported by the National Key R&D Program of China under Grant No. 2017YFB1002000; the National Natural Science Foundation of China under Grant No. 61772136, 61672159, 61772005; the Technology Innovation Platform Project of Fujian Province under Grant No. 2014H2005; the Research Project for Young and Middle-aged Teachers of Fujian Province under Grant No. JT180045; the Fujian Collaborative Innovation Center for Big Data Application in Governments; the Fujian Engineering Research Center of Big Data Analysis and Processing.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Huang, F., Zheng, X., Yu, Z., Yang, G., Guo, W. (2019). Electric Load Forecasting Based on Sparse Representation Model. In: Li, S. (eds) Green, Pervasive, and Cloud Computing. GPC 2018. Lecture Notes in Computer Science(), vol 11204. Springer, Cham. https://doi.org/10.1007/978-3-030-15093-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-15093-8_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15092-1
Online ISBN: 978-3-030-15093-8
eBook Packages: Computer ScienceComputer Science (R0)