IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v9y2023i6idhcseit2390684.html

A Machine Learning Framework for AI-Based Wildfire Risk Assessment

Author

Listed:
  • Paril Ghori

Abstract

Forest fires pose a severe risk to both the environment and human life, often causing extensive damage to ecosystems and property. With the growing impact of climate change, including rising temperatures and prolonged droughts, the frequency and intensity of forest fires have increased significantly. Effective early detection and intervention are crucial to minimizing these impacts. In recent years, machine learning (ML) techniques have been applied to forest fire prediction to improve early warning systems. This study aims to reduce the risk and impact of forest fires by predicting their occurrence ahead of time using machine learning. A dataset, sourced from NASA's Oak Ridge National Laboratory (ORNL), containing detailed environmental and forest-related factors, was used for this purpose. Preprocessing steps were applied to prepare the data for classification, including feature selection techniques that narrowed down the dataset from 35 to the most relevant features. Various machine learning algorithms—Support Vector Machine (SVM), Decision Tree (DT), Random Forest (RF), Gradient Boosting (GB), K-Nearest Neighbor (K-NN), and Naive Bayes (NB)—were employed for classification. The performance of the models was evaluated, and hyperparameter optimization was performed to select the best parameters. The Random Forest model achieved an impressive accuracy of 97%, closely followed by Naive Bayes at 96%, highlighting the effectiveness of these algorithms in predicting forest fires.

Suggested Citation

  • Paril Ghori, 2023. "A Machine Learning Framework for AI-Based Wildfire Risk Assessment," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 9(6), pages 422-434, November.
  • Handle: RePEc:jbh:ijsrcs:v9:y2023:i6:id:hcseit2390684
    Note: Article URL: https://ijsrcseit.com/CSEIT2390684
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT2390684
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT2390684.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v9:y2023:i6:id:hcseit2390684. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.