In the actual library implementation is possibile to learn the graph structure (the adjacency matrix) from the data together with the weights? I don’t know if this type of task has a name (maybe graph?), however, is it already built? Until now, I have seen only tutorials to learn weight matrix W and nothing about the adjacency matrix A.
I’m not sure what exactly you mean, but there’s generated model to generate molecules, which can be considered as a graph.
There is some very recent research on learning the graph structure along with the graph neural network parameters: https://github.com/lucfra/LDS-GNN.
However, this implementation from the authors is in Tensorflow and I’m not sure if anyone has done a DGL version. Could be a feature request?
Hi all! I understood that learning the graph structure corresponds to learn the adjacency matrix together with the weights and that is usually known as dynamic graphs… So, if the actual gdl implementation doesn’t provide this case, can I do a feature request?
I would definitely love this is a feature request too! Great idea! I was considering implementing a similar model a
dgl generative model.