We propose a new estimator to measure directed dependencies in time series. The dimensionality of data is first reduced using a new non-uniform embedding technique, where the variables are ranked according to a weighted sum of the amount of new information and improvement of the prediction accuracy provided by the variables. Then, using a greedy approach, the most informative subsets are selected in an iterative way. The algorithm terminates, when the highest ranked variable is not able to significantly improve the accuracy of the prediction as compared to that obtained using the existing selected subsets. In a simulation study, we compare our estimator to existing state-of-the-art methods at different data lengths and directed dependencies strengths. It is demonstrated that the proposed estimator has a significantly higher accuracy than that of existing methods, especially for the difficult case, where the data is highly correlated and coupled. Moreover, we show its false detection of directed dependencies due to instantaneous couplings effect is lower than that of existing measures. We also show applicability of the proposed estimator on real intracranial electroencephalography data.
翻译:我们建议一个新的估计值, 以测量时间序列中直接依赖性。 数据维度首先通过一种新的非统一嵌入技术降低, 变量按新信息量的加权和新变量提供的预测准确性进行排序。 然后, 使用贪婪的方法, 以迭接方式选择信息最丰富的子集。 当排名最高的变量无法显著提高预测的准确性, 与使用现有选定子集获得的预测相比, 算法终止。 在模拟研究中, 我们用不同数据长度和定向依赖性强的现有状态方法来比较我们的估计值。 事实证明, 拟议的估计值比现有方法的准确性要高得多, 特别是在数据高度关联和相互交织的困难情况下。 此外, 我们显示它错误地检测了由于瞬间组合效应而产生的直接依赖性, 低于现有计量标准。 我们还显示, 拟议的估计值适用于真实的内线电子视镜数据。