-
Notifications
You must be signed in to change notification settings - Fork 42
Open
Description
Hi, i need your help.
- When i read your paper. I saw you said: "All the graphs are undirected and preprocessed to have self-loops to speed up training". Besides, you also can said: "we propose to use a random walk style normalization ̄A=D−1A which only involves the degree of the source nodes to equate the normalized adjacency matrix to the corresponding probability transition matrix". In here, you use "degree of source node" terms, i think this terms equivalent with "out-degree" terms. But "out-degree" terms only use for directed graph. So, it make me confuse, i can't understand your graph is undirected or directed.
- Why self-loop can speed up trainning? and What mean "normalized adjacency matrix to the corresponding probability transition matrix"?
- I see your code in botgen folder. It seem create a botnet by pick random some node. So, I want to ask, by randomly selecting bot nodes, is it possible to create a botnet with the same topology as in reality and why?
Thank for your help!
Metadata
Metadata
Assignees
Labels
No labels