Hi, thank you for your work!
I have a question as stated in the title. For example. there is a hyper-edge "A2, U2, L1" in the test dataset, in the training process, you remove the hyper-edge, and then when predicting, you predict whether the hyper-edge exists, or to predict whether there is an edge between 'A2' and 'U2' (or 'A2' and 'L1' ...)?
Furthermore, is this method only suitable for the situation that there are links between any two vertices in the hyper-edge? Considering this situation that ‘there are edges between A1 and U1, U1 and L1, but there is no edge between A1 and L1’, is this method still suitable?
For your first question, the link means hyper-edge. I predict whether the hyper-edge(A2-U2-L1) exists.
For your second question, in my paper, i focus on the indecomposable hyperedge. In this case, the hyperedge has a strong relationship, and cannot expand into multiple pairwise relationships. There are no links between any two vertices. You can read my paper for more details. As for the situation that ‘there are edges between A1 and U1, U1 and L1, but there is no edge between A1 and L1’, it is a tradtional network problem, you can use traditional network embedding method, like most methods in the survey, to solve it.
Hi, thank you for your work! I have a question as stated in the title. For example. there is a hyper-edge "A2, U2, L1" in the test dataset, in the training process, you remove the hyper-edge, and then when predicting, you predict whether the hyper-edge exists, or to predict whether there is an edge between 'A2' and 'U2' (or 'A2' and 'L1' ...)?
Furthermore, is this method only suitable for the situation that there are links between any two vertices in the hyper-edge? Considering this situation that ‘there are edges between A1 and U1, U1 and L1, but there is no edge between A1 and L1’, is this method still suitable?
Looking forward to your reply! Thank you so much!