Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Are the similarity ranking results computed from all data pairs? #13

Open
yutxie opened this issue Oct 21, 2019 · 2 comments
Open

Are the similarity ranking results computed from all data pairs? #13

yutxie opened this issue Oct 21, 2019 · 2 comments

Comments

@yutxie
Copy link

yutxie commented Oct 21, 2019

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!

@tiankonghenlan20113046
Copy link

hello ,friend ,did you implent this paper code ?I am trying to do it ,but failed .

@yutxie
Copy link
Author

yutxie commented Dec 4, 2019

hello ,friend ,did you implent this paper code ?I am trying to do it ,but failed .

sorry, i still haven't tried to implement it yet

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants