uhh-lt / path2vec

Learning to represent shortest paths and other graph-based measures of node similarities with graph embeddings
Apache License 2.0
32 stars 14 forks source link

Compare to the GCN embeddings #23

Closed alexanderpanchenko closed 5 years ago

alexanderpanchenko commented 5 years ago

About

Implementations

alexanderpanchenko commented 5 years ago

won't fix this this reason:

On Nov 15, 2018, at 17:26, Oleksiy Oliynyk oleksiy.oliynyk@gmail.com wrote:

regarding GCN:

I read the articles and this approach requires features of the nodes.

So in the implementation mentioned in the issue, they use 2 files as a input. https://github.com/tkipf/keras-gcn/tree/master/kegra/data/cora

one just contains pair of ids per line, but second has a) id --- it's obvious b) feature vector per every node (with binary values if feature is present or not) --- not sure what I can put here c) class --- we have just one class which is synset

Right, technically this approach in fact can’t be compared directly to our method as we do not really on the node features! In this case, I suggest to for now suspend this task.