HKUST-KnowComp / MNE

Source Code for IJCAI 2018 paper "Scalable Multiplex Network Embedding"
75 stars 25 forks source link

Does this program work only with directed graphs ? #18

Closed eneszv closed 5 years ago

eneszv commented 5 years ago

From the data/###.edges file it is evident that this example graph is directed. If I want to use an undirected graph, do I need to make for every edge "a--b" one more edge "b--a" in edge list file?

From the 262. line in MNE.py, there is parameter directed = False but in your example, you have directed graph. Further, in line 331. it says:

directed = if False (default), take neighbour from two directions, if True, take neighbour from one direction.

Does this mean if we want to use a directed graph, we use directed = False and vice versa, if we have undirected graph we change directed = True ?

panda0881 commented 5 years ago

Hi Enes,

By default, we didn't consider the edge direction, which means that we treat the graph as undirected. Yes, you can change that by switching 'directed' to True. Actually, this setting only influences the random walk process. To be honest, I think current network embeddings may not effectively preserve the direction information because their training loss is based on co_occurrence information.

Best Regards, Hongming