Standard

Time-universal data compression and prediction. / Ryabko, Boris.

2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. стр. 562-566 8849224 (IEEE International Symposium on Information Theory - Proceedings; Том 2019-July).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаяРецензирование

Harvard

Ryabko, B 2019, Time-universal data compression and prediction. в 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849224, IEEE International Symposium on Information Theory - Proceedings, Том. 2019-July, Institute of Electrical and Electronics Engineers Inc., стр. 562-566, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, Франция, 07.07.2019. https://doi.org/10.1109/ISIT.2019.8849224

APA

Ryabko, B. (2019). Time-universal data compression and prediction. в 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (стр. 562-566). [8849224] (IEEE International Symposium on Information Theory - Proceedings; Том 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849224

Vancouver

Ryabko B. Time-universal data compression and prediction. в 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. стр. 562-566. 8849224. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849224

Author

Ryabko, Boris. / Time-universal data compression and prediction. 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. стр. 562-566 (IEEE International Symposium on Information Theory - Proceedings).

BibTeX

@inproceedings{32e997a1a82f4f82a81e2c886b8b608a,
title = "Time-universal data compression and prediction",
abstract = "Suppose there is a large file which should be transmitted (or stored) and there are several (say, m) admissible data-compressors. It seems natural to try all the compressors and then choose the best, i.e. the one that gives the shortest compressed file. Then transfer (or store) the index number of the best compressor (it requires [log m] bits) the compressed file. The only problem is the time, which essentially increases due to the need to compress the file m times (in order to find the best compressor). We propose a method that encodes the file with the optimal compressor, but uses a relatively small additional time: the ratio of this extra time and the total time of calculation can be limited by an arbitrary positive constant. A similar situation occurs when forecasting time series.Generally speaking, in many situations it may be necessary find the best data compressor (or predictor) out of a given set, which is often done by comparing them empirically. One of the goals of this work is to turn such a selection process into a part of the data compression method, automating and optimizing it.",
author = "Boris Ryabko",
year = "2019",
month = jul,
day = "1",
doi = "10.1109/ISIT.2019.8849224",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "562--566",
booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",
address = "United States",
note = "2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

}

RIS

TY - GEN

T1 - Time-universal data compression and prediction

AU - Ryabko, Boris

PY - 2019/7/1

Y1 - 2019/7/1

N2 - Suppose there is a large file which should be transmitted (or stored) and there are several (say, m) admissible data-compressors. It seems natural to try all the compressors and then choose the best, i.e. the one that gives the shortest compressed file. Then transfer (or store) the index number of the best compressor (it requires [log m] bits) the compressed file. The only problem is the time, which essentially increases due to the need to compress the file m times (in order to find the best compressor). We propose a method that encodes the file with the optimal compressor, but uses a relatively small additional time: the ratio of this extra time and the total time of calculation can be limited by an arbitrary positive constant. A similar situation occurs when forecasting time series.Generally speaking, in many situations it may be necessary find the best data compressor (or predictor) out of a given set, which is often done by comparing them empirically. One of the goals of this work is to turn such a selection process into a part of the data compression method, automating and optimizing it.

AB - Suppose there is a large file which should be transmitted (or stored) and there are several (say, m) admissible data-compressors. It seems natural to try all the compressors and then choose the best, i.e. the one that gives the shortest compressed file. Then transfer (or store) the index number of the best compressor (it requires [log m] bits) the compressed file. The only problem is the time, which essentially increases due to the need to compress the file m times (in order to find the best compressor). We propose a method that encodes the file with the optimal compressor, but uses a relatively small additional time: the ratio of this extra time and the total time of calculation can be limited by an arbitrary positive constant. A similar situation occurs when forecasting time series.Generally speaking, in many situations it may be necessary find the best data compressor (or predictor) out of a given set, which is often done by comparing them empirically. One of the goals of this work is to turn such a selection process into a part of the data compression method, automating and optimizing it.

UR - http://www.scopus.com/inward/record.url?scp=85073171866&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2019.8849224

DO - 10.1109/ISIT.2019.8849224

M3 - Conference contribution

AN - SCOPUS:85073171866

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 562

EP - 566

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

ID: 21855012