图聚类是网络分析的基础问题，这项研究解决了同时利用网络结构和节点属性的难题。做社交网络分析、生物网络或推荐系统的研究者，可以关注这个自学习框架带来的性能提升。
该研究提出了一种基于图神经网络（GNN）和自学习框架的无监督图聚类方法。方法通过多轮自学习迭代，每轮使用GNN生成节点表示并进行聚类，聚类结果影响下一轮的图结构。同时，每轮利用原始图构建上下文图来生成节点表示。实验表明，该方法能同时利用网络边和节点属性信息，在合成数据上优于仅依赖网络或属性的算法。多轮学习持续提升性能，且优于单轮长训练。在真实数据集上，当簇大小平衡时，该方法与现有最优方法竞争力相当。
Clustering Node Attributed Networks with Graph Neural Networks and Self Learning
Graph clustering - partitioning the node set of a graph into disjoint subsets that reflect some latent information - is a fundamental problem as it finds applications in a myriad of different scenarios. While this classic problem has been tackled for decades by different communities, a recent variation of the problem driven by real data considers the scenario where nodes have attributes that are also informative. This has triggered novel methods that simultaneously leverage network information (edges) and node information (attributed) in the design of novel clustering algorithms. This work proposes a novel framework that builds on prior works that have applied graph neural networks (GNN) to graph clustering. The proposed framework operates in rounds of self learning in a fully unsupervised setting. In each round, a GNN generates representations for nodes that are used to cluster the nodes. This clustering influences the graph used to generate the node representation in the next round. Moreover, a context graph built in each round using the original graph is used to generate the node representations. Empirical results show that the proposed methodology extracts information from both network edges and node attributes in synthetic data, outperforming algorithms focused solely on the network or attributes when neither are very informative. Multiple rounds of learning also improve the performance and always outperforms a long single round of training (i.e., classic GNN graph clustering). When considering real datasets, empirical results indicate that the proposed methodology is competitive to state-of-the-art methods when cluster sizes are balanced.