Jose Vinicius de Miranda Cardoso

Structured Graph Learning Via Laplacian Spectral Constraints

Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. But structured graph learning from observed samples is an NP-hard combinatorial problem. In this paper, we first show, for a set of important graph families it is possible…