search

HongyangGao / Graph-U-Nets

Pytorch implementation of Graph U-Nets (ICML19)
http://proceedings.mlr.press/v97/gao19a/gao19a.pdf
GNU General Public License v3.0
513 stars 100 forks source link

Nice job #5

Closed ghost closed 5 years ago

ghost commented 5 years ago

But I think you can do more experiment about the node classification. Since I think the fixed split on nodes is not enough. Maybe the random split on nodes can give more convincing results.

HongyangGao commented 5 years ago

Hi, thank for your advice. That is true. But to make it easier for preparation, we use the same splits as previous node classification methods. We may add more experiments in the future. Thank you.