-
Hello, I am currently working on adding more node features to my heterogeneous graph. I came accross the function LocalDegreeProfile() in the transforms-module, which I find really helpful! This function creates five more features for each node, that captures information of the nodes own degree and also neighboring node degree. The problem is that it doesen't seem to be implemented for heterogeneous graphs, which is why i'm wondering if anything similar exists for heterogeneous graphs, or any other advice on how do something similar with heterogeneous graph. To be specific: Using the example ('author', 'writes', 'paper'), for all nodes of type 'aurthor', I want to count the number of nodes 'paper' which it is linked to through the edge-type 'writes' Thanks! |
Beta Was this translation helpful? Give feedback.
Replies: 2 comments 4 replies
-
Thanks for bringing this up. Currently there's nothing similar for heterogenous graphs. But it will be useful to add such support to You could use something similar to the below code to achieve this for now
|
Beta Was this translation helpful? Give feedback.
-
Is there any way to do this with ontolearn library? |
Beta Was this translation helpful? Give feedback.
Thanks for bringing this up. Currently there's nothing similar for heterogenous graphs. But it will be useful to add such support to
LocalDegreeProfile
. And the implementation would have to handle neighborhoods through different edge types.You could use something similar to the below code to achieve this for now