Context Based Predictive Information
Yuval Shalev *
and Irad Ben-Gal
and Irad Ben-Gal
Laboratory for AI, Machine Learning, Business & Data Analytics, Department of Industrial Engineering, The Tel-Aviv University, Ramat-Aviv 6997801, Israel
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(7), 645; https://doi.org/10.3390/e21070645
Received: 19 May 2019 / Revised: 20 June 2019 / Accepted: 25 June 2019 / Published: 29 June 2019
(This article belongs to the Section Information Theory, Probability and Statistics)
Abstract
We propose a new algorithm called the context-based predictive information (CBPI) for estimating the predictive information (PI) between time series, by utilizing a lossy compression algorithm. The advantage of this approach over existing methods resides in the case of sparse predictive information (SPI) conditions, where the ratio between the number of informative sequences to uninformative sequences is small. It is shown that the CBPI achieves a better PI estimation than benchmark methods by ignoring uninformative sequences while improving explainability by identifying the informative sequences. We also provide an implementation of the CBPI algorithm on a real dataset of large banks’ stock prices in the U.S. In the last part of this paper, we show how the CBPI algorithm is related to the well-known information bottleneck in its deterministic version. View Full-Text
Figure 1
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Shalev, Y.; Ben-Gal, I. Context Based Predictive Information. Entropy 2019, 21, 645.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.