Replies: 1 comment 11 replies
-
|
Beta Was this translation helpful? Give feedback.
11 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Dear communities and PyG team:
Thanks for the support and contributions first.
I want to use the heterogeneous graph to perform the link prediction task with PyG. Let me briefly describe the task I face first.
I have a heterogeneous graph, which is composed of two types of nodes: consumer and commodity.
The purposes:
Heterogeneous graph:
For the purpose of simplification, at present, each node does not have any attributes, but the edges (commodity, co-occur, commodity) have the attributes of co-occurrence times.
My questions
Do I have to use
ToUndirected(data)
to force my heterogeneous graph to be undirected, because I see the operation inhetero_link_pred.py
(the example helps a lot 😁 ). But there is only a directed graph in its structure, and there is no undirected co-occurrence relation, so I have to use this operation?For the processing of connections between nodes of the same type in
ToUndirected()
and their role in RandomLinkSplit, my code is as follows:How to pass in
edge_types
andrev_edge_types
?There are no connections bwtween user nodes in MovieLens dataset in
hetero_link_pred.py
. it needs to be learned through embedding, but I am confused with the operations as follows:No connections between users and there is no need for message passing. So what's the role of the identity matrix( just for self loop?) And why delete num_nodes, is this necessary for link prediction?
Thanks!
Beta Was this translation helpful? Give feedback.
All reactions