<?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">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</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-2430-2025-61-2-159-174</article-id><article-id custom-type="elpub" pub-id-type="custom">vestifm-841</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>Классификация займа с использованием глубокой нейронной сети прямого распространения</article-title><trans-title-group xml:lang="en"><trans-title>Loan classification using a deep feed-forward neural network</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>Uladzimir I. Behunkou – Master of 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>Mikhail Y. Kovalyov – Dr. 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>11</day><month>07</month><year>2025</year></pub-date><volume>61</volume><issue>2</issue><fpage>159</fpage><lpage>174</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://vestifm.belnauka.by/jour/article/view/841">https://vestifm.belnauka.by/jour/article/view/841</self-uri><abstract><p>Разработана и проанализирована модель глубокой нейронной сети прямого распространения для решения задачи классификации финансового займа. С помощью этой модели на основе исторических данных по выданным ранее займам вычисляются значения следующих традиционных для машинного обучения метрик, которые определяют качество прогнозирования: стоимостная функция, истинность, точность, полнота и мера F1. Для получения большей точности прогнозирования использованы оптимизационные методы мини-пакетного градиентного спуска, градиентного спуска с импульсом, адаптивной оценки момента, а также метод исключения на нулевом уровне. Определена улучшенная структура предложенной нейронной сети, проанализировано воздействие использования так называемой инициализации He на итоговый результат, а также целесообразность применения конкретных алгоритмов оптимизации. Исследование показало, что использование глубокой нейронной сети прямого распространения целесообразно при разработке классификаторов займов.</p></abstract><trans-abstract xml:lang="en"><p>A deep feed-forward neural network model is developed and analyzed in this article to solve the financial loan classification problem. Using this model, based on historical data on previously issued loans, the values of the following traditional machine learning metrics that determine the quality of forecasting are calculated: cost function, truth, accuracy, completeness and F1 measure. In order to obtain greater forecasting accuracy, optimization methods of mini-batch gradient descent, gradient descent with momentum, adaptive momentum estimation, and zero-level elimination method were used. An improved structure of the proposed neural network was determined, the impact of the so-called He initialization on the final result was analyzed, as well as the efficiency of using specific optimization algorithms. The study showed that the use of deep feed-forward neural network is reasonable in developing loan classifiers.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>классификация займа</kwd><kwd>скоринг</kwd><kwd>глубокая нейронная сеть</kwd><kwd>машинное обучение</kwd></kwd-group><kwd-group xml:lang="en"><kwd>loan classification</kwd><kwd>scoring</kwd><kwd>deep neural network</kwd><kwd>machine learning</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. – С. 55–74. 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, № 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">Shalev-Shwartz, S. Understanding Machine Learning: From Theory to Algorithms / S. Shalev-Shwartz, S. Ben- David. – Cambridge University Press, 2014. – 397 p. https://doi.org/10.1017/CBO9781107298019</mixed-citation><mixed-citation xml:lang="en">Shalev-Shwartz S., Ben-David S. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, 2014. 397 p. https://doi.org/10.1017/CBO9781107298019.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Rumelhart, D. Learning representations by back-propagating errors / D. Rumelhart, G. Hinton, R. Williams // Nature. – 1986. – Vol. 323. – P. 533–536. https://doi.org/10.1038/323533a0</mixed-citation><mixed-citation xml:lang="en">Rumelhart D., Hinton G., Williams R. Learning representations by back-propagating errors. Nature, 1986, vol. 323, pp. 533–536. https://doi.org/10.1038/323533a0</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Geron, A. Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow / A. Geron. – 2nd ed. – O’Reilly Media, 2019. – 483 p.</mixed-citation><mixed-citation xml:lang="en">Geron A. Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow. 2nd ed. O’Reilly Media, 2019. 483 p.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Goodfellow, I. Deep Learning / I. Goodfellow, Y. Bengio, A. Courville. – MIT Press, 2016. – 800 p.</mixed-citation><mixed-citation xml:lang="en">Goodfellow I., Bengio Y., Courville A. Deep Learning. MIT Press, 2016. 800 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Glorot, X. Understanding the difficulty of training deep feedforward neural networks / X. Glorot, Y. Bengio // Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), 2010, Chia Laguna Resort, Sardinia, Italy. – 2010. – Vol. 9. – P. 249–256.</mixed-citation><mixed-citation xml:lang="en">Glorot X., Bengio Y. Understanding the difficulty of training deep feedforward neural networks. Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS) 2010, Chia Laguna Resort, Sardinia, Italy. Vol. 9. 2010, pp. 249–256.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Delving deep into rectifiers: Surpassing human-level performance on ImageNet classification / K. He, X. Zhang, S. Ren, J. Sun // Proceedings of the IEEE International Conference on Computer Vision (ICCV). – 2015. – P. 1026–1034. https://doi.org/10.1109/iccv.2015.123</mixed-citation><mixed-citation xml:lang="en">He K., Zhang X., Ren S., Sun J. Delving deep into rectifiers: Surpassing human-level performance on ImageNet classification. In Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2015, pp. 1026–1034. https://doi.org/10.1109/iccv.2015.123</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Efficient BackProp / Y. LeCun, L. Bottou, G. B. Orr, K.-R. Müller // Neural Networks: Tricks of the Trade. – Berlin; He idelberg: Springer, 1998. – P. 9–50. – (Lecture Notes in Computer Science; vol 1524). https://doi.org/10.1007/3-540-49430-8_2</mixed-citation><mixed-citation xml:lang="en">LeCun Y., Bottou L., Orr G. B., Müller K.-R. Efficient BackProp. Neural Networks: Tricks of the Trade. Lecture Notes in Computer Science, vol 1524. Berlin, Heidelberg, Springer, 1998, pp. 9–50. https://doi.org/10.1007/3-540-49430-8_2</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Roberts, S. W. Control chart tests based on geometric moving averages / S. W. Roberts // Technometrics. – 1958. – Vol. 1, № 3. – P. 239–250. https://doi.org/10.1080/00401706.1959.10489860</mixed-citation><mixed-citation xml:lang="en">Roberts S. W. Control chart tests based on geometric moving averages. Technometrics, 1958, vol. 1, no. 3, pp. 239– 250. https://doi.org/10.1080/00401706.1959.10489860</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Kingma, D. P. Adam: A Method for Stochastic Optimization / D. P. Kingma, J. Ba // Arxiv [Preprint]. – 2014. – URL: https://arxiv.org/abs/1412.6980; https://doi.org/10.48550/arXiv.1412.6980</mixed-citation><mixed-citation xml:lang="en">Kingma D. P., Ba J. Adam: A Method for Stochastic Optimization. Arxiv [Preprint], 2010. Available at: https://arxiv.org/abs/1412.6980; https://doi.org/10.48550/arXiv.1412.6980</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Dropout: A simple way to prevent neural networks from overfitting / N. Srivastava, G. Hinton, A. Krizhevsky [et al.] // Journal of Machine Learning Research. – 2014. – Vol. 15, № 1. – P. 1929–1958.</mixed-citation><mixed-citation xml:lang="en">Srivastava N., Hinton G., Krizhevsky A., Sutskever I., Salakhutdinov R. Dropout: A simple way to prevent neural networks from overfitting. Journal of Machine Learning Research, 2014, vol. 15, no. 1, pp. 1929–1958.</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>
