Before revision:  DGEN is designed as a two-step graph encoder connected by a graph pooling layer , which learns the graph embedding of the selected nodes. Based on the assumption that a node and its nearest neighbors should belong to the same cluster, we devise the neighbor cluster pooling (NCPool)  to select the most informative subset of vertices based on the clustering assignments of nodes and their nearest neighbor .
After revision:  DGEN is designed as a two-step graph encoder connected by a graph pooling layer , which learns the graph embedding . In our model, it is assumed that if a node and its nearest neighbors should belong to the same cluster, we devise the neighbor cluster pooling (NCPool) to select the most informative subset of vertices based on the clustering assignments of nodes and their nearest neighbor .