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

[Graph2Vec] the right way to build the attributed graph... #151

Open
Fay-why opened this issue Oct 10, 2023 · 1 comment
Open

[Graph2Vec] the right way to build the attributed graph... #151

Fay-why opened this issue Oct 10, 2023 · 1 comment

Comments

@Fay-why
Copy link

Fay-why commented Oct 10, 2023

hi~ dear author, thanks for your job and I've starred this project!!!

I met a troublesome problem when I try to use graph2vec to infer the whole graph embedding. I have some graph which consists of different size of nodes. But, all these nodes are consist of several node types. I notice that I can add the feature to each node to build graph. I wonder whether building graph in this way can hold the topological structure and node type information together or not.

Actually, I think I should check the WL subgraph-splitting method to check whether the features worked. However, it's too hard for me to understand...

Can you help me?

@guyuleaves
Copy link

I am facing the same problem of the attributed graph embedding.

As my understanding, if you add the node features in the graph initiation via NetworkX and set the args atttributed is Ture of the Graph2Vec, it will generate a embedding that both represents the topological structure and node features.

However, im still confused that i don't kown how the node features are embed like the paper illusrtated 4.3.1 using WL kernel. In fact, in the coding, the node with features are encoded to HashMD5 directly, instead of a WL subgraph opearation where each subgraph is encoded to a word.

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

2 participants