Graph neural networks (GNNs) have been widely investigated in the field of semi-supervised graph machine learning. Most methods fail to exploit adequate graph information when labeled data is limited, leading to the problem of oversmoothing. To overcome this issue, we propose the Graph Alignment Neural Network (GANN), a simple and effective graph neural architecture. A unique learning algorithm with three alignment rules is proposed to thoroughly explore hidden information for insufficient labels. Firstly, to better investigate attribute specifics, we suggest the feature alignment rule to align the inner product of both the attribute and embedding matrices. Secondly, to properly utilize the higher-order neighbor information, we propose the cluster center alignment rule, which involves aligning the inner product of the cluster center matrix with the unit matrix. Finally, to get reliable prediction results with few labels, we establish the minimum entropy alignment rule by lining up the prediction probability matrix with its sharpened result. Extensive studies on graph benchmark datasets demonstrate that GANN can achieve considerable benefits in semi-supervised node classification and outperform state-of-the-art competitors.
翻译:在半监督的图形机器学习领域,已经广泛调查了图形神经网络(GNNs)。当标签数据有限时,大多数方法都未能充分利用适当的图形信息,导致过度吸附问题。为了克服这一问题,我们建议采用一个简单有效的图形神经网络(GANN),这是一个简单而有效的图形神经结构。我们建议采用一种独特的学习算法,用三种对齐规则彻底探索隐藏的标签不足的信息。首先,为了更好地调查属性特性特性,我们建议采用特征校正规则,使属性和嵌入矩阵的内产物相匹配。第二,为了适当使用较高级的邻居信息,我们提出了集群中心协调规则,这涉及将集束中心矩阵的内产物与单位矩阵对齐。最后,为了用少数标签获得可靠的预测结果,我们通过将预测概率矩阵与更锐化的结果对齐,建立了最小的酶校准校准规则。关于图形基准数据集的广泛研究表明,GNN可以使半超超强的节点分类和异状态竞争者获得相当大的好处。</s>