Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features.
Jiuhai ChenJonas MuellerVassilis N. IoannidisSoji AdeshinaYangkun WangTom GoldsteinDavid WipfPublished in: ICLR (2022)
Keyphrases
- graph structure
- directed graph
- graph theory
- graph representation
- edge weights
- finding the shortest path
- weighted graph
- undirected graph
- graph theoretical
- nodes of a graph
- feature extraction
- graph structures
- graph theoretic
- feature vectors
- graph properties
- graph partitioning
- random walk
- graph construction
- graph databases
- structural pattern recognition
- labeled graphs
- feature set
- random graphs
- graph clustering
- structured data
- graph matching
- graph model
- path length
- graph data
- shortest path
- maximal cliques
- graph representations
- graph classification
- bipartite graph
- adjacency graph
- spanning tree
- feature space