Submitted by J00Nnn t3_zlmvcp in MachineLearning

I am solving a graph-level problem. I want to fit graph embeddings to a learn-to-rank NN to rank the graphs by their "quality". The "quality" of the graphs is determined by whether they have certain shape or structure, say they have self-loops and no loose end, has many split nodes and merging nodes etc. The node and edge features are not in consideration.

To my understanding, graph embeddings are best suited for graph similarity comparison, are there any techniques that can fit my use case?



You must log in or register to comment.

Weary-Marionberry-15 t1_j06hbfh wrote

Is your “quality” known for each graph? If so, I recon you could do this by simply building a convolutional graph neural network and phrase this as a regression problem (assuming quality is a float).


J00Nnn OP t1_j09l1ov wrote

Thanks for replying! The quality of the graph is known in pairs like this: {G1 > G2, G3 > G4}, I'm not sure if that is suitable for convolutional GNN.


Weary-Marionberry-15 t1_j0azzw2 wrote

Could you elaborate on what this pair is? It’s not clear to me what the entries are.


KlutzyLeadership3652 t1_j07w3yc wrote

Graph Matching Networks could be a good starting point. As another comment said, you do need to have some supervision (annotated graphs).


J00Nnn OP t1_j09l1n7 wrote

Thanks! I will take a look at the papers.