<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2022-3-200-209</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1712</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>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>Формирование признаков машинного обучения на основе построения тропических функций</article-title><trans-title-group xml:lang="en"><trans-title>Formation of Machine Learning Features Based on the Construction of Tropical Functions</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-0002-8106-9813</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>Chukanov</surname><given-names>Sergey N.</given-names></name></name-alternatives><email xlink:type="simple">ch_sn@mail.ru</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-9946-7484</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>Chukanov</surname><given-names>Ilya S.</given-names></name></name-alternatives><email xlink:type="simple">chukanov022@gmail.com</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>Sobolev Institute of Mathematics</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>Ural Federal University named after the First President of Russia B. N. Yeltsin</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2022</year></pub-date><pub-date pub-type="epub"><day>25</day><month>09</month><year>2022</year></pub-date><volume>29</volume><issue>3</issue><fpage>200</fpage><lpage>209</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">Chukanov S.N., Chukanov I.S.</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.mais-journal.ru/jour/article/view/1712">https://www.mais-journal.ru/jour/article/view/1712</self-uri><abstract><p>Одним из основных методов вычислительной топологии и топологического анализа данных является персистентная гомология, объединяющая геометрическую и топологическую информацию об объекте с использованием персистентных диаграмм и баркодов. Метод персистентной гомологии из вычислительной топологии обеспечивает баланс между уменьшением размерности данных и характеристикой внутренней структуры объекта. Объединению машинного обучения и персистентной гомологии препятствуют топологические представления данных, метрики расстояния и представление объектов данных. В работе рассматриваются математические модели и функции представления объектов персистентного ландшафта на основе метода персистентной гомологии. Функции персистентного ландшафта позволяют отображать персистентные диаграммы в гильбертово пространство. Рассмотрены представления топологических функций в различных моделях машинного обучения. Приведен пример нахождения расстояния между изображениями на основе построения функций персистентного ландшафта.На основе алгебры полиномов в пространстве баркодов, которые используются в качестве координат, определяются расстояния в пространстве баркода сопоставлением интервалов от одного баркода к другому и расчета штрафов. Для этих целей используются тропические функции, которые учитывают базовую структуру пространства баркода. Рассмотрены методы построения рациональных тропических функций. Приведен пример нахождения расстояния между изображениями на основе построения тропических функций. Для повышения разнообразия параметров (признаков машинного обучения) построены фильтрации сканирования объекта по строкам слева направо и сканирования по столбцам снизу вверх. Это добавляет пространственную информацию к топологической информации. Метод построения персистентных ландшафтов совместим с подходом построения тропических рациональных функций при получении персистентных гомологий.</p></abstract><trans-abstract xml:lang="en"><p>One of the main methods of computational topology and topological data analysis is persistent homology, which combines geometric and topological information about an object using persistent diagrams and barcodes. The persistent homology method from computational topology provides a balance between reducing the data dimension and characterizing the internal structure of an object. Combining machine learning and persistent homology is hampered by topological representations of data, distance metrics, and representation of data objects. The paper considers mathematical models and functions for representing persistent landscape objects based on the persistent homology method. The persistent landscape functions allow you to map persistent diagrams to Hilbert space. The representations of topological functions in various machine learning models are considered. An example of finding the distance between images based on the construction of persistent landscape functions is given. Based on the algebra of polynomials in the barcode space, which are used as coordinates, the distances in the barcode space are determined by comparing intervals from one barcode to another and calculating penalties. For these purposes, tropical functions are used that take into account the basic structure of the barcode space. Methods for constructing rational tropical functions are considered. An example of finding the distance between images based on the construction of tropical functions is given. To increase the variety of parameters (machine learning features), filtering of object scanning by rows from left to right and scanning by columns from bottom to top are built. This adds spatial information to topological information. The method of constructing persistent landscapes is compatible with the approach of constructing tropical rational functions when obtaining persistent homologies.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>персистентные гомологии</kwd><kwd>персистентный ландшафт</kwd><kwd>машинное обучение</kwd><kwd>RKHS</kwd><kwd>гильбертово пространство</kwd><kwd>тропические функции</kwd></kwd-group><kwd-group xml:lang="en"><kwd>persistent homology</kwd><kwd>persistent landscape</kwd><kwd>machine learning</kwd><kwd>RKHS</kwd><kwd>Hilbert space</kwd><kwd>tropical functions</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">G. Carlsson, “Topology and data”, Bulletin of the American Mathematical Society, vol. 46, no. 2, pp. 307-309, 2009. doi: 10.1090/S0273-0979-09-01249-X.</mixed-citation><mixed-citation xml:lang="en">G. Carlsson, “Topology and data”, Bulletin of the American Mathematical Society, vol. 46, no. 2, pp. 307-309, 2009. doi: 10.1090/S0273-0979-09-01249-X.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">H. Edelsbrunner and J. Harer, Computational topology: an introduction. American Mathematical Soc., 2010.</mixed-citation><mixed-citation xml:lang="en">H. Edelsbrunner and J. Harer, Computational topology: an introduction. American Mathematical Soc., 2010.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">A. J. Zomorodian, Topology for computing. Cambridge UP, 2005.</mixed-citation><mixed-citation xml:lang="en">A. J. Zomorodian, Topology for computing. Cambridge UP, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">R. Ghrist, “Barcodes: the persistent topology of data”, Bulletin of the American Mathematical Society, vol. 15, no. 1, pp. 61-75, 2008. doi: 10.1090/S0273-0979-07-01191-3.</mixed-citation><mixed-citation xml:lang="en">R. Ghrist, “Barcodes: the persistent topology of data”, Bulletin of the American Mathematical Society, vol. 15, no. 1, pp. 61-75, 2008. doi: 10.1090/S0273-0979-07-01191-3.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">S. N. Chukanov, “Comparison of objects’ images based on computational topology methods”, Informatics and Automation, vol. 18, no. 3, pp. 1043-1065, 2019. doi: 10.15622/sp.2019.18.5.1043-1065.</mixed-citation><mixed-citation xml:lang="en">S. N. Chukanov, “Comparison of objects’ images based on computational topology methods”, Informatics and Automation, vol. 18, no. 3, pp. 1043-1065, 2019. doi: 10.15622/sp.2019.18.5.1043-1065.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">S. N. Chukanov, “The Comparison of Diffeomorphic Images based on the Construction of Persistent Homology”, Automatic Control and Computer Sciences, vol. 54, no. 7, pp. 758-771, 2020. doi: 10.3103/ S0146411620070056.</mixed-citation><mixed-citation xml:lang="en">S. N. Chukanov, “The Comparison of Diffeomorphic Images based on the Construction of Persistent Homology”, Automatic Control and Computer Sciences, vol. 54, no. 7, pp. 758-771, 2020. doi: 10.3103/ S0146411620070056.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">A. Hatcher, Algebraic Topology. Cambridge UP, 2005.</mixed-citation><mixed-citation xml:lang="en">A. Hatcher, Algebraic Topology. Cambridge UP, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">C. Hofer, R. Kwitt, M. Niethammer, and A. Uhl, “Deep learning with topological signatures”, in Proceedings of the 31st International Conference on Neural Information Processing Systems, 2017, pp. 1633-1643.</mixed-citation><mixed-citation xml:lang="en">C. Hofer, R. Kwitt, M. Niethammer, and A. Uhl, “Deep learning with topological signatures”, in Proceedings of the 31st International Conference on Neural Information Processing Systems, 2017, pp. 1633-1643.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">P. Bubenik, “The persistence landscape and some of its properties”, Topological Data Analysis, pp. 97-117, 2020. doi: 10.1007/978-3-030-43408-3 4.</mixed-citation><mixed-citation xml:lang="en">P. Bubenik, “The persistence landscape and some of its properties”, Topological Data Analysis, pp. 97-117, 2020. doi: 10.1007/978-3-030-43408-3 4.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">P. Bubenik, “Statistical Topological Data Analysis Using Persistence Landscapes”, Journal of Machine Learning Research, vol. 16, no. 1, pp. 77-102, 2015.</mixed-citation><mixed-citation xml:lang="en">P. Bubenik, “Statistical Topological Data Analysis Using Persistence Landscapes”, Journal of Machine Learning Research, vol. 16, no. 1, pp. 77-102, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">S. Kalisnik, “Tropical coordinates on the space of persistence barcodes”, Foundations of Computational Mathematics, vol. 19, no. 1, pp. 101-129, 2019. doi: 10.1007/s10208-018-9379-y.</mixed-citation><mixed-citation xml:lang="en">S. Kalisnik, “Tropical coordinates on the space of persistence barcodes”, Foundations of Computational Mathematics, vol. 19, no. 1, pp. 101-129, 2019. doi: 10.1007/s10208-018-9379-y.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological data analysis: a kernel perspective”, Advances in Neural Information Processing Systems, vol. 28, pp. 3052-3060, 2015.</mixed-citation><mixed-citation xml:lang="en">R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological data analysis: a kernel perspective”, Advances in Neural Information Processing Systems, vol. 28, pp. 3052-3060, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">V. P. Maslov, “Motivation and essence of the term ”Tropical mathematics””, Russian Journal of Mathematical Physics, vol. 27, no. 4, pp. 478-483, 2020. doi: 10.1134/S106192082004007X.</mixed-citation><mixed-citation xml:lang="en">V. P. Maslov, “Motivation and essence of the term ”Tropical mathematics””, Russian Journal of Mathematical Physics, vol. 27, no. 4, pp. 478-483, 2020. doi: 10.1134/S106192082004007X.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">A. Aadcock, E. Carlsson, and G. Carlsson, “The Ring of Algebraic Functions on Persistence Bar Codes”, Homology, Homotopy and Applicationse, vol. 18, pp. 381-402, 2016. doi: 10.4310/HHA.2016.v18.n1.a21.</mixed-citation><mixed-citation xml:lang="en">A. Aadcock, E. Carlsson, and G. Carlsson, “The Ring of Algebraic Functions on Persistence Bar Codes”, Homology, Homotopy and Applicationse, vol. 18, pp. 381-402, 2016. doi: 10.4310/HHA.2016.v18.n1.a21.</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>
