<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-234</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>The iterative method of regression trees induction</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>Melnikov</surname><given-names>G. A.</given-names></name></name-alternatives><email xlink:type="simple">grme189@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>Gubarev</surname><given-names>V. V.</given-names></name></name-alternatives><email xlink:type="simple">gubarev@vt.cs.nstu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Новосибирский государственный технический университет</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>24</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>4</issue><fpage>59</fpage><lpage>67</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Мельников Г.А., Губарев В.В., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Мельников Г.А., Губарев В.В.</copyright-holder><copyright-holder xml:lang="en">Melnikov G.A., Gubarev V.V.</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://vestnik.sibsutis.ru/jour/article/view/234">https://vestnik.sibsutis.ru/jour/article/view/234</self-uri><abstract><p>Подавляющее большинство современных алгоритмов построения деревьев регрессии являются жадными. Все они основаны на рекурсивном разделении данных. Предлагается пересмотреть эту «традицию». В работе представлены оригинальный итеративный метод и алгоритм построения деревьев регрессии с ранней остановкой. Результаты численных экспериментов показывают, что предложенный алгоритм не уступает рекурсивным алгоритмам по среднеквадратичной адекватности идентификации, приводит к менее сложным моделям и обладает значительно меньшей трудоёмкостью.</p></abstract><trans-abstract xml:lang="en"><p>The majority of modem algorithms for regression tree induction are greedy. They are all based on a recursive division of the data. We propose to revise this «tradition». The paper describes the novel iterative method and algorithm with pre-pruning for regression tree induction. The results of the experiments based on publicly available data sets show that the proposed algorithm is comparable with recursive algorithms for regression tree induction in accuracy. However, it results in less complex solutions and has a much lower time complexity.</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>machine learning</kwd><kwd>nonlinear regression</kwd><kwd>piecewise linear regression</kwd><kwd>models trees</kwd><kwd>regression trees</kwd><kwd>regression trees pruning</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">Classification and regression trees / L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone. Belmont: Wadsworth International Group, 1984. 259 p.</mixed-citation><mixed-citation xml:lang="en">Classification and regression trees / L. Breiman, J.H. Friedman, R.A. Olshen, C.J. Stone. Belmont: Wadsworth International Group, 1984. 259 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Hyafil L., Rivest R L. Constructing optimal binary decision trees is NP-complete // Information Processing Letters. 1976. V. 5, № 1. P. 15-17.</mixed-citation><mixed-citation xml:lang="en">Hyafil L., Rivest R L. Constructing optimal binary decision trees is NP-complete // Information Processing Letters. 1976. V. 5, № 1. P. 15-17.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Quinlan J.R. Learning with continuous classes // Proc. AI’92, 5th Australian Joint Conference on Artificial Intelligence. 1992. P. 343-348.</mixed-citation><mixed-citation xml:lang="en">Quinlan J.R. Learning with continuous classes // Proc. AI’92, 5th Australian Joint Conference on Artificial Intelligence. 1992. P. 343-348.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Karalic A. Employing linear regression in regression tree leaves // Proceedings of the 10th European Conference on Artificial Intelligence. 1992. P. 440-441.</mixed-citation><mixed-citation xml:lang="en">Karalic A. Employing linear regression in regression tree leaves // Proceedings of the 10th European Conference on Artificial Intelligence. 1992. P. 440-441.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Potts D., Sammut C. Incremental learning of linear model trees // Machine Learning. 2005. V. 61. P. 5-48.</mixed-citation><mixed-citation xml:lang="en">Potts D., Sammut C. Incremental learning of linear model trees // Machine Learning. 2005. V. 61. P. 5-48.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Vogel D., Asparouhov O., Scheffer /. Scalable look-ahead linear regression trees // In: Proc. of 13th ACM SIGKDD. 2007. P. 757-764.</mixed-citation><mixed-citation xml:lang="en">Vogel D., Asparouhov O., Scheffer /. Scalable look-ahead linear regression trees // In: Proc. of 13th ACM SIGKDD. 2007. P. 757-764.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Loh W.-Y. Regression trees with unbiased variable selection and interaction detection // Statistica Sinica. 2002. V. 12. P. 361-386.</mixed-citation><mixed-citation xml:lang="en">Loh W.-Y. Regression trees with unbiased variable selection and interaction detection // Statistica Sinica. 2002. V. 12. P. 361-386.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Torgo L. A Comparative study of reliable error estimators for pruning regression trees // In Proceeding of the Iberoamerican Conference on Artificial Intelligence. 1998. P. 1-12.</mixed-citation><mixed-citation xml:lang="en">Torgo L. A Comparative study of reliable error estimators for pruning regression trees // In Proceeding of the Iberoamerican Conference on Artificial Intelligence. 1998. P. 1-12.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Мельников Г.А. Применение методов искусственного интеллекта для исследования инфекционных заболеваний: магистерская дис.. «Магистр техники и технологии»: 230100. г. Новосибирск, 2012. 141 с.</mixed-citation><mixed-citation xml:lang="en">Мельников Г.А. Применение методов искусственного интеллекта для исследования инфекционных заболеваний: магистерская дис.. «Магистр техники и технологии»: 230100. г. Новосибирск, 2012. 141 с.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Murthy Sreerama K. Automatic construction of decision trees from data: A multi-disciplinary survey // Data Mining and Knowledge Discovery. 2005. V. 2, № 4. P. 345-389.</mixed-citation><mixed-citation xml:lang="en">Murthy Sreerama K. Automatic construction of decision trees from data: A multi-disciplinary survey // Data Mining and Knowledge Discovery. 2005. V. 2, № 4. P. 345-389.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Chen J., Chen Z. Extended Bayesian information criteria for model selection with large model spaces // Biometrika. 2008. V. 95, № 3. P. 759-771.</mixed-citation><mixed-citation xml:lang="en">Chen J., Chen Z. Extended Bayesian information criteria for model selection with large model spaces // Biometrika. 2008. V. 95, № 3. P. 759-771.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Frank A., Asuncion A. UCI machine learning repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science. 2010.</mixed-citation><mixed-citation xml:lang="en">Frank A., Asuncion A. UCI machine learning repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science. 2010.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">KEEL data-mining software tool: data set repository, integration of algorithms and experimental analysis framework / J. Alcalâ-Fdez, A. Fernandez, J. Luengo, J. Derrac, S. Garda, L. Sânchez, F. Herrera // Journal of Multiple-Valued Logic and Soft Computing. 2011. V. 17. P. 255-287.</mixed-citation><mixed-citation xml:lang="en">KEEL data-mining software tool: data set repository, integration of algorithms and experimental analysis framework / J. Alcalâ-Fdez, A. Fernandez, J. Luengo, J. Derrac, S. Garda, L. Sânchez, F. Herrera // Journal of Multiple-Valued Logic and Soft Computing. 2011. V. 17. P. 255-287.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Gramacy R.B. Model choice and data mining [Электронный ресурс]. URL: http://faculty.chicagobooth.edu/robert.gramacy/teaching/ara/lect7.pdf (дата обращения: 14.09.2014).</mixed-citation><mixed-citation xml:lang="en">Gramacy R.B. Model choice and data mining [Электронный ресурс]. URL: http://faculty.chicagobooth.edu/robert.gramacy/teaching/ara/lect7.pdf (дата обращения: 14.09.2014).</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>
