
Low-dimensional approximation searching strategy for transfer entropy from non-uniform embedding
Author(s) -
Jian Zhang
Publication year - 2018
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0194382
Subject(s) - transfer entropy , embedding , mutual information , conditional mutual information , conditional entropy , entropy (arrow of time) , computer science , inference , algorithm , multivariate statistics , causality (physics) , joint entropy , information theory , mathematics , data mining , artificial intelligence , machine learning , principle of maximum entropy , statistics , physics , quantum mechanics
Transfer entropy from non-uniform embedding is a popular tool for the inference of causal relationships among dynamical subsystems. In this study we present an approach that makes use of low-dimensional conditional mutual information quantities to decompose the original high-dimensional conditional mutual information in the searching procedure of non-uniform embedding for significant variables at different lags. We perform a series of simulation experiments to assess the sensitivity and specificity of our proposed method to demonstrate its advantage compared to previous algorithms. The results provide concrete evidence that low-dimensional approximations can help to improve the statistical accuracy of transfer entropy in multivariate causality analysis and yield a better performance over other methods. The proposed method is especially efficient as the data length grows.