This is a TensorFlow implementation of the Adversarially Regularized Graph Autoencoder(ARGA) model as described in our paper: Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., & Zhang, C. (2018). Adversarially Regularized Graph Autoencoder for Graph Embedding, [https://www.ijcai.org/proceedings/2018/0362.pdf].
Can u publish the details of the node clustering experiments in your papers?
eg.
the repeat count of kmeans
is the experiment result best value or average value
Can u publish the details of the node clustering experiments in your papers? eg. the repeat count of kmeans is the experiment result best value or average value