Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks.
Acong ZhangJincheng HuangPing LiKai ZhangPublished in: ACM Trans. Knowl. Discov. Data (2024)
Keyphrases
- average degree
- edge weights
- graph structure
- directed graph
- fully connected
- graph structures
- betweenness centrality
- small world
- network structure
- overlapping communities
- directed edges
- real world graphs
- heterogeneous social networks
- sparsely connected
- small world networks
- weighted graph
- neighboring nodes
- social networks
- shortest path
- complex networks
- real world social networks
- path length
- connected components
- undirected graph
- densely connected
- bipartite graph
- adjacency matrix
- real world networks
- graph representation
- community detection
- graph theory
- network size
- random graphs
- network topologies
- random walk
- missing links
- graph mining
- graph mining algorithms
- massive graphs
- social graphs
- graph layout
- graph theoretic
- spanning tree
- network properties
- community discovery
- information networks
- dominating set
- social network analysis
- network analysis
- connected graphs
- community structure
- network architecture
- wireless sensor networks
- structured data
- finding the shortest path
- link prediction
- biological networks
- scale free
- planar graphs