期刊文献+
共找到39,775篇文章
< 1 2 250 >
每页显示 20 50 100
基于GraphSAGE网络的藏文短文本分类研究
1
作者 敬容 杨逸民 +3 位作者 万福成 国旗 于洪志 马宁 《中文信息学报》 CSCD 北大核心 2024年第9期58-65,共8页
文本分类是自然语言处理领域的重要研究方向,由于藏文数据的稀缺性、语言学特征抽取的复杂性、篇章结构的多样性等因素导致藏文文本分类任务进展缓慢。因此,该文以图神经作为基础模型进行改进。首先,在“音节-音节”“音节-文档”建模... 文本分类是自然语言处理领域的重要研究方向,由于藏文数据的稀缺性、语言学特征抽取的复杂性、篇章结构的多样性等因素导致藏文文本分类任务进展缓慢。因此,该文以图神经作为基础模型进行改进。首先,在“音节-音节”“音节-文档”建模的基础上,融合文档特征,采用二元分类模型动态网络构建“文档-文档”边,以充分挖掘短文本的全局特征,增加滑动窗口,减少模型的计算复杂度并寻找最优窗口取值。其次,针对藏文短文本的音节稀疏性,首次引入GraphSAGE作为基础模型,并探究不同聚合方式在藏文短文本分类上的性能差异。最后,为捕获节点间关系的异质性,对邻居节点进行特征加权再平均池化以增强模型的特征提取能力。在TNCC标题文本数据集上,该文模型的分类准确率达到了62.50%,与传统GCN、原始GraphSAGE和预训练语言模型CINO相比,该方法在分类准确率上分别提高了2.56%、1%和2.4%。 展开更多
关键词 图神经网络 藏文文本分类 TNCC数据集
下载PDF
A STABILITY RESULT FOR TRANSLATINGSPACELIKE GRAPHS IN LORENTZ MANIFOLDS
2
作者 高雅 毛井 吴传喜 《Acta Mathematica Scientia》 SCIE CSCD 2024年第2期474-483,共10页
In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piece... In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piecewise smooth boundary,and ℝ denotes the Euclidean 1-space.We prove an interesting stability result for translating spacelike graphs in M^(n)×ℝ under a conformal transformation. 展开更多
关键词 mean curvature flow spacelike graphs translating spacelike graphs maximal spacelike graphs constant mean curvature Lorentz manifolds
下载PDF
A Value for Games Defined on Graphs
3
作者 Néstor Bravo 《Applied Mathematics》 2024年第5期331-348,共18页
Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal c... Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition. 展开更多
关键词 graph Theory Values for graphs Cooperation Games Potential Function
下载PDF
BLOW-UP CONDITIONS FOR A SEMILINEAR PARABOLIC SYSTEM ON LOCALLY FINITE GRAPHS
4
作者 吴艺婷 《Acta Mathematica Scientia》 SCIE CSCD 2024年第2期609-631,共23页
In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of ... In this paper, we investigate a blow-up phenomenon for a semilinear parabolic system on locally finite graphs. Under some appropriate assumptions on the curvature condition CDE’(n,0), the polynomial volume growth of degree m, the initial values, and the exponents in absorption terms, we prove that every non-negative solution of the semilinear parabolic system blows up in a finite time. Our current work extends the results achieved by Lin and Wu (Calc Var Partial Differ Equ, 2017, 56: Art 102) and Wu (Rev R Acad Cien Serie A Mat, 2021, 115: Art 133). 展开更多
关键词 semilinear parabolic system on graphs BLOW-UP heat kernel estimate on graphs
下载PDF
Perfect 1-k Matchings of Bipartite Graphs
5
作者 Wenduan Dai Yan Liu Yanfang Wu 《Open Journal of Discrete Mathematics》 2024年第4期43-53,共11页
Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is inc... Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching. 展开更多
关键词 Bipartite graph Semi-Matching Perfect 1-k Matching k-Elementary graph
下载PDF
Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤn Using MAPLE Coding
6
作者 Nasir Ali 《Open Journal of Discrete Mathematics》 2024年第1期1-8,共8页
This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study ... This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations. 展开更多
关键词 Zero Divisor graph Ring Theory Maple Algorithm n Modulo n graph Theory Mathematical Computing
下载PDF
Variable Degeneracy of Planar Graphs without Chorded 6-Cycles
7
作者 Hui Hui FANG Dan Jun HUANG +1 位作者 Tao WANG Wei Fan WANG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2024年第11期2735-2750,共16页
A cover of a graph G is a graph H with vertex set V(H)=∪_(v∈V(G))L_(v),where L_(v)={v}×[s],and the edge set M=∪_(uv∈E(G))M_(uv),where Muv is a matching between L_(u) and L_(v).A vertex set T⊆V(H)is a transver... A cover of a graph G is a graph H with vertex set V(H)=∪_(v∈V(G))L_(v),where L_(v)={v}×[s],and the edge set M=∪_(uv∈E(G))M_(uv),where Muv is a matching between L_(u) and L_(v).A vertex set T⊆V(H)is a transversal of H if∣T∩Lv∣=1 for each v∈V(G).Let f be a nonnegative integer valued function on the vertex-set of H.If for any nonempty subgraphΓof H[T],there exists a vertex x∈V(H)such that d(x)<f(x),then T is called a strictly f-degenerate transversal.In this paper,we give a sufficient condition for the existence of strictly f-degenerate transversal for planar graphs without chorded 6-cycles.As a consequence,every planar graph without subgraphs isomorphic to the configurations is DP-4-colorable. 展开更多
关键词 Variable degeneracy DP-coloring list coloring planar graph
原文传递
Depth First:Optimal Path Discovery Between Designated Nodes in Random Ring-Based Graphs
8
作者 Li Qi Xu Jiasheng +4 位作者 Zhang Haonan Kang Huquan Fu Luoyi Long Fei Wang Xinbing 《China Communications》 SCIE CSCD 2024年第9期225-241,共17页
This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears... This paper focuses on optimally determining the existence of connected paths between some given nodes in random ring-based graphs.Serving as a fundamental underlying structure in network modeling,ring topology appears as commonplace in many realistic scenarios.Regarding this,we consider graphs composed of rings,with some possible connected paths between them.Without prior knowledge of the exact node permutations on rings,the existence of each edge can be unraveled through edge testing at a unit cost in one step.The problem examined is that of determining whether the given nodes are connected by a path or separated by a cut,with the minimum expected costs involved.Dividing the problem into different cases based on different topologies of the ring-based networks,we propose the corresponding policies that aim to quickly seek the paths between nodes.A common feature shared by all those policies is that we stick to going in the same direction during edge searching,with edge testing in each step only involving the test between the source and the node that has been tested most.The simple searching rule,interestingly,can be interpreted as a delightful property stemming from the neat structure of ring-based networks,which makes the searching process not rely on any sophisticated behaviors.We prove the optimality of the proposed policies by calculating the expected cost incurred and making a comparison with the other class of strategies.The effectiveness of the proposed policies is also verified through extensive simulations,from which we even disclose three extra intriguing findings:i)in a onering network,the cost will grow drastically with the number of designated nodes when the number is small and will grow slightly when that number is large;ii)in ring-based network,Depth First is optimal in detecting the connectivity between designated nodes;iii)the problem of multi-ring networks shares large similarity with that of two-ring networks,and a larger number of ties between rings will not influence the expected cost. 展开更多
关键词 connectivity analysis cost minimization path discover ring-based graph
下载PDF
Batch Active Learning for Multispectral and Hyperspectral Image Segmentation Using Similarity Graphs
9
作者 Bohan Chen Kevin Miller +1 位作者 Andrea L.Bertozzi Jon Schwenk 《Communications on Applied Mathematics and Computation》 EI 2024年第2期1013-1033,共21页
Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi... Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels. 展开更多
关键词 Image segmentation graph learning Batch active learning Hyperspectral image
下载PDF
GraphSTGAN:Situation understanding network of slow-fast high maneuvering targets for maritime monitor services of IoT data
10
作者 Guanlin Wu Haipeng Wang +1 位作者 Yu Liu You He 《Digital Communications and Networks》 SCIE CSCD 2024年第3期620-630,共11页
With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key te... With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key technologies is situation understanding.However,the presence of slow-fast high maneuvering targets and track breakages due to radar blind zones make modeling the dynamics of marine multi-agents difficult,and pose significant challenges to maritime situation understanding.In order to comprehend the situation accurately and thus offer unmanned MMS,it is crucial to model the complex dynamics of multi-agents using IoT big data.Nevertheless,previous methods typically rely on complex assumptions,are plagued by unstructured data,and disregard the interactions between multiple agents and the spatial-temporal correlations.A deep learning model,Graph Spatial-Temporal Generative Adversarial Network(GraphSTGAN),is proposed in this paper,which uses graph neural network to model unstructured data and uses STGAN to learn the spatial-temporal dependencies and interactions.Extensive experiments show the effectiveness and robustness of the proposed method. 展开更多
关键词 Internet of things MULTI-AGENTS graph neural network Maritime monitoring services
下载PDF
On an Invariant of Tournament Digraphs
11
作者 Boris F. Melnikov Bowen Liu 《Journal of Applied Mathematics and Physics》 2024年第7期2711-2722,共12页
To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successf... To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15. 展开更多
关键词 graph Directed graph TOURNAMENT ?nvariant
下载PDF
Maximal Resonance of{(3,4),4}-Fullerene Graphs
12
作者 YANG Rui MA Yan-fei 《Chinese Quarterly Journal of Mathematics》 2024年第1期1-17,共17页
A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S i... A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant. 展开更多
关键词 {(3 4) 4}-Fullerene graph k-Resonant Maximally resonant
下载PDF
Weak External Bisection of Some Graphs
13
作者 Yumin Liu 《Journal of Applied Mathematics and Physics》 2024年第1期91-97,共7页
Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satis... Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V<sub>1</sub> ∪ V<sub>2</sub> and V<sub>1</sub> ∩ V<sub>2</sub> = ∅. If a bipartition satisfies ∥V<sub>1</sub>∣ - ∣V<sub>2</sub>∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V<sub>1</sub>, V<sub>2</sub>) such that ∀v ∈ V<sub>1</sub>, at least half minuses one of the neighbors of v are in the V<sub>2</sub>;∀v ∈ V<sub>2</sub>, at least half minuses one of the neighbors of v are in the V<sub>1</sub>. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs. 展开更多
关键词 Weak External Bisection Bipartite graph Windmill graph
下载PDF
Privacy Preserving Distributed Bandit Residual Feedback Online Optimization Over Time-Varying Unbalanced Graphs
14
作者 Zhongyuan Zhao Zhiqiang Yang +2 位作者 Luyao Jiang Ju Yang Quanbo Ge 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第11期2284-2297,共14页
This paper considers the distributed online optimization(DOO) problem over time-varying unbalanced networks, where gradient information is explicitly unknown. To address this issue, a privacy-preserving distributed on... This paper considers the distributed online optimization(DOO) problem over time-varying unbalanced networks, where gradient information is explicitly unknown. To address this issue, a privacy-preserving distributed online one-point residual feedback(OPRF) optimization algorithm is proposed. This algorithm updates decision variables by leveraging one-point residual feedback to estimate the true gradient information. It can achieve the same performance as the two-point feedback scheme while only requiring a single function value query per iteration. Additionally, it effectively eliminates the effect of time-varying unbalanced graphs by dynamically constructing row stochastic matrices. Furthermore, compared to other distributed optimization algorithms that only consider explicitly unknown cost functions, this paper also addresses the issue of privacy information leakage of nodes. Theoretical analysis demonstrate that the method attains sublinear regret while protecting the privacy information of agents. Finally, numerical experiments on distributed collaborative localization problem and federated learning confirm the effectiveness of the algorithm. 展开更多
关键词 Differential privacy distributed online optimization(DOO) federated learning one-point residual feedback(OPRF) time-varying unbalanced graphs
下载PDF
On the (Δ + 2)-Total-Colorability of Planar Graphs with 7-Cycles Containing at Most Two Chords
15
作者 Jian Chang Jingru Liu Fan Zhang 《Journal of Applied Mathematics and Physics》 2024年第7期2702-2710,共9页
The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove tha... The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove that TCC holds for planar graph with Δ = 6 and every 7-cycle contains at most two chords. 展开更多
关键词 Planar graph 7-Cycle 8-Totally-Colorable Maximum Degree
下载PDF
基于改进GraphSAGE算法的浏览器指纹追踪
16
作者 楚小茜 张建辉 +1 位作者 张德升 苏珲 《计算机科学》 CSCD 北大核心 2024年第6期409-415,共7页
当前Web追踪领域主要使用浏览器指纹对用户进行追踪。针对浏览器指纹追踪技术存在指纹随时间动态变化、不易长期追踪等问题,提出一种关注节点和边缘特征的改进图采样聚合算法(An Improved Graph SAmple and AGgregatE with Both Node an... 当前Web追踪领域主要使用浏览器指纹对用户进行追踪。针对浏览器指纹追踪技术存在指纹随时间动态变化、不易长期追踪等问题,提出一种关注节点和边缘特征的改进图采样聚合算法(An Improved Graph SAmple and AGgregatE with Both Node and Edge Features,NE-GraphSAGE)用于浏览器指纹追踪。首先以浏览器指纹为节点、指纹之间特征相似度为边构建图数据。其次对图神经网络中的GraphSAGE算法进行改进使其不仅能关注节点特征,而且能捕获边缘信息并对边缘分类,从而识别指纹。最后将NE-GraphSAGE算法与Eckersley算法、FPStalker算法和LSTM算法进行对比,验证NE-GraphSAGE算法的识别效果。实验结果表明,NE-GraphSAGE算法在准确率和追踪时长上均有不同程度的提升,最大追踪时长可达80天,相比其他3种算法性能更优,验证了NE-GraphSAGE算法对浏览器指纹长期追踪的能力。 展开更多
关键词 浏览器指纹 图神经网络 graphsAGE算法 用户追踪 边缘分类
下载PDF
Graph Transformers研究进展综述 被引量:1
17
作者 周诚辰 于千城 +2 位作者 张丽丝 胡智勇 赵明智 《计算机工程与应用》 CSCD 北大核心 2024年第14期37-49,共13页
随着图结构数据在各种实际场景中的广泛应用,对其进行有效建模和处理的需求日益增加。Graph Transformers(GTs)作为一类使用Transformers处理图数据的模型,能够有效缓解传统图神经网络(GNN)中存在的过平滑和过挤压等问题,因此可以学习... 随着图结构数据在各种实际场景中的广泛应用,对其进行有效建模和处理的需求日益增加。Graph Transformers(GTs)作为一类使用Transformers处理图数据的模型,能够有效缓解传统图神经网络(GNN)中存在的过平滑和过挤压等问题,因此可以学习到更好的特征表示。根据对近年来GTs相关文献的研究,将现有的模型架构分为两类:第一类通过绝对编码和相对编码向Transformers中加入图的位置和结构信息,以增强Transformers对图结构数据的理解和处理能力;第二类根据不同的方式(串行、交替、并行)将GNN与Transformers进行结合,以充分利用两者的优势。介绍了GTs在信息安全、药物发现和知识图谱等领域的应用,对比总结了不同用途的模型及其优缺点。最后,从可扩展性、复杂图、更好的结合方式等方面分析了GTs未来研究面临的挑战。 展开更多
关键词 graph Transformers(GTs) 图神经网络 图表示学习 异构图
下载PDF
Pythagorean Neutrosophic Planar Graphs with an Application in Decision-Making 被引量:1
18
作者 P.Chellamani D.Ajay +1 位作者 Mohammed M.Al-Shamiri Rashad Ismail 《Computers, Materials & Continua》 SCIE EI 2023年第6期4935-4953,共19页
Graph theory has a significant impact and is crucial in the structure of many real-life situations.To simulate uncertainty and ambiguity,many extensions of graph theoretical notions were created.Planar graphs play a v... Graph theory has a significant impact and is crucial in the structure of many real-life situations.To simulate uncertainty and ambiguity,many extensions of graph theoretical notions were created.Planar graphs play a vital role in modelling which has the property of non-crossing edges.Although crossing edges benefit,they have some drawbacks,which paved the way for the introduction of planar graphs.The overall purpose of the study is to contribute to the conceptual development of the Pythagorean Neutrosophic graph.The basic methodology of our research is the incorporation of the analogous concepts of planar graphs in the Pythagorean Neutrosophic graphs.The significant finding of our research is the introduction of Pythagorean Neutrosophic Planar graphs,a conceptual blending of Pythagorean Neutro-sophic and Planar graphs.The idea of Pythagorean Neutrosophic multigraphs and dual graphs are also introduced to deal with the ambiguous situations.This paper investigates the Pythagorean Neutrosophic planar values,which form the edges of the Pythagorean neutrosophic graphs.The concept of Pythagorean Neutrosophic dual graphs,isomorphism,co-weak and weak isomorphism have also been explored for Pythagorean Neutrosophic planar graphs.A decision-making algorithm was proposed with a numerical illustra-tion by using the Pythagorean Neutrosophic fuzzy graph. 展开更多
关键词 Pythagorean neutrosophic planar graph planarity value ISOMORPHISM dual graphs MULTIgraph
下载PDF
基于Graph Transformer的半监督异配图表示学习模型
19
作者 黎施彬 龚俊 汤圣君 《计算机应用》 CSCD 北大核心 2024年第6期1816-1823,共8页
现有的图卷积网络(GCN)模型基于同配性假设,无法直接应用于异配图的表示学习,且许多异配图表示学习的研究工作受消息传递机制的限制,导致节点特征混淆和特征过度挤压而出现过平滑问题。针对这些问题,提出一种基于Graph Transformer的半... 现有的图卷积网络(GCN)模型基于同配性假设,无法直接应用于异配图的表示学习,且许多异配图表示学习的研究工作受消息传递机制的限制,导致节点特征混淆和特征过度挤压而出现过平滑问题。针对这些问题,提出一种基于Graph Transformer的半监督异配图表示学习模型HPGT(HeteroPhilic Graph Transformer)。首先,使用度连接概率矩阵采样节点的路径邻域,再通过自注意力机制自适应地聚合路径上的节点异配连接模式,编码得到节点的结构信息,用节点的原始属性信息和结构信息构建Transformer层的自注意力模块;其次,将每个节点自身的隐层表示与它的邻域节点的隐层表示分离更新以避免节点通过自注意力模块聚合过量的自身信息,再把每个节点表示与它的邻域表示连接,得到单个Transformer层的输出,另外,将所有的Transformer层的输出跳连到最终的节点隐层表示以防止中间层信息丢失;最后,使用线性层和Softmax层将节点的隐层表示映射到节点的预测标签。实验结果表明,与无结构编码(SE)的模型相比,基于度连接概率的SE能为Transformer层的自注意力模块提供有效的偏差信息,HPGT平均准确率提升0.99%~11.98%;与对比模型相比,在异配数据集(Texas、Cornell、Wisconsin和Actor)上,模型节点分类准确率提升0.21%~1.69%,在同配数据集(Cora、CiteSeer和PubMed)上,节点分类准确率分别达到了0.8379、0.7467和0.8862。以上结果验证了HPGT具有较强的异配图表示学习能力,尤其适用于强异配图节点分类任务。 展开更多
关键词 图卷积网络 异配图 图表示学习 graph Transformer 节点分类
下载PDF
On the Spectral Properties of Graphs with Rank 4
20
作者 Jianxuan Luo 《Applied Mathematics》 2023年第11期748-763,共16页
Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalv... Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalve and Rada (2021) gave the bound of spectral radius of all graphs with rank 4. Based on these results as above, we further investigate the spectral properties of graphs with rank 4. And we give the expressions of the spectral radius and energy of all graphs with rank 4. In particular, we show that some graphs with rank 4 are determined by their spectra. 展开更多
关键词 Spectral Radius ENERGY Cospectral graphs RANK
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部