返回
MST-HGCN: a minimum spanning tree hyperbolic graph convolutional network
DOI:10.1007/s10489-022-04256-y.png)
摘要
En 中文
Graph neural networks (GNNs) have achieved outstanding results in research tasks on graph data. Most existing GNN models are defined in Euclidean space. However, when embedding hierarchical and scale-free graphs, models lying in hyperbolic space attain significant improvements over Euclidean graph convolutional networks (GCNs). To further enhance the performance of hyperbolic graph convolution and expand the applicability of related models to different data, we propose a hyperbolic graph convolution model based on the minimum spanning tree (MST-HGCN). Our method utilizes the minimum spanning tree (MST) algorithm to extract and process the topological structure of the input graph, which yields a more hierarchical topological structure and largely eliminates noisy edges. Then, several different topological structures based on the same spanning tree are produced by randomly re-adding the edges deleted by the MST algorithm; subsequently, a consistency loss is introduced to jointly optimize different outputs obtained from these topological structures. Experiments on node classification tasks and link prediction tasks for datasets with different hierarchy extents show that, our method comprehensively outperforms the vanilla hyperbolic GCN model on all the datasets, approaching or even outperforming the representative Euclidean comparison methods, which indicates that our method has better performance and data applicability.
Keyword:
Minimum spanning tree algorithm
Hyperbolic representation learning
Graph convolutional network
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Is endourological intervention a suitable treatment option in the management of iatrogenic thermal ureteral injury? A contemporary case series
BMC Urology
IF0
Separation of Cu(II) ions from synthetic solutions and wastewater by raw and calcined seashell waste

