Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Problemy Peredachi Informatsii, 2016, Volume 52, Issue 1, Pages 101–109 (Mi ppi2198)  

This article is cited in 8 scientific papers (total in 8 papers)

Source Coding

Time series prediction based on data compression methods

A. S. Lysyaka, B. Ya. Ryabkoba

a Novosibirsk State University, Novosibirsk, Russia
b Institute of Computational Technologies, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Full-text PDF (242 kB) Citations (8)
References:
Abstract: We propose efficient (“fast” and low memory consuming) algorithms for universal-coding-based prediction methods for real-valued time series. Previously, for such methods it was only proved that the prediction error is asymptotically minimal, and implementation complexity issues have not been considered at all. The provided experimental results demonstrate high precision of the proposed methods.
Funding agency Grant number
Russian Foundation for Basic Research 15-07-01851
Supported in part by the Russian Foundation for Basic Research, project no. 15-07-01851.
Received: 19.03.2015
Revised: 19.12.2015
English version:
Problems of Information Transmission, 2016, Volume 52, Issue 1, Pages 92–99
DOI: https://doi.org/10.1134/S0032946016010075
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: A. S. Lysyak, B. Ya. Ryabko, “Time series prediction based on data compression methods”, Probl. Peredachi Inf., 52:1 (2016), 101–109; Problems Inform. Transmission, 52:1 (2016), 92–99
Citation in format AMSBIB
\Bibitem{LysRya16}
\by A.~S.~Lysyak, B.~Ya.~Ryabko
\paper Time series prediction based on data compression methods
\jour Probl. Peredachi Inf.
\yr 2016
\vol 52
\issue 1
\pages 101--109
\mathnet{http://mi.mathnet.ru/ppi2198}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3512910}
\elib{https://elibrary.ru/item.asp?id=28876230}
\transl
\jour Problems Inform. Transmission
\yr 2016
\vol 52
\issue 1
\pages 92--99
\crossref{https://doi.org/10.1134/S0032946016010075}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000376106900007}
\elib{https://elibrary.ru/item.asp?id=27155840}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84966388998}
Linking options:
  • https://www.mathnet.ru/eng/ppi2198
  • https://www.mathnet.ru/eng/ppi/v52/i1/p101
  • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:412
    Full-text PDF :72
    References:58
    First page:31
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024