<?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">finance</journal-id><journal-title-group><journal-title xml:lang="ru">Финансы: теория и практика/Finance: Theory and Practice</journal-title><trans-title-group xml:lang="en"><trans-title>Finance: Theory and Practice</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2587-5671</issn><issn pub-type="epub">2587-7089</issn><publisher><publisher-name>Financial University under The Government of Russian Federation</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26794/2587-5671-2023-27-1-103-115</article-id><article-id custom-type="elpub" pub-id-type="custom">finance-1991</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>NEW BANKING TECHNOLOGIES</subject></subj-group></article-categories><title-group><article-title>Комбинированная схема отбора признаков для разработки банковских моделей</article-title><trans-title-group xml:lang="en"><trans-title>Combined Feature Selection Scheme for Banking Modeling</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5119-507X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Афанасьев</surname><given-names>С. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Afanasyev</surname><given-names>S. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Сергей Владимирович Афанасьев - магистрант; вице-президент, начальник управления статистического анализа</p><p>Москва</p></bio><bio xml:lang="en"><p>Sergey V. Afanasiev - Master’s student; Vice President, Head of the Statistical Analysis Department</p><p>Moscow</p></bio><email xlink:type="simple">svafanasev@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6102-0222</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Котерева</surname><given-names>Д. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Kotereva</surname><given-names>D. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Диана Маратовна Котерева - магистрант; руководитель направления моделирования и оперативного анализа</p><p>Москва</p></bio><bio xml:lang="en"><p>Diana M. Kotereva - Master’s student; Head of Modeling and Operational Analysis Department</p><p>Moscow</p></bio><email xlink:type="simple">dmkotereva@edu.hse.ru</email><xref ref-type="aff" rid="aff-2"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5754-8825</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мироненков</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Mironenkov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Алексей Алексеевич Мироненков - старший преподаватель кафедры эконометрики и математических методов экономики Московской школы экономики</p><p>Москва</p></bio><bio xml:lang="en"><p>Alexey A. Mironenkov - Senior Lecturer at the Department of Econometrics and Mathematical Methods of Economics Moscow School of Economics</p><p>Moscow</p></bio><email xlink:type="simple">mironenkov@mse-msu.ru</email><xref ref-type="aff" rid="aff-3"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1836-1555</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Смирнова</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Smirnova</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Анастасия Андреевна Смирнова - магистрант; начальник отдела разработки и анализа эффективности скоринговых систем</p><p>Москва</p></bio><bio xml:lang="en"><p>Anastasiya A. Smirnova - Master’s student; Head of Scoring Systems Department</p><p>Moscow</p></bio><email xlink:type="simple">aasmirnova_24@edu.hse.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Национальный исследовательский университет «Высшая школа экономики»;  КБ «Ренессанс Кредит»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research University Higher School of Economics; Renaissance Credit Bank</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Национальный исследовательский университет «Высшая школа экономики»; КБ «Ренессанс Кредит»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research University Higher School of Economics; Renaissance Credit Bank</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-3"><aff xml:lang="ru"><institution>Московский государственный университет имени М. В. Ломоносова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Lomonosov Moscow State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>10</day><month>03</month><year>2023</year></pub-date><volume>27</volume><issue>1</issue><fpage>103</fpage><lpage>115</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Афанасьев С.В., Котерева Д.М., Мироненков А.А., Смирнова А.А., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Афанасьев С.В., Котерева Д.М., Мироненков А.А., Смирнова А.А.</copyright-holder><copyright-holder xml:lang="en">Afanasyev S.V., Kotereva D.M., Mironenkov A.A., Smirnova A.A.</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://financetp.fa.ru/jour/article/view/1991">https://financetp.fa.ru/jour/article/view/1991</self-uri><abstract><p>Методы машинного обучения успешно применяются в самых разных областях банковского кредитования. За годы их применения банки накопили огромные массивы данных о заемщиках. С одной стороны, это позволило более точно предсказывать поведение заемщика, с другой — породило проблему избыточности данных, которая сильно усложняет разработку моделей. Чтобы решить эту проблему применяют методы отбора признаков, позволяющие повысить качество моделей. Эти методы делятся на три типа: фильтры, обертки и вложения. Фильтры являются простыми и быстрыми методами, при использовании которых можно находить одномерные зависимости. Обертки и вложения позволяют более качественно проводить отбор признаков, поскольку учитывают многомерную зависимость, однако данные методы требуют значительных вычислительных ресурсов и могут плохо работать на больших высокоразмерных выборках. В данной статье авторы предлагают схему комбинированного отбора признаков CFSS, в которой на первых этапах отбора используются грубые фильтры, а на финальных — обертки для более качественного отбора. Такая архитектура повышает качество и скорость отбора признаков на больших высокоразмерных выборках для промышленного моделирования в банковских задачах. Проведенные авторами эксперименты для четырех типов банковских задач (анкетный скоринг, поведенческий скоринг, отклик клиентов на кросс-сейл предложение и взыскание просроченной задолженности) показали, что предложенный метод работает лучше, чем классические методы, содержащие только фильтры или только обертки.</p></abstract><trans-abstract xml:lang="en"><p>Machine learning methods have been successful in various aspects of bank lending. Banks have accumulated huge amounts of data about borrowers over the years of application. On the one hand, this made it possible to predict borrower behavior more accurately, on the other, it gave rise to the problem a problem of data redundancy, which greatly complicates the model development. Methods of feature selection, which allows to improve the quality of models, are apply to solve this problem. Feature selection methods can be divided into three main types: filters, wrappers, and embedded methods. Filters are simple and time-efficient methods that may help discover one-dimensional relations. Wrappers and embedded methods are more effective in feature selection, because they account for multi-dimensional relationships, but these methods are resource-consuming and may fail to process large samples with many features. In this article, the authors propose a combined feature selection scheme (CFSS), in which the first stages of selection use coarse filters, and on the final — wrappers for high-quality selection. This architecture lets us increase the quality of selection and reduce the time necessary to process large multi-dimensional samples, which are used in the development of industrial models. Experiments conducted by authors for four types of bank modelling tasks (survey scoring, behavioral scoring, customer response to cross-selling, and delayed debt collection) have shown that the proposed method better than classical methods containing only filters or only wrappers.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>отбор признаков</kwd><kwd>машинное обучение</kwd><kwd>значимость переменных</kwd><kwd>фильтры</kwd><kwd>обертки</kwd><kwd>вложения</kwd></kwd-group><kwd-group xml:lang="en"><kwd>feature selection</kwd><kwd>machine learning</kwd><kwd>feature importance</kwd><kwd>filters</kwd><kwd>wrappers</kwd><kwd>embedded methods</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда (проект No. 20-68-47030). Московский государственный университет им. М.В. Ломоносова, Москва, Россия.</funding-statement><funding-statement xml:lang="en">The research was carried out at the expense of a grant from the Russian Science Foundation (project No. 20- 68-47030). Lomonosov Moscow State University, Moscow, Russia.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Guyon I., Elisseeff A. An introduction to variable and feature selection. Journal of Machine Learning Research. 2003;3(7–8):1157–1182. DOI: 10.1162/153244303322753616</mixed-citation><mixed-citation xml:lang="en">Guyon I., Elisseeff A. An introduction to variable and feature selection. Journal of Machine Learning Research. 2003;3(7–8):1157–1182. DOI: 10.1162/153244303322753616</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Hamon J. Optimisation combinatoire pour la sélection de variables en régression en grande dimension: Application en génétique animale. Docteur en Informatique Thèse. Lille: Université des Sciences et Technologie de Lille; 2013. 160 p. URL: https://core.ac.uk/download/pdf/51213307.pdf</mixed-citation><mixed-citation xml:lang="en">Hamon J. Optimisation combinatoire pour la sélection de variables en régression en grande dimension: Application en génétique animale. Docteur en Informatique Thèse. Lille: Université des Sciences et Technologie de Lille; 2013. 160 p. URL: https://core.ac.uk/download/pdf/51213307.pdf</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Shen C., Zhang K. Two-stage improved Grey Wolf optimization algorithm for feature selection on highdimensional classification. Complex &amp; Intelligent Systems. 2022;8(4):2769–2789. DOI: 10.1007/s40747–021–00452–4</mixed-citation><mixed-citation xml:lang="en">Shen C., Zhang K. Two-stage improved Grey Wolf optimization algorithm for feature selection on highdimensional classification. Complex &amp; Intelligent Systems. 2022;8(4):2769–2789. DOI: 10.1007/s40747–021–00452–4</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Basak H., Das M., Modak S. RSO: A novel reinforced swarm optimization algorithm for feature selection.arXiv:2107.14199. URL: https://arxiv.org/pdf/2107.14199.pdf</mixed-citation><mixed-citation xml:lang="en">Basak H., Das M., Modak S. RSO: A novel reinforced swarm optimization algorithm for feature selection.arXiv:2107.14199. URL: https://arxiv.org/pdf/2107.14199.pdf</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Roffo G., Melzi S. Features selection via eigenvector centrality. In: Proc. 5th Int. workshop on new frontiers in mining complex patterns (NFMCP2016). (Riva del Garda, 19 September, 2016). Cham: Springer-Verlag; 2017. (Lecture Notes in Computer Science. Vol. 10312). URL: https://www.researchgate.net/publication/305918391_Feature_Selection_via_Eigenvector_Centrality</mixed-citation><mixed-citation xml:lang="en">Roffo G., Melzi S. Features selection via eigenvector centrality. In: Proc. 5th Int. workshop on new frontiers in mining complex patterns (NFMCP2016). (Riva del Garda, 19 September, 2016). Cham: Springer-Verlag; 2017. (Lecture Notes in Computer Science. Vol. 10312). URL: https://www.researchgate.net/publication/305918391_Feature_Selection_via_Eigenvector_Centrality</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Hall M. A. Correlation-based feature selection for machine learning. PhD thesis. Hamilton: The University of Waikato; 1999. 198 p. URL: https://www.lri.fr/~pierres/donn%E9es/save/these/articles/lpr-queue/hall99correlationbased.pdf</mixed-citation><mixed-citation xml:lang="en">Hall M. A. Correlation-based feature selection for machine learning. PhD thesis. Hamilton: The University of Waikato; 1999. 198 p. URL: https://www.lri.fr/~pierres/donn%E9es/save/these/articles/lpr-queue/hall99correlationbased.pdf</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">James G., Witten D., Hastie T., Tibshirani R. An introduction to statistical learning: With applications in R. 8th ed. New York, NY: Springer Science+Business Media; 2017. 440 p. (Springer Texts in Statistics).</mixed-citation><mixed-citation xml:lang="en">James G., Witten D., Hastie T., Tibshirani R. An introduction to statistical learning: With applications in R. 8th ed. New York, NY: Springer Science+Business Media; 2017. 440 p. (Springer Texts in Statistics).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Janitza S., Celik E., Boulesteix A.-L. A computationally fast variable importance test for random forests for highdimensional data. Advances in Data Analysis and Classification. 2018;12(4):885–915. DOI: 10.1007/s11634–016–0276–4</mixed-citation><mixed-citation xml:lang="en">Janitza S., Celik E., Boulesteix A.-L. A computationally fast variable importance test for random forests for highdimensional data. Advances in Data Analysis and Classification. 2018;12(4):885–915. DOI: 10.1007/s11634–016–0276–4</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Магнус Я. Р., Катышев П. К., Пересецкий А. А. Эконометрика. М.: Дело; 2004. 576 с.</mixed-citation><mixed-citation xml:lang="en">Магнус Я. Р., Катышев П. К., Пересецкий А. А. Эконометрика. М.: Дело; 2004. 576 с.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Magnus Ya.R., Katyshev P. K., Peresetskii A. A. Econometrics. Moscow: Delo; 2004. 576 p. (In Russ.).</mixed-citation><mixed-citation xml:lang="en">Magnus Ya.R., Katyshev P. K., Peresetskii A. A. Econometrics. Moscow: Delo; 2004. 576 p. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Pearson K. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 1901;2(11):559–572. DOI: 10.1080/14786440109462720</mixed-citation><mixed-citation xml:lang="en">Pearson K. On lines and planes of closest fit to systems of points in space. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 1901;2(11):559–572. DOI: 10.1080/14786440109462720</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Айвазян С. А., Бухштабер В. М., Енюков И. С., Мешалкин Л. Д. Прикладная статистика. Классификация и снижение размерности. М.: Финансы и статистика; 1989. 607 с.</mixed-citation><mixed-citation xml:lang="en">Айвазян С. А., Бухштабер В. М., Енюков И. С., Мешалкин Л. Д. Прикладная статистика. Классификация и снижение размерности. М.: Финансы и статистика; 1989. 607 с.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Aivazyan S. A., Bukhshtaber V. M., Enyukov I. S., Meshalkin L. D. Applied statistics. Classification and dimensionality reduction. Moscow: Finansy i statistika; 1989. 607 p. (In Russ.).</mixed-citation><mixed-citation xml:lang="en">Aivazyan S. A., Bukhshtaber V. M., Enyukov I. S., Meshalkin L. D. Applied statistics. Classification and dimensionality reduction. Moscow: Finansy i statistika; 1989. 607 p. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang Y., Dong Z., Phillips P., Wang S., Ji G., Yang J., Yuan T.-F. Detection of subjects and brain regions related to Alzheimer’s disease using 3D MRI scans based on eigenbrain and machine learning. Frontiers in Computational Neuroscience. 2015;9:66. DOI: 10.3389/fncom.2015.00066</mixed-citation><mixed-citation xml:lang="en">Zhang Y., Dong Z., Phillips P., Wang S., Ji G., Yang J., Yuan T.-F. Detection of subjects and brain regions related to Alzheimer’s disease using 3D MRI scans based on eigenbrain and machine learning. Frontiers in Computational Neuroscience. 2015;9:66. DOI: 10.3389/fncom.2015.00066</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Hocking R. R. The analysis and selection of variables in linear regression. Biometrics. 1976;32(1):1–49. DOI: 10.2307/2529336</mixed-citation><mixed-citation xml:lang="en">Hocking R. R. The analysis and selection of variables in linear regression. Biometrics. 1976;32(1):1–49. DOI: 10.2307/2529336</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Mirjalili S., Mirjalili S. M., Lewis A. Grey wolf optimizer. Advances in Engineering Software. 2014;69:46–61. DOI: 10.1016/j.advengsoft.2013.12.007</mixed-citation><mixed-citation xml:lang="en">Mirjalili S., Mirjalili S. M., Lewis A. Grey wolf optimizer. Advances in Engineering Software. 2014;69:46–61. DOI: 10.1016/j.advengsoft.2013.12.007</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Flom P. L., Cassell D. L. Stopping stepwise: Why stepwise and similar selection methods are bad, and what you should use. In: Northeast SAS Users Group 2007 (NESUG 2007). (Baltimore, 11–14 November, 2007). URL: https://www.lexjansen.com/pnwsug/2008/DavidCassell-StoppingStepwise.pdf</mixed-citation><mixed-citation xml:lang="en">Flom P. L., Cassell D. L. Stopping stepwise: Why stepwise and similar selection methods are bad, and what you should use. In: Northeast SAS Users Group 2007 (NESUG 2007). (Baltimore, 11–14 November, 2007). URL: https://www.lexjansen.com/pnwsug/2008/DavidCassell-StoppingStepwise.pdf</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Eberhart R., Kennedy J. A new optimizer using particle swarm theory. In: Proc. 6th Int. symp. on micro machine and human science (MHS’95). (Nagoya, 04–06 October, 1995). Piscataway, NJ: IEEE; 1995:39–43. DOI: 10.1109/MHS.1995.494215</mixed-citation><mixed-citation xml:lang="en">Eberhart R., Kennedy J. A new optimizer using particle swarm theory. In: Proc. 6th Int. symp. on micro machine and human science (MHS’95). (Nagoya, 04–06 October, 1995). Piscataway, NJ: IEEE; 1995:39–43. DOI: 10.1109/MHS.1995.494215</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Schott J. R. Fault tolerant design using single and multicriteria genetic algorithm optimization. PhD thesis. Cambridge, MA: Massachusetts Institute of Technology; 1995. 201 p. URL: https://dspace.mit.edu/handle/1721.1/11582</mixed-citation><mixed-citation xml:lang="en">Schott J. R. Fault tolerant design using single and multicriteria genetic algorithm optimization. PhD thesis. Cambridge, MA: Massachusetts Institute of Technology; 1995. 201 p. URL: https://dspace.mit.edu/handle/1721.1/11582</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical Report. 2005;(06). URL: https://abc.erciyes.edu.tr/pub/tr06_2005.pdf</mixed-citation><mixed-citation xml:lang="en">Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical Report. 2005;(06). URL: https://abc.erciyes.edu.tr/pub/tr06_2005.pdf</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Altmann A., Toloşi L., Sander O., Lengauer T. Permutation importance: A corrected feature importance measure. Bioinformatics. 2010;26(10):1340–1347. DOI: 10.1093/bioinformatics/btq134</mixed-citation><mixed-citation xml:lang="en">Altmann A., Toloşi L., Sander O., Lengauer T. Permutation importance: A corrected feature importance measure. Bioinformatics. 2010;26(10):1340–1347. DOI: 10.1093/bioinformatics/btq134</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Hapfelmeier A., Ulm K. A new variable selection approach using random forests. Computational Statistics &amp; Data Analysis. 2013;60:50–69. DOI: 10.1016/j.csda.2012.09.020</mixed-citation><mixed-citation xml:lang="en">Hapfelmeier A., Ulm K. A new variable selection approach using random forests. Computational Statistics &amp; Data Analysis. 2013;60:50–69. DOI: 10.1016/j.csda.2012.09.020</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Louzada F., Ara A., Fernandes G. B. Classification methods applied to credit scoring: Systematic review and overall comparison. Surveys in Operations Research and Management Science. 2016;21(2):117–134. DOI: 10.1016/j.sorms.2016.10.001</mixed-citation><mixed-citation xml:lang="en">Louzada F., Ara A., Fernandes G. B. Classification methods applied to credit scoring: Systematic review and overall comparison. Surveys in Operations Research and Management Science. 2016;21(2):117–134. DOI: 10.1016/j.sorms.2016.10.001</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Santosa F., Symes W. W. Linear inversion of band-limited refl ection seismograms. SIAM Journal on Scientifi c and Statistical Computing. 1986;7(4):1307–1330. DOI: 10.1137/0907087</mixed-citation><mixed-citation xml:lang="en">Santosa F., Symes W. W. Linear inversion of band-limited refl ection seismograms. SIAM Journal on Scientifi c and Statistical Computing. 1986;7(4):1307–1330. DOI: 10.1137/0907087</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Hilt D. E., Seegrist D. W. Ridge: A computer program for calculating ridge regression estimates. USDA Forest Service Research Note. 1977;(236). URL: https://ia803007.us.archive.org/23/items/ridgecomputerpro236hilt/ridgecomputerpro236hilt.pdf</mixed-citation><mixed-citation xml:lang="en">Hilt D. E., Seegrist D. W. Ridge: A computer program for calculating ridge regression estimates. USDA Forest Service Research Note. 1977;(236). URL: https://ia803007.us.archive.org/23/items/ridgecomputerpro236hilt/ridgecomputerpro236hilt.pdf</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Тихонов А. Н. О решении некорректно поставленных задач и методе регуляризации. Доклады Академии наук СССР. 1963;151(3):501–504.</mixed-citation><mixed-citation xml:lang="en">Тихонов А. Н. О решении некорректно поставленных задач и методе регуляризации. Доклады Академии наук СССР. 1963;151(3):501–504.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Tikhonov A. N. Solution of incorrectly formulated problems and the regularization method. Soviet Mathematics. Doklady. 1963;(4):1035–1038. (In Russ.: Doklady Akademii nauk SSSR. 1963;151(3):501–504.).</mixed-citation><mixed-citation xml:lang="en">Tikhonov A. N. Solution of incorrectly formulated problems and the regularization method. Soviet Mathematics. Doklady. 1963;(4):1035–1038. (In Russ.: Doklady Akademii nauk SSSR. 1963;151(3):501–504.).</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Воронцов К. В. Лекции по алгоритмам восстановления регрессии. 21 декабря 2007 г. URL: http://www.ccas.ru/voron/download/Regression.pdf</mixed-citation><mixed-citation xml:lang="en">Воронцов К. В. Лекции по алгоритмам восстановления регрессии. 21 декабря 2007 г. URL: http://www.ccas.ru/voron/download/Regression.pdf</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Vorontsov K. V. Lectures on regression recovery algorithms. December 21, 2007. URL: http://www.ccas.ru/voron/download/Regression.pdf (In Russ.).</mixed-citation><mixed-citation xml:lang="en">Vorontsov K. V. Lectures on regression recovery algorithms. December 21, 2007. URL: http://www.ccas.ru/voron/download/Regression.pdf (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Zou H., Hastie T. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 2005;67(2):301–320. DOI: 10.1111/j.1467–9868.2005.00503.x</mixed-citation><mixed-citation xml:lang="en">Zou H., Hastie T. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society. Series B: Statistical Methodology. 2005;67(2):301–320. DOI: 10.1111/j.1467–9868.2005.00503.x</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Брюс П., Брюс Э. Разведочный анализ данных. Практическая статистика для специалистов Data Science. Пер. с англ. СПб.: БХВ-Петербург; 2018:19–58.</mixed-citation><mixed-citation xml:lang="en">Брюс П., Брюс Э. Разведочный анализ данных. Практическая статистика для специалистов Data Science. Пер. с англ. СПб.: БХВ-Петербург; 2018:19–58.</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">Bruce P., Bruce A. Exploratory data analysis. In: Practical statistics for data scientists: 50 essential concepts. Beijing: O’Reilly Media; 2017;1–46. (Russ. ed.: Bruce P., Bruce A. Razvedochnyi analiz dannykh. Prakticheskaya statistika dlya spetsialistov Data Science. St. Petersburg: BHV-Peterburg; 2018:19–58.).</mixed-citation><mixed-citation xml:lang="en">Bruce P., Bruce A. Exploratory data analysis. In: Practical statistics for data scientists: 50 essential concepts. Beijing: O’Reilly Media; 2017;1–46. (Russ. ed.: Bruce P., Bruce A. Razvedochnyi analiz dannykh. Prakticheskaya statistika dlya spetsialistov Data Science. St. Petersburg: BHV-Peterburg; 2018:19–58.).</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">Afanasiev S., Smirnova A. Predictive fraud analytics: B-tests. Journal of Operational Risk. 2018;13(4):17–46. DOI: 10.21314/JOP.2018.213</mixed-citation><mixed-citation xml:lang="en">Afanasiev S., Smirnova A. Predictive fraud analytics: B-tests. Journal of Operational Risk. 2018;13(4):17–46. DOI: 10.21314/JOP.2018.213</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">Lin J. Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory. 1991;37(1):145–151. DOI: 10.1109/18.61115</mixed-citation><mixed-citation xml:lang="en">Lin J. Divergence measures based on the Shannon entropy. IEEE Transactions on Information Theory. 1991;37(1):145–151. DOI: 10.1109/18.61115</mixed-citation></citation-alternatives></ref><ref id="cit35"><label>35</label><citation-alternatives><mixed-citation xml:lang="ru">Kolmogorov A. Sulla determinazione empirica di una legge di distribuzione. Giornale dell’Istituto Italiano degli Attuari. 1933;4:83–91.</mixed-citation><mixed-citation xml:lang="en">Kolmogorov A. Sulla determinazione empirica di una legge di distribuzione. Giornale dell’Istituto Italiano degli Attuari. 1933;4:83–91.</mixed-citation></citation-alternatives></ref><ref id="cit36"><label>36</label><citation-alternatives><mixed-citation xml:lang="ru">Harris D., Harris S. Digital design and computer architecture. 2nd ed. San Francisco, CA: Morgan Kaufmann; 2012. 720 p.</mixed-citation><mixed-citation xml:lang="en">Harris D., Harris S. Digital design and computer architecture. 2nd ed. San Francisco, CA: Morgan Kaufmann; 2012. 720 p.</mixed-citation></citation-alternatives></ref><ref id="cit37"><label>37</label><citation-alternatives><mixed-citation xml:lang="ru">Kutner M. H., Nachtsheim C. J.; Neter J. Applied linear regression models. 4th ed. New York, NY: McGraw-Hill/Irwin; 2004. 701 p.</mixed-citation><mixed-citation xml:lang="en">Kutner M. H., Nachtsheim C. J.; Neter J. Applied linear regression models. 4th ed. New York, NY: McGraw-Hill/Irwin; 2004. 701 p.</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>
