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

Hi Mark, how to construct the joint adj A and the truth alignment adj P? #3

Open
Weifanwong opened this issue Dec 10, 2018 · 7 comments

Comments

@Weifanwong
Copy link

Weifanwong commented Dec 10, 2018

Hi Mark,

Sorry to bother you again. Now I try to use some datasets(arenas-meta.edges) get online as A1 for your REGAL program. As I learned from your paper, the input for this program is a jointed matrix in the form as A = [A1,0;0,A2]. 
The adjacency matrix A1 is the true adj of the network we focus on, while the other matrix A2 is just generated by A2 = P * A1 *P' (P is randomly generated).  
Now, I have constructed both the jointed adjacency matrix A and the true-alignment matrix P as input in your method. But my output result is really bad... I only got 0.02 for score top10. 
I've spent 2 days on contructing the correct-format input file for the program. The input file I constructed and the corresponding code generating it have been upload as appendix.
I'm afraid it would be a bother for you to read my code or find mistakes in it... So would you like to give some more detail about how to construct the joint adj A and the truth alignment file P which respectively respond to the file named "arenas_combined_edges.txt" and the file named "arenas_edges-mapping-permutation" in your program? It would be better if you already have some program deal with this problem and if you can share it with me...

I have been confused on this problem for a long time... I'm looking forward to your reply.

Best wishes,
Weifan

code.zip

@Weifanwong
Copy link
Author

Weifanwong commented Dec 10, 2018

maybe it would look better to send you an e-mail. So I've send one to your mail-box

@shubhams
Copy link

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!

@Weifanwong
Copy link
Author

Weifanwong commented May 9, 2019 via email

@shubhams
Copy link

shubhams commented May 9, 2019

Hi @Weifanwong, thanks for your reply and help, but I could not see any code files in your last comment.
If it's not too much trouble, could I ask you to send them to me on my email, [email protected]?

@FFTD
Copy link

FFTD commented Sep 23, 2019

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.
If it's not too much trouble, could you please send me the code.
Email: [email protected]

@renzunxiao
Copy link

maybe it would look better to send you an e-mail. So I've send one to your mail-box

@Weifanwong您好,我看到了您在REGAL模型下的提问,我运行了REGAL代码,top50的结果是0.008811,作者在图中展示的结果是0.8,他所表示的意思应该是0.8%的准确率吧。您觉得呢?我也不太会处理文章中两个矩阵的形式,请问可以分享给我代码吗,如果数据集也能分享一下的话,就太好啦,谢谢您啦~打扰了,很抱歉,期待您的回复。我的邮件是:[email protected]

@1017yxc
Copy link

1017yxc commented Jun 7, 2024

@Weifanwong 您好,我遇到了相同的问题,不知道如何连接两个邻接矩阵,不知道您能不分享一下您的代码。抱歉打扰了,诚盼您的回复。我的邮箱是:[email protected]

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

5 participants