Hybrid least squares support vector machines for short term predictive analysis

Moth-flame Optimization (MFO) algorithm is a relatively new optimization algorithm which is classified as Swarm Intelligence (SI). It is inspired by unique behavior of moths in nature. Despite its young age, this algorithm has been proven to be able to address many optimization problems. With respec...

Full description

Bibliographic Details
Main Authors: Zuriani, Mustaffa, Ernawan, Ferda, M. H., Sulaiman, Syafiq Fauzi, Kamarulzaman
Format: Conference or Workshop Item
Language:English
English
Published: Institute of Electrical and Electronics Engineers Inc. 2017
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/17656/
http://umpir.ump.edu.my/id/eprint/17656/
http://umpir.ump.edu.my/id/eprint/17656/1/Hybrid%20Least%20Squares%20Support%20Vector%20Machines%20for%20Short%20Term%20Predictive%20Analysis.pdf
http://umpir.ump.edu.my/id/eprint/17656/7/Hybrid%20Least%20Squares%20Support%20Vector%20Machines%20for%20Short%20Term%20Predictive%20Analysis%201.pdf
Description
Summary:Moth-flame Optimization (MFO) algorithm is a relatively new optimization algorithm which is classified as Swarm Intelligence (SI). It is inspired by unique behavior of moths in nature. Despite its young age, this algorithm has been proven to be able to address many optimization problems. With respect to that matter, this work introduces a new hybrid approach of MFO with Least Squares Support Vector Machines (termed as MFO-LSSVM). With such hybridization, the LSSVM hyper-parameters are fine-tuned by the MFO. Hence, the generalization in prediction can be improved. Realized in load data, the efficiency of the proposed model is compared against three comparable hybrid algorithms and measured based on three statistical criteria. An experimental study demonstrate that the MFO-LSSVM is able to produce better prediction results compared to the identified hybrid algorithms. Therefore the established hybrid model presents the potential to be applied to short term load prediction.