Random Forest Algorithm to Measure the Air Pollution Standard Index
This study uses the Random Forest algorithm to measure and predict the Air Pollution Standard Index (APSI) at Blimbing Banyuwangi Airport. Air pollution data, including concentrations of O3, CO, NO2, SO2, PM2.5, and PM10, were collected from air monitoring stations at the airport from April 15-30, 2...
Gespeichert in:
Veröffentlicht in: | Knowledge engineering and data science (Online) 2024-09, Vol.7 (1), p.86 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This study uses the Random Forest algorithm to measure and predict the Air Pollution Standard Index (APSI) at Blimbing Banyuwangi Airport. Air pollution data, including concentrations of O3, CO, NO2, SO2, PM2.5, and PM10, were collected from air monitoring stations at the airport from April 15-30, 2024. APSI measurement followed established formulas by relevant authorities. Data analysis utilized statistical approaches and computational algorithms. The findings reveal that air quality at the airport is generally "Moderate," with occasional "Good" days. The Random Forest algorithm effectively predicts APSI based on existing pollution data. These results provide insights for improving air pollution management at the airport and surrounding areas, emphasizing the need for continuous air quality monitoring. Days classified as "Moderate" suggest health risks for sensitive groups, indicating the need for targeted mitigation strategies. Recommendations include increasing green spaces, optimizing flight schedules to reduce peak pollution, and raising public awareness about air quality. The effectiveness of the Random Forest algorithm suggests its potential application in other airports for proactive air quality management. Future research could integrate real-time data and advanced machine learning models for more accurate and timelier APSI predictions. |
---|---|
ISSN: | 2597-4602 2597-4637 |
DOI: | 10.17977/um018v7i12024p86-100 |