Loading...
Please wait, while we are loading the content...
Similar Documents
Neural Graph Similarity Computation with Contrastive Learning
| Content Provider | MDPI |
|---|---|
| Author | Hu, Shengze Zeng, Weixin Zhang, Pengfei Tang, Jiuyang |
| Copyright Year | 2022 |
| Description | Computing the similarity between graphs is a longstanding and challenging problem with many real-world applications. Recent years have witnessed a rapid increase in neural-network-based methods, which project graphs into embedding space and devise end-to-end frameworks to learn to estimate graph similarity. Nevertheless, these solutions usually design complicated networks to capture the fine-grained interactions between graphs, and hence have low efficiency. Additionally, they rely on labeled data for training the neural networks and overlook the useful information hidden in the graphs themselves. To address the aforementioned issues, in this work, we put forward a contrastive neural graph similarity learning framework, Conga. Specifically, we utilize vanilla graph convolutional networks to generate the graph representations and capture the cross-graph interactions via a simple multilayer perceptron. We further devise an unsupervised contrastive loss to discriminate the graph embeddings and guide the training process by learning more expressive entity representations. Extensive experiment results on public datasets validate that our proposal has more robust performance and higher efficiency compared with state-of-the-art methods. |
| Starting Page | 7668 |
| e-ISSN | 20763417 |
| DOI | 10.3390/app12157668 |
| Journal | Applied Sciences |
| Issue Number | 15 |
| Volume Number | 12 |
| Language | English |
| Publisher | MDPI |
| Publisher Date | 2022-07-29 |
| Access Restriction | Open |
| Subject Keyword | Applied Sciences Artificial Intelligence Graph Similarity Learning Graph Neural Network Contrastive Learning Graph Edit Distance |
| Content Type | Text |
| Resource Type | Article |
