uGLAD: Sparse graph recovery by optimizing deep unrolled networks.
Harsh ShrivastavaUrszula ChajewskaRobin AbrahamXinshi ChenPublished in: CoRR (2022)
Keyphrases
- graph theory
- small world
- highly connected
- gaussian graphical models
- graph structures
- edge weights
- average degree
- social networks
- fully connected
- densely connected
- graph representation
- directed graph
- community discovery
- dynamic networks
- graphical representation
- weighted graph
- graph structure
- bipartite graph
- high dimensional
- clustering coefficient
- directed edges
- heterogeneous networks
- graph model
- complex networks
- structured data
- overlapping communities
- betweenness centrality
- social graphs
- sparse data
- community detection
- graph layout