Issue |
ITM Web Conf.
Volume 72, 2025
III International Workshop on “Hybrid Methods of Modeling and Optimization in Complex Systems” (HMMOCS-III 2024)
|
|
---|---|---|
Article Number | 03005 | |
Number of page(s) | 10 | |
Section | Interdisciplinary Mathematical Modeling and Applications | |
DOI | https://doi.org/10.1051/itmconf/20257203005 | |
Published online | 13 February 2025 |
Building a model for predicting fire dynamics
Department of Business Informatics and Business Process Modeling, Siberian Federal University, 79 Svobodny Ave., Krasnoyarsk, 660041, Russia
* Corresponding author: lev_kene@mail.ru
The paper compares known classification algorithms (logistic regression, k-nearest neighbors, support vector machine, stacking) on the problem of predicting the fire class. A feature of this problem is that it takes into account the specifics of the initial data at the exploratory analysis stage, i.e. before using the initial data by classification algorithms. First, at the exploratory analysis stage, it is necessary to solve the problem of selecting factors to predict the fire class. Second, check the initial data for gaps and outliers. Third, normalize the data in order to prepare them for building a model for predicting fire dynamics. Experimental studies are conducted on data on fires in the Krasnoyarsk Krai from 2010 to 2020.
© The Authors, published by EDP Sciences, 2025
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.