Loading…
Objective functions for information-theoretical monitoring network design: what is “optimal”?
This paper concerns the problem of optimal monitoring network layout using information-theoretical methods. Numerous different objectives based on information measures have been proposed in recent literature, often focusing simultaneously on maximum information and minimum dependence between the cho...
Saved in:
Published in: | Hydrology and earth system sciences 2021-02, Vol.25 (2), p.831-850 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper concerns the problem of optimal monitoring network layout using information-theoretical methods. Numerous different objectives
based on information measures have been proposed in recent literature,
often focusing simultaneously on maximum information and minimum
dependence between the chosen locations for data collection stations. We discuss
these objective functions and conclude that a single-objective optimization of joint entropy suffices to maximize the collection of information for a given number of stations. We argue that the widespread notion of minimizing redundancy, or dependence between monitored signals, as a secondary objective is not desirable and has no intrinsic justification. The negative effect of redundancy on total collected information is already accounted for in joint entropy, which measures total information net of any redundancies. In fact, for two networks of equal joint entropy, the one with a higher amount of redundant information should be preferred for reasons of robustness against failure.
In attaining the maximum joint entropy objective, we investigate exhaustive optimization, a more computationally tractable greedy approach that adds one station at a time, and we introduce the “greedy drop” approach, where the full set of stations is reduced one at a time. We show that no greedy approach can exist that is guaranteed to reach the global optimum. |
---|---|
ISSN: | 1607-7938 1027-5606 1607-7938 |
DOI: | 10.5194/hess-25-831-2021 |