.png){kind=icon}
Return
Multiple sparse graphs condensation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110904.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The high complexity of graph neural networks (GNNs) on large-scale networks hinders their industrial application. Graph condensation (GCond) was recently proposed to condense the original largescale graph into a small-scale one to address the problem. The goal is to make GNNs trained on the condensed graph perform similarly to those trained on the original graph. GCond achieves satisfactory performance on some datasets. However, GCond uses a single fully connected graph to model the condensed graph, which limits the diversity of embeddings obtained, especially when there are few synthetic nodes. We propose Multiple Sparse Graphs Condensation (MSGC), which condenses the original large-scale graph into multiple small-scale sparse graphs. MSGC takes standard neighborhood patterns as the essential substructures and can construct various connection schemes. Correspondingly, GNNs can obtain numerous sets of embeddings, which significantly enriches the diversity of embeddings. Experiments show that, compared with GCond and other baselines, MSGC has significant advantages at the same condensed graph scale. MSGC can retain nearly 100% performance on Flickr and Citeseer datasets while reducing their graph scale by over 99.0%.(c) 2023 Elsevier B.V. All rights reserved.
Keywords:
Graph condensation
Graph neural network
Neighborhood pattern
Node classification
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
ShareSaveInfrared Optical Constants and Dielectric Response Functions of Silicon Nitride and Oxynitride Films
PREAI
ShareSaveShareSave
View more