Skip to content
New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

experiment on undirected graph #8

Open
msqiqi10 opened this issue Sep 22, 2020 · 1 comment
Open

experiment on undirected graph #8

msqiqi10 opened this issue Sep 22, 2020 · 1 comment

Comments

@msqiqi10
Copy link

Hi:

Thank you for your great work!

Now I'm trying to run your code on a unfeatured, undirected graph with a feature vector generated from Deepwalk. But the performance is really poor. I'm wondering if you can please provide some ideas on how should I set up a feature vector? Or how could I improve the performace?

Thanks!

@rusty1s
Copy link
Owner

rusty1s commented Sep 23, 2020

If I understand you correctly, you generate DeepWalk features separately for each graph. Our matching procedure is based on finding correspondences based on locally similar neighborhoods (which is not given in case of DeepWalk features as inputs). Instead of using those features, you can use the torch_geometric.transforms.OneHotDegree transform. This should help the neural network to match nodes based on their structural similarities.

# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants