检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张芳[1,2] 单万锦 王雯[1,2] ZHANG Fang;SHAN Wanjin;WANG Wen(School of Life Sciences,Tiangong University,Tianjin 300387,China;Tianjin Key Laboratory of Optoelectronic Detection Technology and System,Tiangong University,Tianjin 300387,China;School of Electronics and Information Engineering,Tiangong University,Tianjin 300387,China)
机构地区:[1]天津工业大学生命科学学院,天津300387 [2]天津工业大学天津市光电检测技术与系统重点实验室,天津300387 [3]天津工业大学电子与信息工程学院,天津300387
出 处:《天津工业大学学报》2024年第3期58-65,共8页Journal of Tiangong University
基 金:国家自然科学基金资助项目(61702296)。
摘 要:针对图卷积网络(GCNs)在面对低同质性的图结构时性能骤降问题,提出了一种新颖的基于图结构增强的图神经网络方法,用于学习改善的图节点表示。首先将节点信息通过消息传播和聚合,得到节点的初始表示;然后计算节点表示的相似性度量,得到图的同质结构;最后融合图的原始结构和同质结构进行节点的信息传递得到节点表示用于下游任务。结果表明:在6个公开的数据集上,所提算法在节点分类的多个指标上均优于对比算法,特别是在同质性较低的4个数据集上,所提算法的准确度(ACC)分数分别超过最高基准5.53%、6.87%、3.08%、4.00%,宏平均(F1)值分别超过最高基准5.75%、8.06%、6.46%、5.61%,获得了远高于基准的优越表现,表明所提方法成功改善了图数据的结构,验证了该算法对图结构优化的有效性。In response to the problem of sudden performance degradation in graph convolutional networks(GCNs)facing low homogeneity graph structures,a novel graph structure enhancement method is proposed for learning improved graph node representations.Firstly,the node information is propagated and aggregated by messages to obtain an initial representation of the nodes.Then the similarity metric of the node representation is calculated to obtain the homogeneous structure of the graph.Finally,the original structure of the graph and the homogeneous structure are fused for node information transfer to obtain the node representation for downstream tasks.The results show that the proposed algorithm outperforms the comparison algorithm in several metrics of node classification on six publicly available datasets,especially on the four datasets with low homogeneity,the ACC scores of the proposed algorithm exceed the highest benchmark by 5.53%,6.87%,3.08%and 4.00%,and the F1 values exceed the highest benchmark by 5.75%,8.06%,6.46%and 5.61%,respectively,obtaining superior performance well above the benchmark,indicating that the proposed method successfully improves the structure of graph data and verifies the effectiveness of the algorithm for graph structure optimization.
分 类 号:TP183[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222