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.展开更多
The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to u...The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility patterns.Deep learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal dependencies.However,these models often become overly complex due to the large number of hyper-parameters involved.In this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction tasks.The comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest accuracy.On the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 min.Similarly,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer periods.The Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time intervals.These numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.展开更多
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.展开更多
Hyperspectral image(HSI)classification is crucial for numerous remote sensing applications.Traditional deep learning methods may miss pixel relationships and context,leading to inefficiencies.This paper introduces the...Hyperspectral image(HSI)classification is crucial for numerous remote sensing applications.Traditional deep learning methods may miss pixel relationships and context,leading to inefficiencies.This paper introduces the spectral band graph convolutional and attention-enhanced CNN joint network(SGCCN),a novel approach that harnesses the power of spectral band graph convolutions for capturing long-range relationships,utilizes local perception of attention-enhanced multi-level convolutions for local spatial feature and employs a dynamic attention mechanism to enhance feature extraction.The SGCCN integrates spectral and spatial features through a self-attention fusion network,significantly improving classification accuracy and efficiency.The proposed method outperforms existing techniques,demonstrating its effectiveness in handling the challenges associated with HSI data.展开更多
Deep neural network-based relational extraction research has made significant progress in recent years,andit provides data support for many natural language processing downstream tasks such as building knowledgegraph,...Deep neural network-based relational extraction research has made significant progress in recent years,andit provides data support for many natural language processing downstream tasks such as building knowledgegraph,sentiment analysis and question-answering systems.However,previous studies ignored much unusedstructural information in sentences that could enhance the performance of the relation extraction task.Moreover,most existing dependency-based models utilize self-attention to distinguish the importance of context,whichhardly deals withmultiple-structure information.To efficiently leverage multiple structure information,this paperproposes a dynamic structure attention mechanism model based on textual structure information,which deeplyintegrates word embedding,named entity recognition labels,part of speech,dependency tree and dependency typeinto a graph convolutional network.Specifically,our model extracts text features of different structures from theinput sentence.Textual Structure information Graph Convolutional Networks employs the dynamic structureattention mechanism to learn multi-structure attention,effectively distinguishing important contextual features invarious structural information.In addition,multi-structure weights are carefully designed as amergingmechanismin the different structure attention to dynamically adjust the final attention.This paper combines these featuresand trains a graph convolutional network for relation extraction.We experiment on supervised relation extractiondatasets including SemEval 2010 Task 8,TACRED,TACREV,and Re-TACED,the result significantly outperformsthe previous.展开更多
Classic Graph Convolutional Networks (GCNs) often learn node representation holistically, which ignores the distinct impacts from different neighbors when aggregating their features to update a node’s representation....Classic Graph Convolutional Networks (GCNs) often learn node representation holistically, which ignores the distinct impacts from different neighbors when aggregating their features to update a node’s representation. Disentangled GCNs have been proposed to divide each node’s representation into several feature units. However, current disentangling methods do not try to figure out how many inherent factors the model should assign to help extract the best representation of each node. This paper then proposes D^(2)-GCN to provide dynamic disentanglement in GCNs and present the most appropriate factorization of each node’s mixed features. The convergence of the proposed method is proved both theoretically and experimentally. Experiments on real-world datasets show that D^(2)-GCN outperforms the baseline models concerning node classification results in both single- and multi-label tasks.展开更多
Purpose-Human behavior recognition poses a pivotal challenge in intelligent computing and cybernetics,significantly impacting engineering and management systems.With the rapid advancement of autonomous systems and int...Purpose-Human behavior recognition poses a pivotal challenge in intelligent computing and cybernetics,significantly impacting engineering and management systems.With the rapid advancement of autonomous systems and intelligent manufacturing,there is an increasing demand for precise and efficient human behavior recognition technologies.However,traditional methods often suffer from insufficient accuracy and limited generalization ability when dealing with complex and diverse human actions.Therefore,this study aims to enhance the precision of human behavior recognition by proposing an innovative framework,dynamic graph convolutional networks with multi-scale position attention(DGCN-MPA)to sup.Design/methodology/approach-The primary applications are in autonomous systems and intelligent manufacturing.The main objective of this study is to develop an efficient human behavior recognition framework that leverages advanced techniques to improve the prediction and interpretation of human actions.This framework aims to address the shortcomings of existing methods in handling the complexity and variability of human actions,providing more reliable and precise solutions for practical applications.The proposed DGCN-MPA framework integrates the strengths of convolutional neural networks and graph-based models.It innovatively incorporates wavelet packet transform to extract time-frequency characteristics and a MPA module to enhance the representation of skeletal node positions.The core innovation lies in the fusion of dynamic graph convolution with hierarchical attention mechanisms,which selectively attend to relevant features and spatial relationships,adjusting their importance across scales to address the variability in human actions.Findings-To validate the effectiveness of the DGCN-MPA framework,rigorous evaluations were conducted on benchmark datasets such as NTU-RGB+D and Kinetics-Skeleton.The results demonstrate that the framework achieves an F1 score of 62.18%and an accuracy of 75.93%on NTU-RGB+D and an F1 score of 69.34%and an accuracy of 76.86%on Kinetics-Skeleton,outperforming existing models.These findings underscore the framework’s capability to capture complex behavior patterns with high precision.Originality/value-By introducing a dynamic graph convolutional approach combined with multi-scale position attention mechanisms,this study represents a significant advancement in human behavior recognition technologies.The innovative design and superior performance of the DGCN-MPA framework contribute to its potential for real-world applications,particularly in integrating behavior recognition into engineering and autonomous systems.In the future,this framework has the potential to further propel the development of intelligent computing,cybernetics and related fields.展开更多
Modeling and analysis of complex social networks is an important topic in social computing.Graph convolutional networks(GCNs)are widely used for learning social network embeddings and social network analysis.However,r...Modeling and analysis of complex social networks is an important topic in social computing.Graph convolutional networks(GCNs)are widely used for learning social network embeddings and social network analysis.However,real-world complex social networks,such as Facebook and Math,exhibit significant global structural and dynamic characteristics that are not adequately captured by conventional GCN models.To address the above issues,this paper proposes a novel graph convolutional network considering global structural features and global temporal dependencies(GSTGCN).Specifically,we innovatively design a graph coarsening strategy based on the importance of social membership to construct a dynamic diffusion process of graphs.This dynamic diffusion process can be viewed as using higher-order subgraph embeddings to guide the generation of lower-order subgraph embeddings,and we model this process using gate recurrent unit(GRU)to extract comprehensive global structural features of the graph and the evolutionary processes embedded among subgraphs.Furthermore,we design a new evolutionary strategy that incorporates a temporal self-attention mechanism to enhance the extraction of global temporal dependencies of dynamic networks by GRU.GSTGCN outperforms current state-of-the-art network embedding methods in important social networks tasks such as link prediction and financial fraud identification.展开更多
Multicolor fiber lasers have emerged as a promising technology with significant applications in optical communications,laser ranging,and precision sensing.Beyond their practical utility,these systems serve as ideal pl...Multicolor fiber lasers have emerged as a promising technology with significant applications in optical communications,laser ranging,and precision sensing.Beyond their practical utility,these systems serve as ideal platforms for investigating fundamental soliton phenomena,including soliton collisions,explosions,and state transitions.However,the complex nonlinear dynamics inherent in these systems present substantial challenges for conventional numerical simulations.展开更多
Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enh...Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enhanced Attention-driven Dynamic Graph Convolutional Network (E-ADGCN), for DDI extraction. Our model combines the Attention-driven Dynamic Graph Convolutional Network (ADGCN) with a feature fusion method and multi-task learning framework. The ADGCN effectively utilizes entity information and dependency tree information from biomedical texts to extract DDIs. The feature fusion method integrates User-Generated Content (UGC) and molecular information with drug entity information from text through dynamic routing. By leveraging external resources, our approach maximizes the auxiliary effect and improves the accuracy of DDI extraction. We evaluate the E-ADGCN model on the extended DDIExtraction2013 dataset and achieve an F1-score of 81.45%. This research contributes to the advancement of automated methods for extracting valuable drug interaction information from textual sources, facilitating improved medication management and patient safety.展开更多
情绪识别是人机交互(HCI)与情感智能领域的重要前沿课题之一。然而,目前基于脑电(EGG)信号的情绪识别方法主要提取静态特征,无法挖掘情绪的动态变化特性,难以提升情绪识别能力。在基于EGG构建动态脑功能网络的研究中,常采用滑动窗口方法...情绪识别是人机交互(HCI)与情感智能领域的重要前沿课题之一。然而,目前基于脑电(EGG)信号的情绪识别方法主要提取静态特征,无法挖掘情绪的动态变化特性,难以提升情绪识别能力。在基于EGG构建动态脑功能网络的研究中,常采用滑动窗口方法,通过依次构建不同窗口内的功能连接网络以形成动态网络。但该方法存在主观设定窗长的问题,无法提取每个时间点情绪状态的连接模式,导致时间信息丢失和脑连接信息不完整。针对上述问题,提出动态线性相位测量(dyPLM)方法,该方法无需使用滑窗,即可自适应地在每个时间点构建情绪相关脑网络,更精准地刻画情绪的动态变化特性。此外,还提出一种卷积门控神经网络(CNGRU)情绪识别模型,该模型可进一步提取动态脑网络深层次特征,有效提高情绪识别准确性。在公开情绪识别脑电数据集DEAP(Database for Emotion Analysis using Physiological signals)上进行验证,所提方法四分类准确率高达99.71%,较MFBPST-3D-DRLF提高3.51百分点。在SEED(SJTU Emotion EEG Dataset)数据集上进行验证,所提方法三分类准确率达到99.99%,较MFBPST-3D-DRLF提高3.32百分点。实验结果证明了所提出的动态脑网络构建方法dyPLM和情绪识别模型CNGRU的有效性和实用性。展开更多
基金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.
文摘The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility patterns.Deep learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal dependencies.However,these models often become overly complex due to the large number of hyper-parameters involved.In this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction tasks.The comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest accuracy.On the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 min.Similarly,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer periods.The Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time intervals.These numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.
基金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.
基金supported in part by the National Natural Science Foundations of China(No.61801214)the Postgraduate Research Practice Innovation Program of NUAA(No.xcxjh20231504)。
文摘Hyperspectral image(HSI)classification is crucial for numerous remote sensing applications.Traditional deep learning methods may miss pixel relationships and context,leading to inefficiencies.This paper introduces the spectral band graph convolutional and attention-enhanced CNN joint network(SGCCN),a novel approach that harnesses the power of spectral band graph convolutions for capturing long-range relationships,utilizes local perception of attention-enhanced multi-level convolutions for local spatial feature and employs a dynamic attention mechanism to enhance feature extraction.The SGCCN integrates spectral and spatial features through a self-attention fusion network,significantly improving classification accuracy and efficiency.The proposed method outperforms existing techniques,demonstrating its effectiveness in handling the challenges associated with HSI data.
文摘Deep neural network-based relational extraction research has made significant progress in recent years,andit provides data support for many natural language processing downstream tasks such as building knowledgegraph,sentiment analysis and question-answering systems.However,previous studies ignored much unusedstructural information in sentences that could enhance the performance of the relation extraction task.Moreover,most existing dependency-based models utilize self-attention to distinguish the importance of context,whichhardly deals withmultiple-structure information.To efficiently leverage multiple structure information,this paperproposes a dynamic structure attention mechanism model based on textual structure information,which deeplyintegrates word embedding,named entity recognition labels,part of speech,dependency tree and dependency typeinto a graph convolutional network.Specifically,our model extracts text features of different structures from theinput sentence.Textual Structure information Graph Convolutional Networks employs the dynamic structureattention mechanism to learn multi-structure attention,effectively distinguishing important contextual features invarious structural information.In addition,multi-structure weights are carefully designed as amergingmechanismin the different structure attention to dynamically adjust the final attention.This paper combines these featuresand trains a graph convolutional network for relation extraction.We experiment on supervised relation extractiondatasets including SemEval 2010 Task 8,TACRED,TACREV,and Re-TACED,the result significantly outperformsthe previous.
基金supported by the National Natural Science Foundation of China(Grant Nos.62141214 and 62272171).
文摘Classic Graph Convolutional Networks (GCNs) often learn node representation holistically, which ignores the distinct impacts from different neighbors when aggregating their features to update a node’s representation. Disentangled GCNs have been proposed to divide each node’s representation into several feature units. However, current disentangling methods do not try to figure out how many inherent factors the model should assign to help extract the best representation of each node. This paper then proposes D^(2)-GCN to provide dynamic disentanglement in GCNs and present the most appropriate factorization of each node’s mixed features. The convergence of the proposed method is proved both theoretically and experimentally. Experiments on real-world datasets show that D^(2)-GCN outperforms the baseline models concerning node classification results in both single- and multi-label tasks.
基金supported by the Guangxi University Young and middle-aged Teachers Basic Ability Improvement Project(No.:2023KY1692)Guilin University of Information Technology 2022 Research Project(No.:XJ202207)。
文摘Purpose-Human behavior recognition poses a pivotal challenge in intelligent computing and cybernetics,significantly impacting engineering and management systems.With the rapid advancement of autonomous systems and intelligent manufacturing,there is an increasing demand for precise and efficient human behavior recognition technologies.However,traditional methods often suffer from insufficient accuracy and limited generalization ability when dealing with complex and diverse human actions.Therefore,this study aims to enhance the precision of human behavior recognition by proposing an innovative framework,dynamic graph convolutional networks with multi-scale position attention(DGCN-MPA)to sup.Design/methodology/approach-The primary applications are in autonomous systems and intelligent manufacturing.The main objective of this study is to develop an efficient human behavior recognition framework that leverages advanced techniques to improve the prediction and interpretation of human actions.This framework aims to address the shortcomings of existing methods in handling the complexity and variability of human actions,providing more reliable and precise solutions for practical applications.The proposed DGCN-MPA framework integrates the strengths of convolutional neural networks and graph-based models.It innovatively incorporates wavelet packet transform to extract time-frequency characteristics and a MPA module to enhance the representation of skeletal node positions.The core innovation lies in the fusion of dynamic graph convolution with hierarchical attention mechanisms,which selectively attend to relevant features and spatial relationships,adjusting their importance across scales to address the variability in human actions.Findings-To validate the effectiveness of the DGCN-MPA framework,rigorous evaluations were conducted on benchmark datasets such as NTU-RGB+D and Kinetics-Skeleton.The results demonstrate that the framework achieves an F1 score of 62.18%and an accuracy of 75.93%on NTU-RGB+D and an F1 score of 69.34%and an accuracy of 76.86%on Kinetics-Skeleton,outperforming existing models.These findings underscore the framework’s capability to capture complex behavior patterns with high precision.Originality/value-By introducing a dynamic graph convolutional approach combined with multi-scale position attention mechanisms,this study represents a significant advancement in human behavior recognition technologies.The innovative design and superior performance of the DGCN-MPA framework contribute to its potential for real-world applications,particularly in integrating behavior recognition into engineering and autonomous systems.In the future,this framework has the potential to further propel the development of intelligent computing,cybernetics and related fields.
基金supported by the National Natural Science Foundation of China(Nos.62002063 and U21A20472)Natural Science Foundation of Fujian Province(Nos.2020J05112 and 2022J01118)+1 种基金National Key Research and Development Plan of China(No.2021YFB3600503)Major Science and Technology Project of Fujian Province(No.2021HZ022007).
文摘Modeling and analysis of complex social networks is an important topic in social computing.Graph convolutional networks(GCNs)are widely used for learning social network embeddings and social network analysis.However,real-world complex social networks,such as Facebook and Math,exhibit significant global structural and dynamic characteristics that are not adequately captured by conventional GCN models.To address the above issues,this paper proposes a novel graph convolutional network considering global structural features and global temporal dependencies(GSTGCN).Specifically,we innovatively design a graph coarsening strategy based on the importance of social membership to construct a dynamic diffusion process of graphs.This dynamic diffusion process can be viewed as using higher-order subgraph embeddings to guide the generation of lower-order subgraph embeddings,and we model this process using gate recurrent unit(GRU)to extract comprehensive global structural features of the graph and the evolutionary processes embedded among subgraphs.Furthermore,we design a new evolutionary strategy that incorporates a temporal self-attention mechanism to enhance the extraction of global temporal dependencies of dynamic networks by GRU.GSTGCN outperforms current state-of-the-art network embedding methods in important social networks tasks such as link prediction and financial fraud identification.
文摘Multicolor fiber lasers have emerged as a promising technology with significant applications in optical communications,laser ranging,and precision sensing.Beyond their practical utility,these systems serve as ideal platforms for investigating fundamental soliton phenomena,including soliton collisions,explosions,and state transitions.However,the complex nonlinear dynamics inherent in these systems present substantial challenges for conventional numerical simulations.
基金supported by the National Natural Science Foundation of China(No.62476025)the Shaanxi Provincial Department of Science and Technology Projects(No.2013K06-39).
文摘Automatically extracting Drug-Drug Interactions (DDIs) from text is a crucial and challenging task, particularly when multiple medications are taken concurrently. In this study, we propose a novel approach, called Enhanced Attention-driven Dynamic Graph Convolutional Network (E-ADGCN), for DDI extraction. Our model combines the Attention-driven Dynamic Graph Convolutional Network (ADGCN) with a feature fusion method and multi-task learning framework. The ADGCN effectively utilizes entity information and dependency tree information from biomedical texts to extract DDIs. The feature fusion method integrates User-Generated Content (UGC) and molecular information with drug entity information from text through dynamic routing. By leveraging external resources, our approach maximizes the auxiliary effect and improves the accuracy of DDI extraction. We evaluate the E-ADGCN model on the extended DDIExtraction2013 dataset and achieve an F1-score of 81.45%. This research contributes to the advancement of automated methods for extracting valuable drug interaction information from textual sources, facilitating improved medication management and patient safety.
文摘情绪识别是人机交互(HCI)与情感智能领域的重要前沿课题之一。然而,目前基于脑电(EGG)信号的情绪识别方法主要提取静态特征,无法挖掘情绪的动态变化特性,难以提升情绪识别能力。在基于EGG构建动态脑功能网络的研究中,常采用滑动窗口方法,通过依次构建不同窗口内的功能连接网络以形成动态网络。但该方法存在主观设定窗长的问题,无法提取每个时间点情绪状态的连接模式,导致时间信息丢失和脑连接信息不完整。针对上述问题,提出动态线性相位测量(dyPLM)方法,该方法无需使用滑窗,即可自适应地在每个时间点构建情绪相关脑网络,更精准地刻画情绪的动态变化特性。此外,还提出一种卷积门控神经网络(CNGRU)情绪识别模型,该模型可进一步提取动态脑网络深层次特征,有效提高情绪识别准确性。在公开情绪识别脑电数据集DEAP(Database for Emotion Analysis using Physiological signals)上进行验证,所提方法四分类准确率高达99.71%,较MFBPST-3D-DRLF提高3.51百分点。在SEED(SJTU Emotion EEG Dataset)数据集上进行验证,所提方法三分类准确率达到99.99%,较MFBPST-3D-DRLF提高3.32百分点。实验结果证明了所提出的动态脑网络构建方法dyPLM和情绪识别模型CNGRU的有效性和实用性。
