You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
After reading the paper, I'm wondering whether the the similarity ranking results are computed from all data pairs in the second task of the experiment section (also the unsupervised training). Cuz I found even the approximation version of GED would take a long time to compute on so many graph pairs.
And if you did calculate the GED for all data pairs, how long has it taken to finish the computation?
Thanks!
The text was updated successfully, but these errors were encountered:
Hi @yunshengb, thanks for sharing the code!
After reading the paper, I'm wondering whether the the similarity ranking results are computed from all data pairs in the second task of the experiment section (also the unsupervised training). Cuz I found even the approximation version of GED would take a long time to compute on so many graph pairs.
And if you did calculate the GED for all data pairs, how long has it taken to finish the computation?
Thanks!
The text was updated successfully, but these errors were encountered: