Skip to content
Discussion options

You must be logged in to vote

Thanks for your reply @wsad1 . Let me describe the question a bit more.

Assume that there is a graph with m nodes, n edges, every time when removing a or serval edge(s) from the graph, a defined score is calculated. Now I would like to predict the value of the score when removing a/some new edges from the graph.

My solution: convert this question into a graph level prediction question. After removing a/some edges from the graph, actually we can get/generate a new graph. So we can get a dataset contains a lot of graphs by random removing edges from the graph. Each graph is corresponding to a score -> predict label. Now the issue is predict such score for a given graph.

My questions:

  • Does …

Replies: 2 comments 4 replies

Comment options

You must be logged in to vote
0 replies
Comment options

You must be logged in to vote
4 replies
@rusty1s
Comment options

@lingxuan9
Comment options

@lingxuan9
Comment options

@rusty1s
Comment options

Answer selected by lingxuan9
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
3 participants