<?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">vmait</journal-id><journal-title-group><journal-title xml:lang="ru">Computational Mathematics and Information Technologies</journal-title><trans-title-group xml:lang="en"><trans-title>Computational Mathematics and Information Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2587-8999</issn><publisher><publisher-name>Донской государственный технический университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.23947/2587-8999-2020-1-2-114-119</article-id><article-id custom-type="elpub" pub-id-type="custom">vmait-37</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></article-categories><title-group><article-title>Алгоритм формирования малой обучающей выборки с использованием многослойного персептрона для априорных оценок</article-title><trans-title-group xml:lang="en"><trans-title>Algorithm for a formation of a small training set using a multilayer perceptron for a priori estimates</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>Seleznov</surname><given-names>M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Селезнёв Михаил, Научный сотрудник</p><p>Долгопрудный, Институтский пер., д. 9</p></bio><bio xml:lang="en"><p>Mykhailo Seleznov, Researcher</p><p>Institutskiy lane, 9, Dolgoprudny</p></bio><email xlink:type="simple">mihailselezniov@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Московский физико-технический институт</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Moscow Institute of Physics and Technology</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>21</day><month>02</month><year>2023</year></pub-date><volume>4</volume><issue>2</issue><fpage>114</fpage><lpage>119</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">Seleznov M.</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://www.cmit-journal.ru/jour/article/view/37">https://www.cmit-journal.ru/jour/article/view/37</self-uri><abstract><p>В статье предлагается алгоритм формирования небольшой обучающей выборки, обеспечивающей приемлемое качество суррогатной модели машинного обучения, обученной с использованием этой выборки. Алгоритм использует многослойный персептрон для выполнения предварительной оценки и выбора следующего лучшего образца для включения в выборки. В статье тестируется предложенный алгоритм применительно к задаче о деформации и разрыве тонкой нити под действием на нее импульса поперечной нагрузки. Обсуждается возможность обобщения подхода и его применения для построения суррогатных моделей машинного обучения для других физических задач.</p></abstract><trans-abstract xml:lang="en"><p>The paper proposes an algorithm for the formation of a small training set, which ensures a reasonable quality of a surrogate machine learning model trained using this set. The algorithm uses multilayer perceptron to estimate heuristics and select the best next sample for the inclusion in a set. The paper tests the algorithm proposed applying it to the problem of deformation and breaking of a thin thread under the action of a transverse load pulse on it. The possibility to generalize the approach and apply it to building surrogate machine learning models for other physical problems is discussed.</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>machine learning</kwd><kwd>train set</kwd><kwd>numerical modeling</kwd><kwd>surrogate model</kwd><kwd>multilayer perceptron</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена в рамках инициативной НИР.</funding-statement><funding-statement xml:lang="en">The research is done within the frame of the independent R&amp;D.</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">Beklemysheva, K.A., Petrov, I.B. Damage modeling in hybrid composites subject to low-speed impact // Mathematical Models and Computer Simulations2019. – Vol. 11. – P. 469-478.</mixed-citation><mixed-citation xml:lang="en">Beklemysheva, K.A., Petrov, I.B. Damage modeling in hybrid composites subject to low-speed impact // Mathematical Models and Computer Simulations2019. – Vol. 11. – P. 469-478.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Kim, S.H., Boukouvala, F. Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques // Optimization Letters. – 2020. – Vol. 14. – P. 989-1010.</mixed-citation><mixed-citation xml:lang="en">Kim, S.H., Boukouvala, F. Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques // Optimization Letters. – 2020. – Vol. 14. – P. 989-1010.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Rakhmatulin Kh.A., Demianov Yu.A. Strength under high transient loads. – New York : Daniel Davey, 1966. — 348 p.</mixed-citation><mixed-citation xml:lang="en">Rakhmatulin Kh.A., Demianov Yu.A. Strength under high transient loads. – New York : Daniel Davey, 1966. — 348 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Vasyukov A.V., Elovenkova M.A., Petrov I.B. Modeling of thin fiber deformation and destruction under dynamic load // Matem. Mod. – 2020. – Vol. 32, iss. 5. – P. 95-102.</mixed-citation><mixed-citation xml:lang="en">Vasyukov A.V., Elovenkova M.A., Petrov I.B. Modeling of thin fiber deformation and destruction under dynamic load // Matem. Mod. – 2020. – Vol. 32, iss. 5. – P. 95-102.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Hsiang-Fu Y., Fang-Lan H., Chih-Jen L. Dual coordinate descent methods for logistic regression and maximum entropy models // Machine Learning. – 2011. – Vol. 85. – P. 41-75.</mixed-citation><mixed-citation xml:lang="en">Hsiang-Fu Y., Fang-Lan H., Chih-Jen L. Dual coordinate descent methods for logistic regression and maximum entropy models // Machine Learning. – 2011. – Vol. 85. – P. 41-75.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Platt J. Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods. In: Advances in Large Margin Classifiers // Cambridge : MIT Press, 1999. – P. 61-74.</mixed-citation><mixed-citation xml:lang="en">Platt J. Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods. In: Advances in Large Margin Classifiers // Cambridge : MIT Press, 1999. – P. 61-74.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Rumelhart D.E., Hinton G.E., Williams R.J. Learning internal representations by error propagation. In: Parallel distributed processing: Explorations in the microstructure of cognition // Cambridge : MIT Press, 1986. – P. 318-362.</mixed-citation><mixed-citation xml:lang="en">Rumelhart D.E., Hinton G.E., Williams R.J. Learning internal representations by error propagation. In: Parallel distributed processing: Explorations in the microstructure of cognition // Cambridge : MIT Press, 1986. – P. 318-362.</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>
