<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">dan</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады Национальной академии наук Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady of the National Academy of Sciences of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-8323</issn><issn pub-type="epub">2524-2431</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.29235/1561-8323-2025-69-2-101-108</article-id><article-id custom-type="elpub" pub-id-type="custom">dan-1241</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATICS</subject></subj-group></article-categories><title-group><article-title>Классификация займа c использованием алгоритма случайного леса и сравнительный анализ с другими классификаторами</article-title><trans-title-group xml:lang="en"><trans-title>Loan classification using random forest algorithm and comparative analysis with other classifiers</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Бегунков</surname><given-names>В. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Behunkou</surname><given-names>U. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Бегунков Владимир Иванович – магистр технических наук</p><p>ул. Сурганова, 6, 220012, Минск</p></bio><bio xml:lang="en"><p>Behunkou Uladzimir I. – Master of Sciences (Engineering)</p><p>6, Surganov Str., 220012, Minsk</p></bio><email xlink:type="simple">vbegunkov@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ковалёв</surname><given-names>М. Я.</given-names></name><name name-style="western" xml:lang="en"><surname>Kovalyov</surname><given-names>M. Y.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ковалёв Михаил Яковлевич – член-корреспондент, д-р физ.-мат. наук, профессор</p><p>ул. Сурганова, 6, 220012, Минск</p></bio><bio xml:lang="en"><p>Kovalyov Mikhail Y. – Corresponding Member, D. Sc. (Physics and Mathematics), Professor</p><p>6, Surganov Str., 220012, Minsk</p></bio><email xlink:type="simple">kovalyov_my@newman.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Объединенный институт проблем информатики Национальной академии наук Беларуси</institution></aff><aff xml:lang="en"><institution>United Institute of Informatics Problems of the National Academy of Sciences of Belarus</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>06</day><month>05</month><year>2025</year></pub-date><volume>69</volume><issue>2</issue><fpage>101</fpage><lpage>108</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Бегунков В.И., Ковалёв М.Я., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Бегунков В.И., Ковалёв М.Я.</copyright-holder><copyright-holder xml:lang="en">Behunkou U.I., Kovalyov M.Y.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.belnauka.by/jour/article/view/1241">https://doklady.belnauka.by/jour/article/view/1241</self-uri><abstract><p>Целью исследования является анализ использования алгоритма случайного леса для решения задачи классификации займа и проведение сравнительного анализа с результатами, полученными при использовании логистической регрессии, нейронной сети прямого распространения и глубокой нейронной сети прямого распространения. В результате исследований определены лучшее максимальное количество входных показателей и лучшее количество деревьев в ансамбле при использовании алгоритма случайного леса, исследовано воздействие альтернативного разбиения данных на тренировочный и тестовый наборы на точность прогнозирования модели при использовании алгоритма случайного леса. В заключение предложена стратегия решения задачи классификации займа на основе исследованных ранее классификаторов.</p></abstract><trans-abstract xml:lang="en"><p>The study aims to analyze the application of the random forest algorithm in addressing the loan classification issue. Furthermore, it intends to perform a comparative analysis by juxtaposing the outcomes with those derived from logistic regression, feedforward neural network, and deep feedforward neural network models. The research determined the ideal maximum number of input indicators and the ideal number of trees in the ensemble when utilizing the random forest algorithm. Additionally, it explored the impact of alternative data partitioning into training and test sets on the accuracy of model forecasting with the random forest algorithm. In conclusion, a strategy for addressing the loan classification issue using the classifiers studied has been proposed.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>классификация займа</kwd><kwd>скоринг</kwd><kwd>машинное обучение</kwd><kwd>алгоритм случайного леса</kwd><kwd>сравнительный анализ классификаторов</kwd></kwd-group><kwd-group xml:lang="en"><kwd>loan classification</kwd><kwd>scoring</kwd><kwd>machine learning</kwd><kwd>random forest algorithm</kwd><kwd>comparative analysis of classifiers</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Бегунков, В. И. Классификация займов c использованием логистической регрессии / В. И. Бегунков, М. Я. Ковалев // Информатика. – 2023. − Т. 20, № 1. – С. 55–74. https://doi.org/10.37661/1816-0301-2023-20-1-55-74</mixed-citation><mixed-citation xml:lang="en">Behunkou U. I., Kovalyov M. Y. Loan classification using logistic regression. Informatics, 2023, vol. 20, no. 1, pp. 55–74 (in Russian). https://doi.org/10.37661/1816-0301-2023-20-1-55-74</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Бегунков, В. И. Классификация займа с использованием нейронной сети прямого распространения / В. И. Бегунков // Информатика. – 2024. − Т. 21, № 1. – С. 83–104. https://doi.org/10.37661/1816-0301-2024-21-1-83-104</mixed-citation><mixed-citation xml:lang="en">Behunkou U. I. Loan classification using a feed-forward neural network. Informatics, 2024, vol. 21, no. 1, pp. 83–104 (in Russian). https://doi.org/10.37661/1816-0301-2024-21-1-83-104</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Benchmarking state-of-the-art classification algorithms for credit scoring: an update of research / S. Lessmann, B. Baesens, H.-V. Seow, L. C. Thomas // European Journal of Operational Research. – 2015. – Vol. 247, N 1. – P. 124–136. https://doi.org/10.1016/j.ejor.2015.05.030</mixed-citation><mixed-citation xml:lang="en">Lessmann S., Baesens B., Seow H.-V., Thomas L. C. Benchmarking state-of-the-art classification algorithms for credit scoring: an update of research. European Journal of Operational Research, 2015, vol. 247, no. 1, pp. 124–136. https://doi.org/10.1016/j.ejor.2015.05.030</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Quinlan, J. R. Induction of Decision Trees / J. R. Quinlan // Machine Learning. – 1986. – Vol. 1, N 1. – P. 81–106. https://doi.org/10.1007/bf00116251</mixed-citation><mixed-citation xml:lang="en">Quinlan J. R. Induction of Decision Trees. Machine Learning, 1986, vol. 1, pp. 81–106. https://doi.org/10.1007/bf00116251</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Classification and Regression Trees / L. Breiman, J. H. Friedman, R. A. Olshen, C. J. Stone. – New York, 1984. – 368 p. https://doi.org/10.1201/9781315139470</mixed-citation><mixed-citation xml:lang="en">Breiman L., Friedman J. H., Olshen R. A., Stone C. J. Classification and Regression Trees. New York, 1984. 368 p. https://doi.org/10.1201/9781315139470</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Hastie, T. The elements of statistical learning: Data mining, inference, and prediction / T. Hastie, R. Tibshirani, J. Friedman. – New York, 2009. – 3d ed. – P. 308–310. https://doi.org/10.1007/978-0-387-84858-7</mixed-citation><mixed-citation xml:lang="en">Hastie T., Tibshirani R., Friedman J. The elements of statistical learning: Data mining, inference, and prediction. 3d ed. New York, 2009, pp. 308–310. https://doi.org/10.1007/978-0-387-84858-7</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Breiman L. Random Forests / L. Breiman // Machine Learning. – 2001. – Vol. 45. – P. 5–32. https://doi.org/10.1023/a:101093340432</mixed-citation><mixed-citation xml:lang="en">Breiman L. Random Forests. Machine Learning, 2001, vol. 45, pp. 5–32. https://doi.org/10.1023/a:1010933404324</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
