Treffer: Optimal Selection of Observations for Identification of Multiple Modules in Dynamic Networks.

This article presents a systematic algorithm to select a set of auxiliary measurements in order to consistently identify certain transfer functions in a dynamic network from observational data. The selection of the auxiliary measurements is obtained by minimizing an appropriate cost function. It is assumed that the topology of the network is known, the forcing inputs are not measured, and the observations have positive additive costs. It is shown that sufficient and necessary conditions for consistent identification of a single transfer function based on a multi-input single-output prediction error method, are equivalent to the notion of minimum cut in an augmented graph resulted from systematically manipulating the graphical representation of the network. Then, the optimal set of auxiliary measurements minimizing the cost could be found using different approaches such as algorithms from graph theory (i.e., Ford-Fulkerson), distributed algorithms (i.e., push-relabel algorithm), or purely optimization based procedures (i.e., linear programming). The results are also extended to the more challenging scenario, where the objective is simultaneously identifying multiple transfer functions. [ABSTRACT FROM AUTHOR]

Copyright of IEEE Transactions on Automatic Control is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)