Hi,
You have stated "In order to use your own data, you have to provide
an N by N adjacency matrix (N is the number of nodes),
an N by D feature matrix (D is the number of features per node), and
an N by E binary label matrix (E is the number of classes)."
could you tell exactly where in the code do they go to use them? or maybe tell more about the following files:
graph_indicator.txt, _node_labels.txt, _node_attributes.txt, _graph_labels.txt, _graph_labels2.txt, _A.txt, _edge_attributes.txt, opt_BrainNet.mat.
Hi, You have stated "In order to use your own data, you have to provide an N by N adjacency matrix (N is the number of nodes), an N by D feature matrix (D is the number of features per node), and an N by E binary label matrix (E is the number of classes)."
could you tell exactly where in the code do they go to use them? or maybe tell more about the following files: graph_indicator.txt, _node_labels.txt, _node_attributes.txt, _graph_labels.txt, _graph_labels2.txt, _A.txt, _edge_attributes.txt, opt_BrainNet.mat.