<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.2" xml:lang="ru" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><front><journal-meta><journal-id journal-id-type="issn">2518-1092</journal-id><journal-title-group><journal-title>Research result. Information technologies</journal-title></journal-title-group><issn pub-type="epub">2518-1092</issn></journal-meta><article-meta><article-id pub-id-type="doi">10.18413/2518-1092-2026-11-3-0-5</article-id><article-id pub-id-type="publisher-id">4358</article-id><article-categories><subj-group subj-group-type="heading"><subject>ARTIFICIAL INTELLIGENCE AND DECISION MAKING</subject></subj-group></article-categories><title-group><article-title>&lt;strong&gt;INVESTIGATION OF A STOCK PRICE FORECASTING METHOD BASED ON EUCLIDEAN DISTANCE&lt;/strong&gt;</article-title><trans-title-group xml:lang="en"><trans-title>&lt;strong&gt;INVESTIGATION OF A STOCK PRICE FORECASTING METHOD BASED ON EUCLIDEAN DISTANCE&lt;/strong&gt;</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Chashin</surname><given-names>Yuri Gennadievich</given-names></name><name xml:lang="en"><surname>Chashin</surname><given-names>Yuri Gennadievich</given-names></name></name-alternatives><email>chashin@bsuedu.ru</email></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Shiryaev</surname><given-names>Alexey Alexandrovich</given-names></name><name xml:lang="en"><surname>Shiryaev</surname><given-names>Alexey Alexandrovich</given-names></name></name-alternatives></contrib></contrib-group><pub-date pub-type="epub"><year>2026</year></pub-date><volume>11</volume><issue>3</issue><fpage>0</fpage><lpage>0</lpage><self-uri content-type="pdf" xlink:href="/media/information/2026/3/ИТ_НР_11_3_5.pdf" /><abstract xml:lang="ru"><p>This article examines a stock price forecasting method based on Euclidean distance. It discusses the widespread use of Euclidean distance in science, specifically exploring its applications in geographic information systems, physics, and machine learning. Fluctuations in the share price of Sberbank (traded on the Moscow Exchange) are proposed as the data source for the study. The article notes that fundamental and technical analyses are commonly used for forecasting in stock markets, highlighting the fundamental tenet of technical analysis: that the price and its movement history encapsulate all market information. The study concludes that Euclidean distance can be used for the univariate forecasting of stock prices. Daily closing prices over a five-year period are proposed as the data source. A forecasting algorithm is formulated based on the well-known concept that &amp;quot;history repeats itself.&amp;quot; Data preprocessing involves removing data from weekends and holidays, converting values to percentage price changes, trimming anomalous spikes, and normalization. Euclidean distances are calculated between the price-change segment under analysis and 976 other segments. An analysis of the obtained results is presented. Forecasting based on the single closest segment yielded an accuracy of 63.56%, whereas using the ten closest segments resulted in 75.5% accuracy. Limitations of this approach, such as the non-uniform distribution of Euclidean distances, are noted, as are potential improvements &amp;ndash; for instance, the additional application of the Dynamic Time Warping algorithm. Nevertheless, the conclusion is drawn that the forecasting result obtained is acceptable, particularly for trading applications.</p></abstract><trans-abstract xml:lang="en"><p>This article examines a stock price forecasting method based on Euclidean distance. It discusses the widespread use of Euclidean distance in science, specifically exploring its applications in geographic information systems, physics, and machine learning. Fluctuations in the share price of Sberbank (traded on the Moscow Exchange) are proposed as the data source for the study. The article notes that fundamental and technical analyses are commonly used for forecasting in stock markets, highlighting the fundamental tenet of technical analysis: that the price and its movement history encapsulate all market information. The study concludes that Euclidean distance can be used for the univariate forecasting of stock prices. Daily closing prices over a five-year period are proposed as the data source. A forecasting algorithm is formulated based on the well-known concept that &amp;quot;history repeats itself.&amp;quot; Data preprocessing involves removing data from weekends and holidays, converting values to percentage price changes, trimming anomalous spikes, and normalization. Euclidean distances are calculated between the price-change segment under analysis and 976 other segments. An analysis of the obtained results is presented. Forecasting based on the single closest segment yielded an accuracy of 63.56%, whereas using the ten closest segments resulted in 75.5% accuracy. Limitations of this approach, such as the non-uniform distribution of Euclidean distances, are noted, as are potential improvements &amp;ndash; for instance, the additional application of the Dynamic Time Warping algorithm. Nevertheless, the conclusion is drawn that the forecasting result obtained is acceptable, particularly for trading applications.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>forecasting methods</kwd><kwd>univariate forecasting</kwd><kwd>Euclidean distance</kwd><kwd>stock price forecasting</kwd></kwd-group><kwd-group xml:lang="en"><kwd>forecasting methods</kwd><kwd>univariate forecasting</kwd><kwd>Euclidean distance</kwd><kwd>stock price forecasting</kwd></kwd-group></article-meta></front><back><ref-list><title>Список литературы</title><ref id="B1"><mixed-citation>Nilsen E. Practical Time Series Analysis: Prediction with Statistics and Machine Learning / ed. by A.A.&amp;nbsp;Alyabiev. Moscow: Dialektika / Vilyams, 2021. 544 p.</mixed-citation></ref><ref id="B2"><mixed-citation>Lurie I.K. Geoinformation Mapping. Methods of Geoinformatics and Digital Cartography: Textbook / 4th ed., rev. and augm. Moscow: Izdatelstvo Moskovskogo universiteta, 2021. 424 p.</mixed-citation></ref><ref id="B3"><mixed-citation>Michael K. Introduction to GIS Based on ArcGIS Pro: User Guide / transl. from English. Moscow: DMK Press, 2023. 312 p.</mixed-citation></ref><ref id="B4"><mixed-citation>Pimpler E. Programming ArcGIS Web Development: Create and share dynamic Web GIS apps using ArcGIS API for JavaScript / Birmingham: Packt Publishing, 2017. 342 p.</mixed-citation></ref><ref id="B5"><mixed-citation>Suvorov I.V. Calculation of Euclidean Distance and Construction of Proximity Zones in Open GIS // GIS-Lab: [website]. 2014. URL: gis-lab.info (accessed: 13.05.2026).</mixed-citation></ref><ref id="B6"><mixed-citation>Sivukhin D.V. General Course of Physics: Textbook for Universities: in 5 Volumes. Vol. 1. Mechanics / 6th ed., stereotype. Moscow: Fizmatlit, 2019. 560 p.</mixed-citation></ref><ref id="B7"><mixed-citation>Irodov I.E. Electromagnetism. Basic Laws: Textbook for Universities / 11th ed. Moscow: Laboratoriya znaniy, 2022. 312 p.</mixed-citation></ref><ref id="B8"><mixed-citation>Bhargava A. Grokking Algorithms. An Illustrated Guide for Programmers and the Curious / transl. from English by E. V. Gupalo. Saint Petersburg: Piter, 2017. 288 p.</mixed-citation></ref><ref id="B9"><mixed-citation>Flach P. Machine Learning. The Art and Science of Algorithms that Make Sense of Data / transl. from English by A.A. Slinkin. 2nd ed. Moscow: DMK Press, 2021. 400 p.</mixed-citation></ref><ref id="B10"><mixed-citation>Kohonen T. Self-Organizing Maps / ed. by I. V. Kotenko. Moscow: Laboratoriya znaniy, 2017. 655&amp;nbsp;p.</mixed-citation></ref><ref id="B11"><mixed-citation>Haykin S. Neural Networks: A Comprehensive Foundation / ed. by N.N. Kussul. 2nd ed., rev. Moscow: Vilyams, 2019. 1104 p.</mixed-citation></ref><ref id="B12"><mixed-citation>Moscow Exchange: quotes, stocks, bonds, currency market. Moscow, 2011-2026. URL: https://www.moex.com/. (accessed: 13.05.2026).</mixed-citation></ref><ref id="B13"><mixed-citation>Graham B., Dodd D. Security Analysis / transl. from English. Moscow: Vilyams, 2016. 880 p.</mixed-citation></ref><ref id="B14"><mixed-citation>Schwager J.D. Technical Analysis. Complete Course / transl. from English by P.A. Samsonov et al. Moscow: Alpina Publisher, 2017. 808 p.</mixed-citation></ref><ref id="B15"><mixed-citation>Export of Sberbank data // FINAM. 2007-2026. URL: https://www.finam.ru/quote/moex/sber/export/. (accessed: 13.05.2026).</mixed-citation></ref><ref id="B16"><mixed-citation>FINAM: investment company. Moscow, 2007-2026. URL: https://www.finam.ru/. (accessed: 13.05.2026).</mixed-citation></ref><ref id="B17"><mixed-citation>Hastie T., Tibshirani R., Friedman J. The Elements of Statistical Learning: Data Mining, Inference, and Prediction / transl. from English. Moscow: Mir, 2020. 768 p.</mixed-citation></ref><ref id="B18"><mixed-citation>Vince R. The Mathematics of Money Management: Risk Analysis Techniques for Traders and Portfolio Managers / transl. from English. Moscow: Alpina Publisher, 2021. 400 p.</mixed-citation></ref><ref id="B19"><mixed-citation>M&amp;uuml;ller M. Information Retrieval for Music and Motion. Berlin; Heidelberg: Springer, 2007. 318 p.</mixed-citation></ref></ref-list></back></article>