z-logo
open-access-imgOpen Access
Air Pollution Prediction using Machine Learning Algorithms
Author(s) -
Hanan Aljuaid,
Norah Alwabel
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.f1026.0986s319
Subject(s) - mean squared error , support vector machine , decision tree , air pollution , machine learning , air quality index , regression , regression analysis , algorithm , multivariate statistics , random forest , statistics , computer science , data mining , artificial intelligence , mathematics , meteorology , geography , chemistry , organic chemistry
Air pollution has a serious impact on human health. It occurs because of natural and man-made factors. The major contribution of this research is that it provides a comparison between different methodologies and techniques of mathematical and machine learning models. The process began with integrating data from different sources at different time interval. The preprocessing phase resulted in two different datasets: one-hour and five-minute datasets. Next, we established a forecasting model for particulate matter PM2.5, which is one of the most prevalent air pollutants and its concentration affects air quality. Additionally, we completed a multivariate analysis to predict the PM2.5 value and check the effects of other air pollutants, traffic, and weather. The algorithms used are support vector regression, k-nearest neighbors and decision tree models. The results showed that for the one-hour data set, of the three algorithms, support vector regression has the least root-mean-square error (RMSE) and also lowest value in mean absolute error (MAE). Alternatively, for the five-minute dataset, we found that the auto-regression model showed the least RMSE and MAE; however, this model only predicts short-term PM2.5.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here