DIRECTED NETWORK INFERENCE USING A MEASURE OF DIRECTED INFORMATION

The concept of mutual information (MI) has been widely used for inferring complex networks such as genetic regulatory networks. However, the MI based methods cannot infer di-rected or dynamic networks. In this paper, we propose a new network inference algorithm to infer directed acyclic net-works which can determine both the connectivity and causal-ity between different nodes based on the concept of directed information (DI) and conditional directed information. The proposed method is applied to both simulated data and Elec-troencephalography (EEG) data to evaluate its effectiveness. Index Terms — Information theory, Directed graphs, Electroencephalograph