论文标题
部分可观测时空混沌系统的无模型预测
Text Enriched Sparse Hyperbolic Graph Convolutional Networks
论文作者
论文摘要
将包含文本和不同边缘类型的文本的信息节点连接的异质网络通常用于在各种现实世界应用程序中存储和处理信息。图形神经网络(GNN)及其双曲线变体提供了一种有希望的方法,可以分别通过邻域聚集和分层特征提取在低维的潜在空间中编码此类网络。但是,这些方法通常忽略Metapath结构和可用的语义信息。此外,这些方法对训练数据中存在的噪声很敏感。为了解决这些局限性,在本文中,我们提出了富含文本的稀疏双曲图卷积网络(TESH-GCN),以使用语义信号捕获图形的Metapath结构,并进一步改善大型异质图中的预测。在TESH-GCN中,我们提取语义节点信息,该信息连接信号依次充当连接信号,以在重新配合的双曲线图卷积层中从稀疏的邻接张量中提取相关节点的局部邻域和图形级Metapath特征。这些提取的功能与语言模型的语义特征(用于鲁棒性)一起用于最终下游任务。各种异质图数据集的实验表明,我们的模型在链接预测的任务上的大幅度优于当前最新方法。我们还报告说,与现有的双曲线图相比,训练时间和模型参数的减少都降低了。此外,我们通过在图形结构和文本中使用不同级别的模拟噪声来说明模型的鲁棒性,还提出了一种通过分析提取的Metapaths来解释Tesh-GCN预测的机制。
Heterogeneous networks, which connect informative nodes containing text with different edge types, are routinely used to store and process information in various real-world applications. Graph Neural Networks (GNNs) and their hyperbolic variants provide a promising approach to encode such networks in a low-dimensional latent space through neighborhood aggregation and hierarchical feature extraction, respectively. However, these approaches typically ignore metapath structures and the available semantic information. Furthermore, these approaches are sensitive to the noise present in the training data. To tackle these limitations, in this paper, we propose Text Enriched Sparse Hyperbolic Graph Convolution Network (TESH-GCN) to capture the graph's metapath structures using semantic signals and further improve prediction in large heterogeneous graphs. In TESH-GCN, we extract semantic node information, which successively acts as a connection signal to extract relevant nodes' local neighborhood and graph-level metapath features from the sparse adjacency tensor in a reformulated hyperbolic graph convolution layer. These extracted features in conjunction with semantic features from the language model (for robustness) are used for the final downstream task. Experiments on various heterogeneous graph datasets show that our model outperforms the current state-of-the-art approaches by a large margin on the task of link prediction. We also report a reduction in both the training time and model parameters compared to the existing hyperbolic approaches through a reformulated hyperbolic graph convolution. Furthermore, we illustrate the robustness of our model by experimenting with different levels of simulated noise in both the graph structure and text, and also, present a mechanism to explain TESH-GCN's prediction by analyzing the extracted metapaths.