The atom-bond sum-connectivity(ABS)index,put forward by[J.Math.Chem.,2022,60(10):20812093],exhibits a strong link with the acentric factor of octane isomers.The experimental physico-chemical properties of octane isome...The atom-bond sum-connectivity(ABS)index,put forward by[J.Math.Chem.,2022,60(10):20812093],exhibits a strong link with the acentric factor of octane isomers.The experimental physico-chemical properties of octane isomers,such as boiling point,of formation are found to be better measured by the ABS index than by the Randi,atom-bond connectivity(ABC),and sum-connectivity(SC)indices.One important source of information for researching the molecular structure is the bounds for its topological indices.The extrema of the ABS index of the line,total,and Mycielski graphs are calculated in this work.Moreover,the pertinent extremal graphs were illustrated.展开更多
A graph is Hamiltonian if it contains a cycle that visits each vertex of the graph exactly once.A chord of a cycle C is an edge that joins two non-consecutive vertices of C.A graph of order n is chorded pancyclic if i...A graph is Hamiltonian if it contains a cycle that visits each vertex of the graph exactly once.A chord of a cycle C is an edge that joins two non-consecutive vertices of C.A graph of order n is chorded pancyclic if it contains a chorded cycle of length k for every integer k with 4≤k≤n.In 2018,Ferro and Lesniak gave an edge number conditon for the Hamiltonicity(and the chorded pancyclicity)of balanced and unbalanced k-partite graphs.In this paper,we extend the main results of Ferro and Lesniak,and provide an edge condition for the Hamiltonicity(and the chorded pancyclicity)of balanced and unbalanced k-partite graphs with given minimum degree,respectively.展开更多
Let Un be the set of connected unicyclic graphs of order n and girth g.Let C(T_(1),T_(2),...,T_(g))Un be obtained from a cycle v_(1)v_(2)…v_(g)v_(1)(in the anticlockwise direction)by identifying vi with the root of a...Let Un be the set of connected unicyclic graphs of order n and girth g.Let C(T_(1),T_(2),...,T_(g))Un be obtained from a cycle v_(1)v_(2)…v_(g)v_(1)(in the anticlockwise direction)by identifying vi with the root of a rooted tree Ti of order ni for each i=1,2,...,g,where ni≥1 and∑^(g)_(i=1)n_(i)=n.Let S(n_(1),n_(2),...,n_(g))be obtained from C(T_(1),T_(2),..,T_(g))by replacing each Ti by a rooted star Sni with the center as its root.Let U(n_(1),n_(2),...,ng)be the set of unicyclic graphs which differ from the unicyclic graph S(n_(1),n_(2),...,n_(g))only up to a permutation of ni's.In this paper,the graph with the minimal least signless Laplacian eigenvalue(respectively,the graph with maximum signless Laplacian spread)in U(n_(1),n_(2),...,n_(g))is determined.展开更多
基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其...基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其次,对GraphSAGE算法进行了改进,包括在消息传递阶段融合节点和边的特征,同时在消息聚合过程中考虑不同源节点对目标节点的影响程度,并在边嵌入生成时引入残差学习机制。在两个公开网络攻击数据集上的实验结果表明,在二分类情况下,所提算法的总体性能优于E-GraphSAGE、LSTM、RNN、CNN算法;在多分类情况下,所提算法在大多数攻击类型上的F1值高于对比算法。展开更多
Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representat...Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications.展开更多
Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving g...Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving graph learning.However,its application often diminishes data utility,especially for nodes with fewer neighbors in graph neural networks(GNNs).展开更多
A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spa...A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spatial-temporal message passing mechanism built on tensor product.Concretely,an HGCN utilizes the discrete Fourier transform(DFT)to implement temporal message passing and then employs face-wise product to realize spatial message passing.However,DFT is only a special case of assorted time-frequency transforms,which considers the complex temporal patterns partially,thereby resulting in an inaccurate temporal message passing possibly.To address this issue,this study proposes six advanced time-frequency transform-incorporated HGCNs(TF-HGCNs)with discrete Fourier,discrete Hartley,discrete cosine,Haar wavelet,Walsh Hadamard,and slant transforms.In addition,a potent ensemble is built regarding the proposed six TF-HGCNs as the bases.Finally,the corresponding theoretical proof is presented.Empirical studies on six DG datasets demonstrate that owing to diverse time-frequency transforms,the proposed six TF-HGCNs significantly outperform state-of-the-art models in addressing the task of link weight estimation.Moreover,their ensemble outstrips each base's performance.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
The rapid development of information technology and accelerated digitalization have led to an explosive growth of data across various fields.As a key technology for knowledge representation and sharing,knowledge graph...The rapid development of information technology and accelerated digitalization have led to an explosive growth of data across various fields.As a key technology for knowledge representation and sharing,knowledge graphs play a crucial role by constructing structured networks of relationships among entities.However,data sparsity and numerous unexplored implicit relations result in the widespread incompleteness of knowledge graphs.In static knowledge graph completion,most existing methods rely on linear operations or simple interaction mechanisms for triple encoding,making it difficult to fully capture the deep semantic associations between entities and relations.Moreover,many methods focus only on the local information of individual triples,ignoring the rich semantic dependencies embedded in the neighboring nodes of entities within the graph structure,which leads to incomplete embedding representations.To address these challenges,we propose Two-Stage Mixer Embedding(TSMixerE),a static knowledge graph completion method based on entity context.In the unit semantic extraction stage,TSMixerE leveragesmulti-scale circular convolution to capture local features atmultiple granularities,enhancing the flexibility and robustness of feature interactions.A channel attention mechanism amplifies key channel responses to suppress noise and irrelevant information,thereby improving the discriminative power and semantic depth of feature representations.For contextual information fusion,a multi-layer self-attentionmechanism enables deep interactions among contextual cues,effectively integrating local details with global context.Simultaneously,type embeddings clarify the semantic identities and roles of each component,enhancing the model’s sensitivity and fusion capabilities for diverse information sources.Furthermore,TSMixerE constructs contextual unit sequences for entities,fully exploring neighborhood information within the graph structure to model complex semantic dependencies,thus improving the completeness and generalization of embedding representations.展开更多
Objective To address the dual challenges of long-tail distribution and feature sparsity in traditional Chinese medicine(TCM)syndrome differentiation within real clinical settings,we propose a data-efficient learning f...Objective To address the dual challenges of long-tail distribution and feature sparsity in traditional Chinese medicine(TCM)syndrome differentiation within real clinical settings,we propose a data-efficient learning framework enhanced by knowledge graphs.Methods We developed Agent-GNN,a three-stage decoupled learning framework,and validated it on the Traditional Chinese Medicine Syndrome Diagnosis(TCM-SD)dataset containing 54152 clinical records across 148 syndrome categories.First,we constructed a comprehensive medical knowledge graph encoding the complete TCM reasoning system.Second,we proposed a Functional Patient Profiling(FPP)method that utilizes large language models(LLMs)combined with Graph Retrieval-Augmented Generation(RAG)to extract structured symptom-etiology-pathogenesis subgraphs from medical records.Third,we employed heterogeneous graph neural networks to learn structured combination patterns explicitly.We compared our method against multiple baselines including BERT,ZY-BERT,ZY-BERT+Know,GAT,and GPT-4 Few-shot,using macro-F1 score as the primary evaluation metric.Additionally,ablation experiments were conducted to validate the contribution of each key component to model performance.Results Agent-GNN achieved an overall macro-F1 score of 72.4%,representing an 8.7 percentage points improvement over ZY-BERT+Know(63.7%),the strongest baseline among traditional methods.For long-tail syndromes with fewer than 10 samples,Agent-GNN reached a macro-F1 score of 58.6%,compared with 39.3%for ZY-BERT+Know and 41.2%for GPT-4 Few-shot,representing relative improvements of 49.2%and 42.2%,respectively.Ablation experiments confirmed that the explicit modeling of etiology-pathogenesis nodes contributed 12.4 percentage points to this enhanced long-tail syndrome performance.Conclusion This study proposes Agent-GNN,a knowledge graph-enhanced framework that effectively addresses the long-tail distribution challenge in TCM syndrome differentiation.By explicitly modeling manifestation-mechanism-essence patterns through structured knowledge graphs,our approach achieves superior performance in data-scarce scenarios while providing interpretable reasoning paths for TCM intelligent diagnosis.展开更多
Knowledge graphs often suffer from sparsity and incompleteness.Knowledge graph reasoning is an effective way to address these issues.Unlike static knowledge graph reasoning,which is invariant over time,dynamic knowled...Knowledge graphs often suffer from sparsity and incompleteness.Knowledge graph reasoning is an effective way to address these issues.Unlike static knowledge graph reasoning,which is invariant over time,dynamic knowledge graph reasoning is more challenging due to its temporal nature.In essence,within each time step in a dynamic knowledge graph,there exists structural dependencies among entities and relations,whereas between adjacent time steps,there exists temporal continuity.Based on these structural and temporal characteristics,we propose a model named“DKGR-DR”to learn distributed representations of entities and relations by combining recurrent neural networks and graph neural networks to capture structural dependencies and temporal continuity in DKGs.In addition,we construct a static attribute graph to represent entities’inherent properties.DKGR-DR is capable of modeling both dynamic and static aspects of entities,enabling effective entity prediction and relation prediction.We conduct experiments on ICEWS05-15,ICEWS18,and ICEWS14 to demonstrate that DKGR-DR achieves competitive performance.展开更多
Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and ...Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.展开更多
基金Supported by Ningbo NSF(No.2021J234)Zhejiang Provincial Philosophy and Social Sciences Planning Project(No.24NDJC057YB)。
文摘The atom-bond sum-connectivity(ABS)index,put forward by[J.Math.Chem.,2022,60(10):20812093],exhibits a strong link with the acentric factor of octane isomers.The experimental physico-chemical properties of octane isomers,such as boiling point,of formation are found to be better measured by the ABS index than by the Randi,atom-bond connectivity(ABC),and sum-connectivity(SC)indices.One important source of information for researching the molecular structure is the bounds for its topological indices.The extrema of the ABS index of the line,total,and Mycielski graphs are calculated in this work.Moreover,the pertinent extremal graphs were illustrated.
文摘A graph is Hamiltonian if it contains a cycle that visits each vertex of the graph exactly once.A chord of a cycle C is an edge that joins two non-consecutive vertices of C.A graph of order n is chorded pancyclic if it contains a chorded cycle of length k for every integer k with 4≤k≤n.In 2018,Ferro and Lesniak gave an edge number conditon for the Hamiltonicity(and the chorded pancyclicity)of balanced and unbalanced k-partite graphs.In this paper,we extend the main results of Ferro and Lesniak,and provide an edge condition for the Hamiltonicity(and the chorded pancyclicity)of balanced and unbalanced k-partite graphs with given minimum degree,respectively.
基金This research is supported by NSFC(Nos.12171154,12301438)the Chenguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission(No.23CGA37)。
文摘Let Un be the set of connected unicyclic graphs of order n and girth g.Let C(T_(1),T_(2),...,T_(g))Un be obtained from a cycle v_(1)v_(2)…v_(g)v_(1)(in the anticlockwise direction)by identifying vi with the root of a rooted tree Ti of order ni for each i=1,2,...,g,where ni≥1 and∑^(g)_(i=1)n_(i)=n.Let S(n_(1),n_(2),...,n_(g))be obtained from C(T_(1),T_(2),..,T_(g))by replacing each Ti by a rooted star Sni with the center as its root.Let U(n_(1),n_(2),...,ng)be the set of unicyclic graphs which differ from the unicyclic graph S(n_(1),n_(2),...,n_(g))only up to a permutation of ni's.In this paper,the graph with the minimal least signless Laplacian eigenvalue(respectively,the graph with maximum signless Laplacian spread)in U(n_(1),n_(2),...,n_(g))is determined.
文摘基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其次,对GraphSAGE算法进行了改进,包括在消息传递阶段融合节点和边的特征,同时在消息聚合过程中考虑不同源节点对目标节点的影响程度,并在边嵌入生成时引入残差学习机制。在两个公开网络攻击数据集上的实验结果表明,在二分类情况下,所提算法的总体性能优于E-GraphSAGE、LSTM、RNN、CNN算法;在多分类情况下,所提算法在大多数攻击类型上的F1值高于对比算法。
基金supported by the National Natural Science Foundation of China(62402399)the New Chongqing Youth Innovation Talent Project(CSTB2024NSCQ-QCXMX0035)。
文摘Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications.
基金supported by the National Key Research and Development Program of China(2023YFF0612900,2023YFF0612902)the Natural Science Foundation of Beijing,China(4254086)+3 种基金the National Natural Science Foundation of China(62472032)the Open Project Funding of Key Laboratory of Mobile Application Innovation and Governance Technology,Ministry of Industry and Information Technology(2023IFS080601-K)the Beijing Institute of Technology Research Fund Program for Young Scholarsthe Young Elite Scientists Sponsorship Program by CAST(2023QNRC001)。
文摘Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving graph learning.However,its application often diminishes data utility,especially for nodes with fewer neighbors in graph neural networks(GNNs).
基金supported in part by the National Natural Science Foundation of China(62372385,62272078,62002337)Chongqing Natural Science Foundation(CSTB2022NSCQ-MSX1486,CSTB2023NSCQ-LZX0069)。
文摘A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spatial-temporal message passing mechanism built on tensor product.Concretely,an HGCN utilizes the discrete Fourier transform(DFT)to implement temporal message passing and then employs face-wise product to realize spatial message passing.However,DFT is only a special case of assorted time-frequency transforms,which considers the complex temporal patterns partially,thereby resulting in an inaccurate temporal message passing possibly.To address this issue,this study proposes six advanced time-frequency transform-incorporated HGCNs(TF-HGCNs)with discrete Fourier,discrete Hartley,discrete cosine,Haar wavelet,Walsh Hadamard,and slant transforms.In addition,a potent ensemble is built regarding the proposed six TF-HGCNs as the bases.Finally,the corresponding theoretical proof is presented.Empirical studies on six DG datasets demonstrate that owing to diverse time-frequency transforms,the proposed six TF-HGCNs significantly outperform state-of-the-art models in addressing the task of link weight estimation.Moreover,their ensemble outstrips each base's performance.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
基金supported by the National Natural Science Foundation of China(No.62267005)the Chinese Guangxi Natural Science Foundation(No.2023GXNSFAA026493)+1 种基金Guangxi Collaborative Innovation Center ofMulti-Source Information Integration and Intelligent ProcessingGuangxi Academy of Artificial Intelligence.
文摘The rapid development of information technology and accelerated digitalization have led to an explosive growth of data across various fields.As a key technology for knowledge representation and sharing,knowledge graphs play a crucial role by constructing structured networks of relationships among entities.However,data sparsity and numerous unexplored implicit relations result in the widespread incompleteness of knowledge graphs.In static knowledge graph completion,most existing methods rely on linear operations or simple interaction mechanisms for triple encoding,making it difficult to fully capture the deep semantic associations between entities and relations.Moreover,many methods focus only on the local information of individual triples,ignoring the rich semantic dependencies embedded in the neighboring nodes of entities within the graph structure,which leads to incomplete embedding representations.To address these challenges,we propose Two-Stage Mixer Embedding(TSMixerE),a static knowledge graph completion method based on entity context.In the unit semantic extraction stage,TSMixerE leveragesmulti-scale circular convolution to capture local features atmultiple granularities,enhancing the flexibility and robustness of feature interactions.A channel attention mechanism amplifies key channel responses to suppress noise and irrelevant information,thereby improving the discriminative power and semantic depth of feature representations.For contextual information fusion,a multi-layer self-attentionmechanism enables deep interactions among contextual cues,effectively integrating local details with global context.Simultaneously,type embeddings clarify the semantic identities and roles of each component,enhancing the model’s sensitivity and fusion capabilities for diverse information sources.Furthermore,TSMixerE constructs contextual unit sequences for entities,fully exploring neighborhood information within the graph structure to model complex semantic dependencies,thus improving the completeness and generalization of embedding representations.
基金Sichuan TCM Culture Coordinated Development Research Center Project(2023XT131)National Key Science and Technology Project of China(2023ZD0509405)National Natural Science Foundation of China(82174236).
文摘Objective To address the dual challenges of long-tail distribution and feature sparsity in traditional Chinese medicine(TCM)syndrome differentiation within real clinical settings,we propose a data-efficient learning framework enhanced by knowledge graphs.Methods We developed Agent-GNN,a three-stage decoupled learning framework,and validated it on the Traditional Chinese Medicine Syndrome Diagnosis(TCM-SD)dataset containing 54152 clinical records across 148 syndrome categories.First,we constructed a comprehensive medical knowledge graph encoding the complete TCM reasoning system.Second,we proposed a Functional Patient Profiling(FPP)method that utilizes large language models(LLMs)combined with Graph Retrieval-Augmented Generation(RAG)to extract structured symptom-etiology-pathogenesis subgraphs from medical records.Third,we employed heterogeneous graph neural networks to learn structured combination patterns explicitly.We compared our method against multiple baselines including BERT,ZY-BERT,ZY-BERT+Know,GAT,and GPT-4 Few-shot,using macro-F1 score as the primary evaluation metric.Additionally,ablation experiments were conducted to validate the contribution of each key component to model performance.Results Agent-GNN achieved an overall macro-F1 score of 72.4%,representing an 8.7 percentage points improvement over ZY-BERT+Know(63.7%),the strongest baseline among traditional methods.For long-tail syndromes with fewer than 10 samples,Agent-GNN reached a macro-F1 score of 58.6%,compared with 39.3%for ZY-BERT+Know and 41.2%for GPT-4 Few-shot,representing relative improvements of 49.2%and 42.2%,respectively.Ablation experiments confirmed that the explicit modeling of etiology-pathogenesis nodes contributed 12.4 percentage points to this enhanced long-tail syndrome performance.Conclusion This study proposes Agent-GNN,a knowledge graph-enhanced framework that effectively addresses the long-tail distribution challenge in TCM syndrome differentiation.By explicitly modeling manifestation-mechanism-essence patterns through structured knowledge graphs,our approach achieves superior performance in data-scarce scenarios while providing interpretable reasoning paths for TCM intelligent diagnosis.
基金supported byNationalNatural Science Foundation of China(GrantNos.62071098,U24B20128)Sichuan Science and Technology Program(Grant No.2022YFG0319).
文摘Knowledge graphs often suffer from sparsity and incompleteness.Knowledge graph reasoning is an effective way to address these issues.Unlike static knowledge graph reasoning,which is invariant over time,dynamic knowledge graph reasoning is more challenging due to its temporal nature.In essence,within each time step in a dynamic knowledge graph,there exists structural dependencies among entities and relations,whereas between adjacent time steps,there exists temporal continuity.Based on these structural and temporal characteristics,we propose a model named“DKGR-DR”to learn distributed representations of entities and relations by combining recurrent neural networks and graph neural networks to capture structural dependencies and temporal continuity in DKGs.In addition,we construct a static attribute graph to represent entities’inherent properties.DKGR-DR is capable of modeling both dynamic and static aspects of entities,enabling effective entity prediction and relation prediction.We conduct experiments on ICEWS05-15,ICEWS18,and ICEWS14 to demonstrate that DKGR-DR achieves competitive performance.
基金funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01296).
文摘Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.
