d-ailin/GDN

graph structure

Opened this issue · 2 comments

mhy139 commented

Hello author, I have observed that the graph structure you created in the code is a fully connected graph mechanism, and did not use the construction method of the graph mechanism you mentioned in your paper. May I ask where this part of the code is or if my understanding is incorrect.
I see that the function you are using is “get_fc_graph_struc ” , function "get_prior_graph_struc" seems to be inconsistent with the graph mechanism construction method you mentioned in your paper. Is there any mistake in my understanding?

We use "get_fc_graph_struc" in the code to first build the fully connected graph and later select the top-k edges based on the sensor embeddings' similarities. The "get_prior_graph_struc" is something experimental, that is we have tried to use prior information about the sensors to build a graph, and it is not used in the paper or code.

mhy139 commented

Thank you very much for your answer. I have another question. Did you use an MLP when you finally output the results?