Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications

DOI10.1109/TIT.2021.3123944zbMATH Open1489.94050OpenAlexW3208860981MaRDI QIDQ5030320FDOQ5030320

Authors: Rishabh Iyer, Ninad Khargonkar, Jeff A. Bilmes, Himanshu Asnani

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2021.3123944

zbMATH Keywords

clustering submodular functions entropic measures combinatorial information measures robust partitioning

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Cited In (1)

Adaptive test allocation for outbreak detection and tracking in social contact networks

This page was built for publication: Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030320)