论文标题
量规:几何形状保留归因的图形嵌入
GAGE: Geometry Preserving Attributed Graph Embeddings
论文作者
论文摘要
节点嵌入是提取网络中某些实体的简洁明了表示的任务。各种现实世界网络以功能或时间序列数据的形式包括有关节点连接和某些节点属性的信息。现代表示学习技术既采用节点的连接性和属性信息,以无监督的方式产生嵌入。在这种情况下,得出保留网络几何形状和属性向量的嵌入将是非常可取的,因为它们将反映特征空间中的拓扑邻域结构和接近性。尽管仅在观察网络的连接性或属性信息时,这是相当简单的维护,但保留两种信息的几何形状是具有挑战性的。本文提出了一种新型的张力分解方法,用于归因网络中的节点嵌入方法,该方法保留了连接和属性的距离。此外,开发了一种有效且轻巧的算法,以解决学习任务和具有多个最先进基线的明智实验,这表明所提出的算法在下游任务方面提供了重大的性能提高。
Node embedding is the task of extracting concise and informative representations of certain entities that are connected in a network. Various real-world networks include information about both node connectivity and certain node attributes, in the form of features or time-series data. Modern representation learning techniques employ both the connectivity and attribute information of the nodes to produce embeddings in an unsupervised manner. In this context, deriving embeddings that preserve the geometry of the network and the attribute vectors would be highly desirable, as they would reflect both the topological neighborhood structure and proximity in feature space. While this is fairly straightforward to maintain when only observing the connectivity or attribute information of the network, preserving the geometry of both types of information is challenging. A novel tensor factorization approach for node embedding in attributed networks is proposed in this paper, that preserves the distances of both the connections and the attributes. Furthermore, an effective and lightweight algorithm is developed to tackle the learning task and judicious experiments with multiple state-of-the-art baselines suggest that the proposed algorithm offers significant performance improvements in downstream tasks.