Reconstructing dynamical networks via feature ranking

Grau Leguia, Marc; Levnajić, Zoran; Todorovski, Ljupčo; Ženko, Bernard

doi:http://dx.doi.org/10.1063/1.5092170

Reconstructing dynamical networks via feature ranking

License

Citation

Leguia MG, Levnajić Z, Todorovski L, Ženko B. Reconstructing dynamical networks via feature ranking. Chaos. 2019 Sep;29(9):093107. DOI: 10.1063/1.5092170

Abstract

Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the structure of networks from time-resolved observations of their node-dynamics. The methods based on physical insights often rely on strong assumptions about the properties and dynamics of the scrutinized network. Here, we use the insights from machine learning to design a new method of network reconstruction that essentially makes no such assumptions. Specifically, we interpret the available trajectories (data) as “features” and use two independent feature ranking approaches—Random Forest and RReliefF—to rank the importance of each node for predicting the value of each other node, which yields the reconstructed adjacency matrix. We show that our method is fairly robust to coupling strength, system size, trajectory length, and noise. We also find that the reconstruction quality strongly depends on the dynamical regime. Recent technological developments make empirical data on complex systems from different scientific areas increasingly available. Yet, precise equations governing them remain elusive. As a consequence, there is a need for methods for inferring the structure of these complex systems from the available data. A good example are methods for network reconstruction from time-resolved observations of their node dynamics. Crucial here are assumptions one is ready to make about the underlying system when developing the method. Diverse methods have been proposed based on physical insights about the nature of the system (for example, limit-cycle oscillations). While making the method elegant, these assumptions often (severely) limit the method’s applicability in a realistic setting. Here we seek to design a method with minimal assumptions possible. We resort to machine learning and interpret the available data (time series) as “features.” Relying on two different feature ranking approaches, we rank the importance of each node for predicting the value of any other node. This information, as we show, reconstructs the network’s adjacency matrix. Our method is fairly robust to coupling strength, system size, trajectory length, and noise, thus making it suitable for practical applications in a broad spectrum of complex systems.