Sparsest Network Support Estimation

A Submodular Approach

Conference Paper (2018)
Author(s)

Mario Coutino (TU Delft - Signal Processing Systems)

Sundeep Prabhakar Chepuri (TU Delft - Signal Processing Systems)

Geert Leus (TU Delft - Signal Processing Systems)

Research Group
Signal Processing Systems
DOI related publication
https://doi.org/10.1109/DSW.2018.8439890 Final published version
More Info
expand_more
Publication Year
2018
Language
English
Research Group
Signal Processing Systems
Article number
8439890
Pages (from-to)
200-204
ISBN (print)
978-1-5386-4411-9
ISBN (electronic)
978-153864410-2
Event
DSW 2018 (2018-06-04 - 2018-06-06), Lausanne, Switzerland
Downloads counter
231
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this work, we address the problem of identifying the underlying network structure of data. Different from other approaches, which are mainly based on convex relaxations of an integer problem, here we take a distinct route relying on algebraic properties of a matrix representation of the network. By describing what we call possible ambiguities on the network topology, we proceed to employ sub-modular analysis techniques for retrieving the network support, i.e., network edges. To achieve this we only make use of the network modes derived from the data. Numerical examples showcase the effectiveness of the proposed algorithm in recovering the support of sparse networks.

Files

SPARSEST_NETWORK_SUPPORT_ESTIM... (pdf)
(pdf | 0.644 Mb)
- Embargo expired in 20-02-2019
License info not available