<?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">ellibs</journal-id><journal-title-group><journal-title xml:lang="ru">Электронные библиотеки</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Digital Libraries Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1562-5419</issn><publisher><publisher-name>Казанский (Приволжский) федеральный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26907/1562-5419-2025-28-3-681-700</article-id><article-id custom-type="elpub" pub-id-type="custom">ellibs-581</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>Signature Methods for Time Series Analysis</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>Mashchenko</surname><given-names>Kirill Alekseevich</given-names></name></name-alternatives><email xlink:type="simple">kirill.mashchenko@niisi.ru</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>NRC “Kurchatov Institute” – SRISA</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>23</day><month>06</month><year>2025</year></pub-date><volume>28</volume><issue>3</issue><fpage>681</fpage><lpage>700</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">Mashchenko K.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://ellibs.elpub.ru/jour/article/view/581">https://ellibs.elpub.ru/jour/article/view/581</self-uri><abstract><p>Сигнатурные методы представляют собой мощный инструмент анализа временных рядов, который преобразует их в форму, удобную для задач машинного обучения. В статье рассмотрены основные понятия сигнатуры пути, ее свойства и геометрический смысл, а также методы вычисления для различных типов временных рядов. Приведены примеры применения сигнатурных методов в различных областях, включая финансы, медицину и образование, продемонстрированы их преимущества перед традиционными подходами. Особое внимание уделено генерации синтетических данных на основе сигнатур, что особенно актуально в условиях ограниченного объема исходных данных. Представлены результаты экспериментальных исследований по генерации и предсказанию траекторий цифрового следа обучения студентов, подтверждающие эффективность сигнатурных методов для применения в задачах машинного обучения по анализу и прогнозированию временных рядов.
</p></abstract><trans-abstract xml:lang="en"><p>Signature methods are a powerful tool for time series analysis, transforming them into a form suitable for machine learning tasks. The article examines the fundamental concepts of path signatures, their properties, and geometric interpretation, as well as computational methods for various types of time series. Examples of signature method applications in different fields, including finance, medicine, and education, are presented, highlighting their advantages over traditional approaches. Special attention is given to synthetic data generation based on signatures, which is particularly relevant when working with limited datasets. The experimental results on generating and predicting student digital learning trajectories demonstrate the effectiveness of signature methods for machine learning applications in time series analysis and forecasting.
</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>signature</kwd><kwd>signature methods</kwd><kwd>time series</kwd><kwd>data generation</kwd><kwd>trajectory analysis</kwd><kwd>digital footprint</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">Chen K.-T. Integration of paths, geometric invariants and a generalized Baker-Hausdorff formula // Annals of Mathematics. 1957. Vol. 65. No. 1. P. 163–178. https://doi.org/10.2307/1969671</mixed-citation><mixed-citation xml:lang="en">Chen K.-T. Integration of paths, geometric invariants and a generalized Baker-Hausdorff formula // Annals of Mathematics. 1957. Vol. 65. No. 1. P. 163–178. https://doi.org/10.2307/1969671</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Chen K.-T. Integration of paths – a faithful representation of paths by non-commutative formal power series // Transactions of the American Mathematical Socie-ty. 1958. Vol. 89. P. 395–407. https://doi.org/10.1090/S0002-9947-1958-0106258-0</mixed-citation><mixed-citation xml:lang="en">Chen K.-T. Integration of paths – a faithful representation of paths by non-commutative formal power series // Transactions of the American Mathematical Socie-ty. 1958. Vol. 89. P. 395–407. https://doi.org/10.1090/S0002-9947-1958-0106258-0</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Lyons T. J. Differential equations driven by rough signals // Revista Ma-tematica Iberoamericana. 1998. Vol. 14. No. 2. P. 215–310. https://doi.org/10.4171/RMI/240</mixed-citation><mixed-citation xml:lang="en">Lyons T. J. Differential equations driven by rough signals // Revista Ma-tematica Iberoamericana. 1998. Vol. 14. No. 2. P. 215–310. https://doi.org/10.4171/RMI/240</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Lyons T. J., Caruana M., Levy T. Differential equations driven by rough paths // Lecture Notes in Mathematics. 2007. № 1908. https://doi.org/10.1007/978-3-540-71285-5</mixed-citation><mixed-citation xml:lang="en">Lyons T. J., Caruana M., Levy T. Differential equations driven by rough paths // Lecture Notes in Mathematics. 2007. № 1908. https://doi.org/10.1007/978-3-540-71285-5</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Friz P. K., Hairer M. A course on rough paths. With an introduction to regu-larity structures (2nd edition) // Springer. 2020. https://doi.org/10.1007/978-3-030-41556-3</mixed-citation><mixed-citation xml:lang="en">Friz P. K., Hairer M. A course on rough paths. With an introduction to regu-larity structures (2nd edition) // Springer. 2020. https://doi.org/10.1007/978-3-030-41556-3</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Boedihardjo H., Geng X., Lyons T., Yang D. The signature of a rough path: Uniqueness. 2014. https://arxiv.org/abs/1406.7871</mixed-citation><mixed-citation xml:lang="en">Boedihardjo H., Geng X., Lyons T., Yang D. The signature of a rough path: Uniqueness. 2014. https://arxiv.org/abs/1406.7871</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Hambly B., Lyons T. Uniqueness for the signature of a path of bounded var-iation and the reduced path group // Annals of Mathematics. 2010. Vol. 171. No. 1. P. 109–167. https://doi.org/10.4007/annals.2010.171.109</mixed-citation><mixed-citation xml:lang="en">Hambly B., Lyons T. Uniqueness for the signature of a path of bounded var-iation and the reduced path group // Annals of Mathematics. 2010. Vol. 171. No. 1. P. 109–167. https://doi.org/10.4007/annals.2010.171.109</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Graham B. Sparse arrays of signatures for online character recognition. 2013. https://arxiv.org/abs/1308.0371</mixed-citation><mixed-citation xml:lang="en">Graham B. Sparse arrays of signatures for online character recognition. 2013. https://arxiv.org/abs/1308.0371</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Morrill J., Kormilitzin A., Nevado-Holgado A., Swaminathan S., Howison S., Lyons T. J. The signature-based model for early detection of sepsis from electronic health records in the intensive care unit // IEEE Conference on Computing in Cardiology. 2019. https://doi.org/10.22489/CinC.2019.014</mixed-citation><mixed-citation xml:lang="en">Morrill J., Kormilitzin A., Nevado-Holgado A., Swaminathan S., Howison S., Lyons T. J. The signature-based model for early detection of sepsis from electronic health records in the intensive care unit // IEEE Conference on Computing in Cardiology. 2019. https://doi.org/10.22489/CinC.2019.014</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Chevyrev I., Kormilitzin A. A Primer on the Signature Method in Machine Learning. 2019. https://arxiv.org/abs/1603.03788</mixed-citation><mixed-citation xml:lang="en">Chevyrev I., Kormilitzin A. A Primer on the Signature Method in Machine Learning. 2019. https://arxiv.org/abs/1603.03788</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Buhler H., Horvath B., Lyons T., Arribas I. P., Wood B. A data-driven market simulator for small data environments. 2020. https://arxiv.org/abs/2006.14498</mixed-citation><mixed-citation xml:lang="en">Buhler H., Horvath B., Lyons T., Arribas I. P., Wood B. A data-driven market simulator for small data environments. 2020. https://arxiv.org/abs/2006.14498</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Gyurko L. G., Lyons T., Kontkowski M., Field J. Extracting information from the signature of a financial data stream. 2014. https://arxiv.org/abs/1307.7244v2</mixed-citation><mixed-citation xml:lang="en">Gyurko L. G., Lyons T., Kontkowski M., Field J. Extracting information from the signature of a financial data stream. 2014. https://arxiv.org/abs/1307.7244v2</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Cohen S. N., Lui S., Malpass W., Mantoan G., Nesheim L., de Paula A., Reeves A., Scott C., Small E., Yang L. Nowcasting with signature methods. 2023. https://arxiv.org/abs/2305.10256v1</mixed-citation><mixed-citation xml:lang="en">Cohen S. N., Lui S., Malpass W., Mantoan G., Nesheim L., de Paula A., Reeves A., Scott C., Small E., Yang L. Nowcasting with signature methods. 2023. https://arxiv.org/abs/2305.10256v1</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</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. Vol. 67. No. 2. P. 301–320. https://doi.org/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. Vol. 67. No. 2. P. 301–320. https://doi.org/10.1111/j.1467-9868.2005.00503.x</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Fermanian A. Embedding and learning with signatures // Computational Statistics &amp; Data Analysis. 2021. Vol. 157. No. 107148. https://doi.org/10.1016/j.csda.2020.107148</mixed-citation><mixed-citation xml:lang="en">Fermanian A. Embedding and learning with signatures // Computational Statistics &amp; Data Analysis. 2021. Vol. 157. No. 107148. https://doi.org/10.1016/j.csda.2020.107148</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Chevyrev I., Oberhauser H. Signature moments to characterize laws of sto-chastic processes. 2018. https://arxiv.org/abs/1810.10971</mixed-citation><mixed-citation xml:lang="en">Chevyrev I., Oberhauser H. Signature moments to characterize laws of sto-chastic processes. 2018. https://arxiv.org/abs/1810.10971</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>
