-
Notifications
You must be signed in to change notification settings - Fork 17
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
Hi Mark, how to construct the joint adj A and the truth alignment adj P? #3
Comments
maybe it would look better to send you an e-mail. So I've send one to your mail-box |
Hey @Weifanwong, did you get an answer to your question? |
Hi, sorry for the delay. Luckily, the author Mark has given me another code to solve this problem and I send it to you right now. I hope this can do some help to you.
And I'll copy parts of email he sent to me that might help you use this code:
However, I’ll give you what I have now to hopefully save us both some trouble. I apologize about the mess. I did add a little bit mostly so you could see a dummy example that was small enough to print out (a 5 node graph and its permutation, combined into one graph, with no noise—plus the true alignments). Hopefully you can see how this code accepts input files containing edgelists as well—so if you want, you should be able to directly use this to create further experiments of your own. In any case, I hope it helps.
(config_extra and xnetmf_extra correspond to the config and xnetmf source files in the REGAL reference implementation)
Best,
Weifan
On 4/26/2019 18:17,Shubham Singh<[email protected]> wrote:
Hey @Weifanwong, did you get an answer to your question?
I, too, am confused about how should I combine the two adjacency matrices A1 for graph1 and A2 for graph2 into a new matrix in the format [A1 0; 0 A2].
Can I use the compose method in networkx to merge the two graphs? Would the resulting graph be same as the @markheimann is suggesting?
Thanks for your help!
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub, or mute the thread.
|
Hi @Weifanwong, thanks for your reply and help, but I could not see any code files in your last comment. |
Hi @Weifanwong , I am confused about how to combine the two adjacency matrices too. I have spent several days on it and could not achieve good results. |
@Weifanwong您好,我看到了您在REGAL模型下的提问,我运行了REGAL代码,top50的结果是0.008811,作者在图中展示的结果是0.8,他所表示的意思应该是0.8%的准确率吧。您觉得呢?我也不太会处理文章中两个矩阵的形式,请问可以分享给我代码吗,如果数据集也能分享一下的话,就太好啦,谢谢您啦~打扰了,很抱歉,期待您的回复。我的邮件是:[email protected] |
@Weifanwong 您好,我遇到了相同的问题,不知道如何连接两个邻接矩阵,不知道您能不分享一下您的代码。抱歉打扰了,诚盼您的回复。我的邮箱是:[email protected] |
Hi Mark,
Best wishes,
Weifan
code.zip
The text was updated successfully, but these errors were encountered: