Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings.
Khoa D. Doan|Saurav Manchanda|Suchismit Mahapatra|Chandan K. Reddy
| Anthology ID: | DBLP:conf/sigir/DoanMMR21 |
|---|---|
| Volume: | SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual Event, Canada, July 11-15, 2021 |
| Year: | 2021 |
| Venue: | Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) |
| Publisher: | ACM |
| Pages: | 665-674 |
| URL: | https://doi.org/10.1145/3404835.3462960 |
| DOI: | https://doi.org/10.1145/3404835.3462960 |
| DBLP: | conf/sigir/DoanMMR21 |
| BibTeX: |
@inproceedings{doan-2021-interpretable,
author = {Khoa D. Doan and
Saurav Manchanda and
Suchismit Mahapatra and
Chandan K. Reddy},
editor = {Fernando Diaz and
Chirag Shah and
Torsten Suel and
Pablo Castells and
Rosie Jones and
Tetsuya Sakai},
title = {{Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings}},
booktitle = {{SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual Event, Canada, July 11-15, 2021}},
pages = {665--674},
publisher = {ACM},
year = {2021},
url = {https://doi.org/10.1145/3404835.3462960},
doi = {https://doi.org/10.1145/3404835.3462960}
}