Chen Jia, Zhong Ming, Li Jianxin, Wang Dianhui, Qian Tieyun, Tu Hang
IEEE Trans Cybern. 2022 Jul;52(7):5935-5946. doi: 10.1109/TCYB.2021.3064092. Epub 2022 Jul 4.
Attributed networks are ubiquitous in the real world, such as social networks. Therefore, many researchers take the node attributes into consideration in the network representation learning to improve the downstream task performance. In this article, we mainly focus on an untouched "oversmoothing" problem in the research of the attributed network representation learning. Although the Laplacian smoothing has been applied by the state-of-the-art works to learn a more robust node representation, these works cannot adapt to the topological characteristics of different networks, thereby causing the new oversmoothing problem and reducing the performance on some networks. In contrast, we adopt a smoothing parameter that is evaluated from the topological characteristics of a specified network, such as small worldness or node convergency and, thus, can smooth the nodes' attribute and structure information adaptively and derive both robust and distinguishable node features for different networks. Moreover, we develop an integrated autoencoder to learn the node representation by reconstructing the combination of the smoothed structure and attribute information. By observation of extensive experiments, our approach can preserve the intrinsical information of networks more effectively than the state-of-the-art works on a number of benchmark datasets with very different topological characteristics.
属性网络在现实世界中无处不在,比如社交网络。因此,许多研究人员在网络表示学习中考虑节点属性,以提高下游任务的性能。在本文中,我们主要关注属性网络表示学习研究中一个未被触及的“过度平滑”问题。尽管拉普拉斯平滑已被当前的先进工作用于学习更鲁棒的节点表示,但这些工作无法适应不同网络的拓扑特征,从而导致新的过度平滑问题,并降低了在某些网络上的性能。相比之下,我们采用一个根据特定网络的拓扑特征(如小世界性或节点收敛性)评估的平滑参数,因此能够自适应地平滑节点的属性和结构信息,并为不同网络导出既鲁棒又可区分的节点特征。此外,我们开发了一个集成自动编码器,通过重建平滑后的结构和属性信息的组合来学习节点表示。通过大量实验观察,在许多具有非常不同拓扑特征的基准数据集上,我们的方法比当前的先进工作更有效地保留了网络的内在信息。