期刊文献+
共找到46,327篇文章
< 1 2 250 >
每页显示 20 50 100
基于SOP-Graph和AI辅助的职业教育课程开发:要义、框架与途径
1
作者 向燕 郑洪波 《工业技术与职业教育》 2026年第1期78-82,共5页
提出了一种基于SOP-Graph(Standard Operating Procedure Graph)模型和AI技术的职业教育课程开发范式,旨在解决当前职业教育体系中标准更新滞后、课程内容脱节的问题。该范式的核心要义包括标准牵引与能力本位、任务化载体与“教学—学... 提出了一种基于SOP-Graph(Standard Operating Procedure Graph)模型和AI技术的职业教育课程开发范式,旨在解决当前职业教育体系中标准更新滞后、课程内容脱节的问题。该范式的核心要义包括标准牵引与能力本位、任务化载体与“教学—学习—评价一致性”、数据治理与敏捷迭代。基于这些要义,构建了“图谱化对齐—任务化同构—规则化协同—节拍化治理”的总体框架,并提出了包括入图建模、子图对齐、单元生成、版本管理等在内的六环节路径。结合OCR、命名实体识别(NER)和检索增强生成等AI技术,模型实现了从企业标准到能力、学习目标和教学评价的可计算映射与自动校验。相较于传统的以产出为导向的教育模式,本范式创新性地提出了以标准为源事实的溯源图谱与持续迭代的版本治理机制。研究的预期成果是促进“岗—课—赛—证”一体化,提升职业教育课程的应用性和可复制性,为职业教育的高质量发展提供技术支持。 展开更多
关键词 图谱建模 职业教育 课程开发 AI辅助
在线阅读 下载PDF
Constructing Three-Dimension Space Graph for Outlier Detection Algorithms in Data Mining 被引量:1
2
作者 ZHANG Jing 1,2 , SUN Zhi-hui 1 1.Department of Computer Science and Engineering, Southeast University, Nanjing 210096, Jiangsu, China 2.Department of Electricity and Information Engineering, Jiangsu University, Zhenjiang 212001, Jiangsu, China 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期585-589,共5页
Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional sp... Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory. Key words outlier - detection - three-dimensional space graph - data mining CLC number TP 311. 13 - TP 391 Foundation item: Supported by the National Natural Science Foundation of China (70371015)Biography: ZHANG Jing (1975-), female, Ph. D, lecturer, research direction: data mining and knowledge discovery. 展开更多
关键词 OUTLIER DETECTION three-dimensional space graph data mining
在线阅读 下载PDF
Three-dimension collision-free trajectory planning of UAVs based on ADS-B information in low-altitude urban airspace 被引量:2
3
作者 Chao DONG Yifan ZHANG +3 位作者 Ziye JIA Yiyang LIAO Lei ZHANG Qihui WU 《Chinese Journal of Aeronautics》 2025年第2期274-285,共12页
The environment of low-altitude urban airspace is complex and variable due to numerous obstacles,non-cooperative aircraft,and birds.Unmanned Aerial Vehicles(UAVs)leveraging environmental information to achieve three-d... The environment of low-altitude urban airspace is complex and variable due to numerous obstacles,non-cooperative aircraft,and birds.Unmanned Aerial Vehicles(UAVs)leveraging environmental information to achieve three-dimension collision-free trajectory planning is the prerequisite to ensure airspace security.However,the timely information of surrounding situation is difficult to acquire by UAVs,which further brings security risks.As a mature technology leveraged in traditional civil aviation,the Automatic Dependent Surveillance-Broadcast(ADS-B)realizes continuous surveillance of the information of aircraft.Consequently,we leverage ADS-B for surveillance and information broadcasting,and divide the aerial airspace into multiple sub-airspaces to improve flight safety in UAV trajectory planning.In detail,we propose the secure Sub-airSpaces Planning(SSP)algorithm and Particle Swarm Optimization Rapidly-exploring Random Trees(PSO-RRT)algorithm for the UAV trajectory planning in law-altitude airspace.The performance of the proposed algorithm is verified by simulations and the results show that SSP reduces both the maximum number of UAVs in the sub-airspace and the length of the trajectory,and PSO-RRT reduces the cost of UAV trajectory in the sub-airspace. 展开更多
关键词 three-dimension trajectory planning of UAV Collision avoidance Sliding window ADS-B Low-altitude urban airspace
原文传递
Rigid graph-based three-dimension localization algorithm for wireless sensor networks 被引量:2
4
作者 LUO Xiaoyuan ZHONG Wenjing +1 位作者 LI Xiaolei GUAN Xinping 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第5期927-936,共10页
This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communicati... This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm. 展开更多
关键词 wireless sensor network LOCALIZATION rigid graph quadrilateration
在线阅读 下载PDF
Dynamic Characteristic Mechanism of Atrial Septal Defect Using Real-Time Three-Dimensional Echocardiography and Evaluation of Right Ventricular Functions 被引量:7
5
作者 沙仁高娃 张军 +1 位作者 秦川 吕清 《Journal of Huazhong University of Science and Technology(Medical Sciences)》 SCIE CAS 2017年第1期140-147,共8页
The dynamic characteristics of the area of the atrial septal defect(ASD) were evaluated using the technique of real-time three-dimensional echocardiography(RT 3DE), the potential factors responsible for the dynami... The dynamic characteristics of the area of the atrial septal defect(ASD) were evaluated using the technique of real-time three-dimensional echocardiography(RT 3DE), the potential factors responsible for the dynamic characteristics of the area of ASD were observed, and the overall and local volume and functions of the patients with ASD were measured. RT 3DE was performed on the 27 normal controls and 28 patients with ASD. Based on the three-dimensional data workstations, the area of ASD was measured at P wave vertex, R wave vertex, T wave starting point, and T wave terminal point and in the T-P section. The right atrial volume in the same time phase of the cardiac cycle and the motion displacement distance of the tricuspid annulus in the corresponding period were measured. The measured value of the area of ASD was analyzed. The changes in the right atrial volume and the motion displacement distance of the tricuspid annulus in the normal control group and the ASD group were compared. The right ventricular ejection fractions in the normal control group and the ASD group were compared using the RT 3DE long-axis eight-plane(LA 8-plane) method. Real-time three-dimensional volume imaging was performed in the normal control group and ASD group(n=30). The right ventricular inflow tract, outflow tract, cardiac apex muscular trabecula dilatation, end-systolic volume, overall dilatation, end-systolic volume, and appropriate local and overall ejection fractions in both two groups were measured with the four-dimensional right ventricular quantitative analysis method(4D RVQ) and compared. The overall right ventricular volume and the ejection fraction measured by the LA 8-plane method and 4D RVQ were subjected to a related analysis. Dynamic changes occurred to the area of ASD in the cardiac cycle. The rules for dynamic changes in the area of ASD and the rules for changes in the right atrial volume in the cardiac cycle were consistent. The maximum value of the changes in the right atrial volume occurred in the end-systolic period when the peak of the curve appeared. The minimum value of the changes occurred in the end-systolic period and was located at the lowest point of the volume variation curve. The area variation curve for ASD and the motion variation curve for the tricuspid annulus in the cardiac cycle were the same. The displacement of the tricuspid annulus exhibited directionality. The measured values of the area of ASD at P wave vertex, R wave vertex, T wave starting point, T wave terminal point and in the T-P section were properly correlated with the right atrial volume(P〈0.001). The area of ASD and the motion displacement distance of the tricuspid annulus were negatively correlated(P〈0.05). The right atrial volumes in the ASD group in the cardiac cycle in various time phases increased significantly as compared with those in the normal control group(P=0.0001). The motion displacement distance of the tricuspid annulus decreased significantly in the ASD group as compared with that in the normal control group(P=0.043). The right ventricular ejection fraction in the ASD group was lower than that in the normal control group(P=0.032). The ejection fraction of the cardiac apex trabecula of the ASD patients was significantly lower than the ejection fractions of the right ventricular outflow tract and inflow tract and overall ejection fraction. The difference was statistically significant(P=0.005). The right ventricular local and overall dilatation and end-systolic volumes in the ASD group increased significantly as compared with those in the normal control group(P=0.031). The a RVEF and the overall ejection fraction decreased in the ASD group as compared with those in the normal control group(P=0.0005). The dynamic changes in the area of ASD and the motion curves for the right atrial volume and tricuspid annulus have the same dynamic characteristics. RT 3DE can be used to accurately evaluate the local and overall volume and functions of the right ventricle. The local and overall volume loads of the right ventricle in the ASD patients increase significantly as compared with those of the normal people. The right ventricular cardiac apex and the overall systolic function decrease. 展开更多
关键词 ultrasonic cardiography real-time three-dimension atrial septal defect tricuspid annulus right atrium
暂未订购
Clinical Value of Stereoscopic Three-dimensional Echocardiography in Assessment of Atrial Septal Defects: Feasibility and Efficiency 被引量:1
6
作者 王静 王新房 +3 位作者 谢明星 贺林 吕清 王蕾 《Journal of Huazhong University of Science and Technology(Medical Sciences)》 SCIE CAS 2009年第6期791-794,共4页
Stereoscopic three-dimensional echocardiography(S-3DE) is a novel displaying technol-ogy based on real-time 3-dimensional echocardiography (RT-3DE). Our study was to evaluate the feasibility and efficiency of S-3D... Stereoscopic three-dimensional echocardiography(S-3DE) is a novel displaying technol-ogy based on real-time 3-dimensional echocardiography (RT-3DE). Our study was to evaluate the feasibility and efficiency of S-3DE in the diagnosis of atrial septal defect (ASD) and its use in the guidance for transcatheter ASD occlusion. Twelve patients with secundum ASD underwent RT-3DE examination and 9 of the 12 were subjected to transcatheter closure of ASD. Stereoscopic vision was generated with a high-performance volume renderer with red-green stereoscopic glasses. S-3DE was compared with standard RT-3D display for the assessment of the shape, size, and the surrounding tis-sues of ASD and for the guidance of ASD occlusion. The appearance rate of coronary sinus and the mean formation time of the IVC, SVC were compared. Our results showed that S-3DE could measure the diameter of ASD accurately and there was no significant difference in the measurements between S-3DE and standard 3D display (2.89±0.73 cm vs 2.85±0.72 cm, P〉0.05; r=0.96, P〈0.05). The appearance of coronary sinus for S-3DE was higher as compared with the standard 3D display (93.3% vs 100%). The mean time of the IVC, SVC for S-3DE monitor was slightly shorter than that of the standard 3D display (11.0±3.8 s vs 10.3±3.6 s, P〉0.05). The mean completion time of interven-tional procedure was shortened with S-3DE display as compared with standard 3D display (17.3±3.1 min vs 23.0±3.9 min, P〈0.05). Stereoscopic three-dimensional echocardiography could improve the visualization of three-dimensional echocardiography, facilitate the identification of the adjacent structures, decrease the time required for interventional manipulation. It may be a feasible, safe, and efficient tool for guiding transcatheter septal occlusion or the surgical interventions. 展开更多
关键词 ECHOCARDIOgraphY stereoscopic vision real time three-dimension atrial septal defect OCCLUSION
暂未订购
Navigating anatomical complexity in laparoscopic sigmoid cancer surgery:A three-dimension reconstruction protocol for intraoperative safety and efficiency
7
作者 Zong-Xian Zhao Run-Dong Yao +3 位作者 Zong-Ju Hu Chao-Qian Chen Shu Zhu Yuan Yao 《World Journal of Gastrointestinal Surgery》 2025年第8期350-361,共12页
BACKGROUND Sigmoid colon cancer faces challenges due to anatomical diversity,including variable inferior mesenteric artery(IMA)branching and tumor localization complexities,which increase intraoperative risks.AIM To c... BACKGROUND Sigmoid colon cancer faces challenges due to anatomical diversity,including variable inferior mesenteric artery(IMA)branching and tumor localization complexities,which increase intraoperative risks.AIM To comprehensively evaluate the impact of three-dimensional(3D)visualization technology on enhancing surgical precision and safety,as well as optimizing perioperative outcomes in laparoscopic sigmoid cancer resection.METHODS A prospective cohort of 106 patients(January 2023 to December 2024)undergoing laparoscopic sigmoid cancer resection was divided into the 3D(n=55)group and the control(n=51)group.The 3D group underwent preoperative enhanced computed tomography reconstruction(3D Slicer 5.2.2&Mimics 19.0).3D reconstruction visualization navigation intraoperatively guided the following key steps:Tumor location,Toldt’s space dissection,IMA ligation level selection,regional lymph node dissection,and marginal artery preservation.Outcomes included operative parameters,lymph node yield,and recovery metrics.RESULTS The 3D group demonstrated a significantly shorter operative time(172.91±20.69 minutes vs 190.29±32.29 minutes;P=0.002),reduced blood loss(31.5±11.8 mL vs 44.1±23.4 mL,P=0.001),earlier postoperative flatus(2.23±0.54 days vs 2.53±0.61 days;P=0.013),shorter hospital length of stay(13.47±1.74 days vs 16.20±7.71 days;P=0.013),shorter postoperative length of stay(8.6±2.6 days vs 10.5±4.9 days;P=0.014),and earlier postoperative exhaust time(2.23±0.54 days vs 2.53±0.61 days;P=0.013).Furthermore,the 3D group exhibited a higher mean number of lymph nodes harvested(16.91±5.74 vs 14.45±5.66;P=0.030).CONCLUSION The 3D visualization technology effectively addresses sigmoid colon anatomical complexity through surgical navigation,improving procedural safety and efficiency. 展开更多
关键词 three-dimension reconstruction Sigmoid colon cancer Visualization Inferior mesenteric artery Anatomical complexity Intraoperative safety
暂未订购
Sharp Bounds for ABS Index of Line,Total and Mycielski Graphs
8
作者 YE Qingfang LI Fengwei 《数学进展》 北大核心 2026年第1期45-59,共15页
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. 展开更多
关键词 ABS index line graph total graph Mycielski graph
原文传递
基于内嵌物理信息GraphSAGE模型的配电网最大供电能力计算
9
作者 刘宝龙 陈中 +2 位作者 王毅 乔勇 颜浩伟 《电力自动化设备》 北大核心 2026年第3期77-84,共8页
针对配电网最大供电能力计算存在的物理约束难以满足、效率不足、拓扑适应性差等问题,提出一种基于内嵌物理信息图采样与聚合(GraphSAGE)模型的配电网最大供电能力计算方法,可以实现未见信息的生成嵌入,快速计算出多变场景下的配电网最... 针对配电网最大供电能力计算存在的物理约束难以满足、效率不足、拓扑适应性差等问题,提出一种基于内嵌物理信息图采样与聚合(GraphSAGE)模型的配电网最大供电能力计算方法,可以实现未见信息的生成嵌入,快速计算出多变场景下的配电网最大供电能力。将物理约束嵌入GraphSAGE模型,强制模型在训练过程中满足物理规律,提高模型可解释性并降低对数据集数量和质量的要求;通过边特征聚合和图自编码器预训练克服模型不能考虑边信息及节点特征丢失的缺点;在节点采样后,将多头注意力机制融入节点特征聚合过程中,提高模型的计算精度。算例以及对比实验结果表明,所提方法对新能源出力和配电网拓扑变化具有更强的适应能力。 展开更多
关键词 图卷积网络 配电网 最大供电能力 物理信息 图注意力机制
在线阅读 下载PDF
基于LA-GraphCAN的甘肃省泥石流易发性评价
10
作者 郭玲 薛晔 孙鹏翔 《地质科技通报》 北大核心 2026年第1期212-224,共13页
目前对泥石流灾害易发性相关研究尚未考虑泥石流灾害的地理位置关系以及空间依赖性。本研究构建了包含4286个正样本点和5912个负样本点的甘肃省泥石流数据集,提出了一种基于LA-GraphCAN(local augmentation graph convolutional and att... 目前对泥石流灾害易发性相关研究尚未考虑泥石流灾害的地理位置关系以及空间依赖性。本研究构建了包含4286个正样本点和5912个负样本点的甘肃省泥石流数据集,提出了一种基于LA-GraphCAN(local augmentation graph convolutional and attention network)的泥石流易发性评价方法。首先,以样本点的经纬度投影坐标为基础,利用KNN(K-nearest neighbors)构建最近邻图,捕捉泥石流灾害点之间的复杂地理位置关系;其次,使用GCN(graph convolutional network)高效聚合局部邻域信息,提取关键地理和环境特征,不仅关注单个栅格所包含的信息,还深入探讨了相邻栅格之间空间结构的相互关系,从而使模型能够更精准地识别和理解样本中的局部空间特征。同时,引入GAT(graph attention network)添加动态注意力机制,细化特征表示;再次,验证所提方法的有效性,并从不同角度对比分析;最后,对甘肃省泥石流易发性进行评价。结果表明,考虑了泥石流灾害地理位置关系的LA-GraphCAN的ROC曲线下面积(AUC)、准确率、精确率、召回率以及F1分数分别为0.9868,0.9458,0.9436,0.9228和0.9331,与主流机器学习模型CNN(convolutional neural networks)、Decision tree等相比最优。基于LA-GraphCAN评价的甘肃省泥石流极高易发区中历史泥石流灾害点数量为4055个,占甘肃省历史泥石流总数的95%,与历史灾害分布基本一致。性能评估和甘肃省泥石流易发性评价结果均表明考虑泥石流灾害空间依赖性的LA-GraphCAN方法的评价结果更优,在泥石流易发性评价研究中有较好的适用性。 展开更多
关键词 LA-graphCAN 泥石流易发性评价 GCN GAT 甘肃省
在线阅读 下载PDF
The Least Signless Laplacian Eigenvalue of Unicyclic Graphs
11
作者 LI Xiaomeng WANG Zhiwen +1 位作者 TONG Panpan GUO Jiming 《数学进展》 北大核心 2026年第1期60-68,共9页
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. 展开更多
关键词 signless Laplacian matrix EIGENVALUE unicyclic graph
原文传递
Dynamic Knowledge Graph Reasoning Based on Distributed Representation Learning
12
作者 Qiuru Fu Shumao Zhang +4 位作者 Shuang Zhou Jie Xu Changming Zhao Shanchao Li Du Xu 《Computers, Materials & Continua》 2026年第2期1542-1560,共19页
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. 展开更多
关键词 Dynamic knowledge graph reasoning recurrent neural network graph convolutional network graph attention mechanism
在线阅读 下载PDF
Graph Attention Networks for Skin Lesion Classification with CNN-Driven Node Features
13
作者 Ghadah Naif Alwakid Samabia Tehsin +3 位作者 Mamoona Humayun Asad Farooq Ibrahim Alrashdi Amjad Alsirhani 《Computers, Materials & Continua》 2026年第1期1964-1984,共21页
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. 展开更多
关键词 graph neural network image classification DermaMNIST dataset graph representation
在线阅读 下载PDF
Automatic Detection of Health-Related Rumors: A Dual-Graph Collaborative Reasoning Framework Based on Causal Logic and Knowledge Graph
14
作者 Ning Wang Haoran Lyu Yuchen Fu 《Computers, Materials & Continua》 2026年第1期2163-2193,共31页
With the widespread use of social media,the propagation of health-related rumors has become a significant public health threat.Existing methods for detecting health rumors predominantly rely on external knowledge or p... With the widespread use of social media,the propagation of health-related rumors has become a significant public health threat.Existing methods for detecting health rumors predominantly rely on external knowledge or propagation structures,with only a few recent approaches attempting causal inference;however,these have not yet effectively integrated causal discovery with domain-specific knowledge graphs for detecting health rumors.In this study,we found that the combined use of causal discovery and domain-specific knowledge graphs can effectively identify implicit pseudo-causal logic embedded within texts,holding significant potential for health rumor detection.To this end,we propose CKDG—a dual-graph fusion framework based on causal logic and medical knowledge graphs.CKDG constructs a weighted causal graph to capture the implicit causal relationships in the text and introduces a medical knowledge graph to verify semantic consistency,thereby enhancing the ability to identify the misuse of professional terminology and pseudoscientific claims.In experiments conducted on a dataset comprising 8430 health rumors,CKDG achieved an accuracy of 91.28%and an F1 score of 90.38%,representing improvements of 5.11%and 3.29%over the best baseline,respectively.Our results indicate that the integrated use of causal discovery and domainspecific knowledge graphs offers significant advantages for health rumor detection systems.This method not only improves detection performance but also enhances the transparency and credibility of model decisions by tracing causal chains and sources of knowledge conflicts.We anticipate that this work will provide key technological support for the development of trustworthy health-information filtering systems,thereby improving the reliability of public health information on social media. 展开更多
关键词 Health rumor detection causal graph knowledge graph dual-graph fusion
在线阅读 下载PDF
A Novel Unsupervised Structural Attack and Defense for Graph Classification
15
作者 Yadong Wang Zhiwei Zhang +2 位作者 Pengpeng Qiao Ye Yuan Guoren Wang 《Computers, Materials & Continua》 2026年第1期1761-1782,共22页
Graph Neural Networks(GNNs)have proven highly effective for graph classification across diverse fields such as social networks,bioinformatics,and finance,due to their capability to learn complex graph structures.Howev... Graph Neural Networks(GNNs)have proven highly effective for graph classification across diverse fields such as social networks,bioinformatics,and finance,due to their capability to learn complex graph structures.However,despite their success,GNNs remain vulnerable to adversarial attacks that can significantly degrade their classification accuracy.Existing adversarial attack strategies primarily rely on label information to guide the attacks,which limits their applicability in scenarios where such information is scarce or unavailable.This paper introduces an innovative unsupervised attack method for graph classification,which operates without relying on label information,thereby enhancing its applicability in a broad range of scenarios.Specifically,our method first leverages a graph contrastive learning loss to learn high-quality graph embeddings by comparing different stochastic augmented views of the graphs.To effectively perturb the graphs,we then introduce an implicit estimator that measures the impact of various modifications on graph structures.The proposed strategy identifies and flips edges with the top-K highest scores,determined by the estimator,to maximize the degradation of the model’s performance.In addition,to defend against such attack,we propose a lightweight regularization-based defense mechanism that is specifically tailored to mitigate the structural perturbations introduced by our attack strategy.It enhances model robustness by enforcing embedding consistency and edge-level smoothness during training.We conduct experiments on six public TU graph classification datasets:NCI1,NCI109,Mutagenicity,ENZYMES,COLLAB,and DBLP_v1,to evaluate the effectiveness of our attack and defense strategies.Under an attack budget of 3,the maximum reduction in model accuracy reaches 6.67%on the Graph Convolutional Network(GCN)and 11.67%on the Graph Attention Network(GAT)across different datasets,indicating that our unsupervised method induces degradation comparable to state-of-the-art supervised attacks.Meanwhile,our defense achieves the highest accuracy recovery of 3.89%(GCN)and 5.00%(GAT),demonstrating improved robustness against structural perturbations. 展开更多
关键词 graph classification graph neural networks adversarial attack
在线阅读 下载PDF
HGS-ATD:A Hybrid Graph Convolutional Network-GraphSAGE Model for Anomaly Traffic Detection
16
作者 Zhian Cui Hailong Li Xieyang Shen 《Journal of Harbin Institute of Technology(New Series)》 2026年第1期33-50,共18页
With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a ... With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks. 展开更多
关键词 anomaly traffic detection graph neural network deep learning graph convolutional network
在线阅读 下载PDF
TSMixerE:Entity Context-Aware Method for Static Knowledge Graph Completion
17
作者 Jianzhong Chen Yunsheng Xu +2 位作者 Zirui Guo Tianmin Liu Ying Pan 《Computers, Materials & Continua》 2026年第4期2207-2230,共24页
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. 展开更多
关键词 Knowledge graph knowledge graph complementation convolutional neural network feature interaction context
在线阅读 下载PDF
Knowledge graph-enhanced long-tail learning approach for traditional Chinese medicine syndrome differentiation
18
作者 Weikang Kong Chuanbiao Wen Yue Luo 《Digital Chinese Medicine》 2026年第1期57-67,共11页
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. 展开更多
关键词 Syndrome differentiation Medical knowledge graph graph neural networks Long-tail learning Data-efficient learning
在线阅读 下载PDF
A Multi-Scale Graph Neural Networks Ensemble Approach for Enhanced DDoS Detection
19
作者 Noor Mueen Mohammed Ali Hayder Seyed Amin Hosseini Seno +2 位作者 Hamid Noori Davood Zabihzadeh Mehdi Ebady Manaa 《Computers, Materials & Continua》 2026年第4期1216-1242,共27页
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. 展开更多
关键词 DDoS detection graph neural networks multi-scale learning ensemble learning network security stealth attacks network graphs
在线阅读 下载PDF
Prediction of three-dimensional ocean temperature in the South China Sea based on time series gridded data and a dynamic spatiotemporal graph neural network
20
作者 Feng Nan Zhuolin Li +3 位作者 Jie Yu Suixiang Shi Xinrong Wu Lingyu Xu 《Acta Oceanologica Sinica》 SCIE CAS CSCD 2024年第7期26-39,共14页
Ocean temperature is an important physical variable in marine ecosystems,and ocean temperature prediction is an important research objective in ocean-related fields.Currently,one of the commonly used methods for ocean... Ocean temperature is an important physical variable in marine ecosystems,and ocean temperature prediction is an important research objective in ocean-related fields.Currently,one of the commonly used methods for ocean temperature prediction is based on data-driven,but research on this method is mostly limited to the sea surface,with few studies on the prediction of internal ocean temperature.Existing graph neural network-based methods usually use predefined graphs or learned static graphs,which cannot capture the dynamic associations among data.In this study,we propose a novel dynamic spatiotemporal graph neural network(DSTGN)to predict threedimensional ocean temperature(3D-OT),which combines static graph learning and dynamic graph learning to automatically mine two unknown dependencies between sequences based on the original 3D-OT data without prior knowledge.Temporal and spatial dependencies in the time series were then captured using temporal and graph convolutions.We also integrated dynamic graph learning,static graph learning,graph convolution,and temporal convolution into an end-to-end framework for 3D-OT prediction using time-series grid data.In this study,we conducted prediction experiments using high-resolution 3D-OT from the Copernicus global ocean physical reanalysis,with data covering the vertical variation of temperature from the sea surface to 1000 m below the sea surface.We compared five mainstream models that are commonly used for ocean temperature prediction,and the results showed that the method achieved the best prediction results at all prediction scales. 展开更多
关键词 dynamic associations three-dimensional ocean temperature prediction graph neural network time series gridded data
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部