Selective pattern matching method for time-series forecasting
DOI:
https://doi.org/10.15587/1729-4061.2015.54812Keywords:
time series, forecasting, indexing, increment sign, pattern matchingAbstract
The selective pattern matching method for forecasting the increment signs of financial time series is proposed. This approach is based on indexing the time series to find similar sites in their dynamics based on the K-nearest neighbors method and selective grouping of these sites by the increment signs observed when completed. Similar sites are identified by calculating measures of similarity between the supporting and non-supporting stories of time series. Depending on the representation of time series, Hamming measure or Euclidian measure can be used for indexing. Before applying the method, it is recommended to carry out the procedure of pre-forecasting fractal time series analysis for determining the levels of persistence, antipersistence and randomness of time series, identifying the availability of memory and determining the medium length of quasicycles. The parameters, defined based on the pre-forecasting analysis are used in forecast generation by the described method. The proposed method can be used as part of information forecasting and decision support systems, including those used in the currency market to improve the accuracy of forecasting the increment signs of time series.
References
- Azoff, M. E. (1994). Neural Network Time Series Forecasting of Financial Markets. Cornwall: John Wiley & Sons, 212.
- Ferreira, C. (2001). Gene expression programming. A new adaptive algorithm for solving problems. Complex Systems, 13 (2), 87–129.
- Barbulescu, A., Bautu, E. (2009). Time series modeling using an adaptive gene expression programming algorithm. International Journal of Mathematics and Computation, 3 (2), 85–93.
- Matviychuk, A. V. (2007). Economic processes modeling using fuzzy logic methods. Kyiv: KNEU, 264.
- Snytyuk, V. E. (2008). Forecasting. Models. Methods. Algorithms. Kyiv: Maklaut, 364.
- Lukashin, Yu. P. (2003). Adaptive methods of near-term time series forecasting. Moscow: Finanсe and Statistics, 416.
- Box, G. E. P., Jenkins, G. M. (1976). Time series analysis: forecasting and control. San Francisco: Holden-Day, 575.
- Brown, R. G. (1959). Statistical forecasting for inventory control. US: McGraw-Hill Inc., 223.
- Holt, C. C. (1957). Forecasting trends and seasonal by exponentially weighted averages. International. Journal of Forecasting, 20 (1), 5–10.
- Vercellis, C. (2009). Business intelligence: data mining and optimization for decision making. Cornwall: John Wiley & Sons, 417. doi: 10.1002/9780470753866
- Berzlev, A. (2013). A method of increments sings forecasting of time series. Eastern-European Journal of Enterprise Technologies, 2 (4 (62)), 8–11. Available at: http://journals.uran.ua/eejet/article/view/12362/10250
- Berzlev, A. (2012) Development of combined forecasting models from time series clustering method for nearest neighbor. Management Information System and Devices, 161, 51–59.
- Singh, S. (2000). Pattern modeling in time-series forecasting. Cybernetics and Systems. An International Journal, 31 (1), 49–65. doi: 10.1080/019697200124919
- Perlin, M. S. (2007). Nearest neighbor method. Revista Eletrônica de Administração, 13 (2), 15.
- Fernández-Rodríguez, F. Sosvilla-Rivero, S. Andrada-Félix, J. (2002). Nearest-neighbour predictions in foreign exchange markets. Fundacion de Estudios de Economia Aplicada, 5, 36.
- Peters, E. E. (1994). Fractal market analysis: applying chaos theory to investment and economics. Cornwall: John Wiley & Sons, 36.
- Hurst, H. E. (1951). Long-term storage capacity of reservoirs. Transactions of the American Society of Civil Engineers, 116, 770–799.
- Berzlev, A. (2013). Methods of pre-forecasting fractal time series analysis. Management of development of difficult systems, 16, 76–81.
- Anis, A., Lloyd, E. (1976). The expected value of the adjusted rescaled Hurst Range of independent normal summands. Biometrika, 63, 111–116. doi: 10.2307/2335090
- Kahveci, T., Singh, A. (2001). Variable length queries for time series data. Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany, 273–282. doi: 10.1109/icde.2001.914838
- Chang, C. L. E., Garcia-Molina, H., Wiederhold, G. (2002). Clustering for approximate similarity search in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14 (4), 792–808. doi: 10.1109/tkde.2002.1019214
- Zaychenko, Y. (2008). Fuzzy models and methods in intelligent systems. Kiev: Slovo, 344.
- Goldin, D. Q., Kanellakis, P. C. (1995). On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. Proceedings of the 1-st International Conference on the Principles and Practice of Constraint Programming. Cassis, France, 137–153. doi: 10.1007/3-540-60299-2_9
- Kuchansky, A., Nikolenko, V. (2015). Pattern matching method for time-series forecasting. Management of Development of Complex Systems, 22, 101–106.
- Berzlev, A. (2013). The current state of information systems of time series forecasting. Management of development of difficult systems, 13, 78–82.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Олександр Юрійович Кучанський, Андрій Олександрович Білощицький
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.