A constrained partial permutation strategy is proposed for matching spatial relation graph (SRG), which is used in our sketch input and recognition system Smart Sketchpad for representing the spatial relationship amon...A constrained partial permutation strategy is proposed for matching spatial relation graph (SRG), which is used in our sketch input and recognition system Smart Sketchpad for representing the spatial relationship among the components of a graphic object. Using two kinds of matching constraints dynamically generated in the matching process, the proposed approach can prune most improper mappings between SRGs during the matching process. According to our theoretical analysis in this paper, the time complexity of our approach is O(n 2) in the best case, and O(n!) in the worst case, which occurs infrequently. The spatial complexity is always O(n) for all cases. Implemented in Smart Sketchpad, our proposed strategy is of good performance.展开更多
Given the scarcity of Satellite Frequency and Orbit(SFO)resources,it holds paramount importance to establish a comprehensive knowledge graph of SFO field(SFO-KG)and employ knowledge reasoning technology to automatical...Given the scarcity of Satellite Frequency and Orbit(SFO)resources,it holds paramount importance to establish a comprehensive knowledge graph of SFO field(SFO-KG)and employ knowledge reasoning technology to automatically mine available SFO resources.An essential aspect of constructing SFO-KG is the extraction of Chinese entity relations.Unfortunately,there is currently no publicly available Chinese SFO entity Relation Extraction(RE)dataset.Moreover,publicly available SFO text data contain numerous NA(representing for“No Answer”)relation category sentences that resemble other relation sentences and pose challenges in accurate classification,resulting in low recall and precision for the NA relation category in entity RE.Consequently,this issue adversely affects both the accuracy of constructing the knowledge graph and the efficiency of RE processes.To address these challenges,this paper proposes a method for extracting Chinese SFO text entity relations based on dynamic integrated learning.This method includes the construction of a manually annotated Chinese SFO entity RE dataset and a classifier combining features of SFO resource data.The proposed approach combines integrated learning and pre-training models,specifically utilizing Bidirectional Encoder Representation from Transformers(BERT).In addition,it incorporates one-class classification,attention mechanisms,and dynamic feedback mechanisms to improve the performance of the RE model.Experimental results show that the proposed method outperforms the traditional methods in terms of F1 value when extracting entity relations from both balanced and long-tailed datasets.展开更多
An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the as...An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.展开更多
Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy cl...Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy clustering techniques,such as Fuzzy C-Means(FCM),face significant challenges in handling uncertainty and the dependencies between different views.To overcome these limitations,we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data,aiming to enhance clustering accuracy and robustness,termed Multi-view Picture Fuzzy Clustering(MPFC).In particular,the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels:membership degrees,neutral degrees,and refusal degrees.This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models.Meanwhile,dual-anchor graphs exploit the similarity relationships between data points and integrate information across views.This combination improves stability,scalability,and robustness when handling noisy and heterogeneous data.Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency,outperforming traditional methods.Specifically,the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets,attaining a Purity(PUR)score of 0.6440 and an Accuracy(ACC)score of 0.6213 for the 3 Sources dataset,underscoring its robustness and efficiency.The proposed approach significantly contributes to fields such as pattern recognition,multi-view relational data analysis,and large-scale clustering problems.Future work will focus on extending the method for semi-supervised multi-view clustering,aiming to enhance adaptability,scalability,and performance in real-world applications.展开更多
Collecting amounts of distorted/clean image pairs in the real world is non-trivial,which severely limits the practical application of these supervised learning-based methods to real-world image super-resolution(RealSR...Collecting amounts of distorted/clean image pairs in the real world is non-trivial,which severely limits the practical application of these supervised learning-based methods to real-world image super-resolution(RealSR).Previous works usually address this problem by leveraging unsupervised learning-based technologies to alleviate the dependency on paired training samples.However,these methods typically suffer from unsatisfactory texture synthesis due to the lack of supervision of clean images.To overcome this problem,we are the first to take a close look at the under-explored direction for RealSR,i.e.,few-shot real-world image super-resolution,which aims to tackle the challenging RealSR problem with few-shot distorted/clean image pairs.Under this brand-new scenario,we propose distortion relation guided transfer learning(DRTL)for the few-shot RealSR by transferring the rich restoration knowledge from auxiliary distortions(i.e.,synthetic distortions)to the target RealSR under the guidance of the distortion relation.Concretely,DRTL builds a knowledge graph to capture the distortion relation between auxiliary distortions and target distortion(i.e.,real distortions in RealSR).Based on the distortion relation,DRTL adopts a gradient reweighting strategy to guide the knowledge transfer process between auxiliary distortions and target distortions.In this way,DRTL is able to quickly learn the most relevant knowledge from the synthetic distortions for the target distortion.We instantiate DRTL with two commonly-used transfer learning paradigms,including pretraining and meta-learning pipelines,to realize a distortion relation-aware few-shot RealSR.Extensive experiments on multiple benchmarks and thorough ablation studies demonstrate the effectiveness of our DRTL.展开更多
In the era of exponential growth of digital information,recommender algorithms are vital for helping users navigate vast data to find relevant items.Traditional approaches such as collaborative filtering and contentba...In the era of exponential growth of digital information,recommender algorithms are vital for helping users navigate vast data to find relevant items.Traditional approaches such as collaborative filtering and contentbasedmethods have limitations in capturing complex,multi-faceted relationships in large-scale,sparse datasets.Recent advances in Graph Neural Networks(GNNs)have significantly improved recommendation performance by modeling high-order connection patterns within user-item interaction networks.However,existing GNN-based models like LightGCN and NGCF focus primarily on single-type interactions and often overlook diverse semantic relationships,leading to reduced recommendation diversity and limited generalization.To address these challenges,this paper proposes a dual multi-relational graph neural network recommendation algorithm based on relational interactions.Our approach constructs two complementary graph structures:a User-Item Interaction Graph(UIIG),which explicitly models direct user behaviors such as clicks and purchases,and a Relational Association Graph(RAG),which uncovers latent associations based on user similarities and item attributes.The proposed Dual Multi-relational Graph Neural Network(DMGNN)features two parallel branches that perform multi-layer graph convolutional operations,followed by an adaptive fusion mechanism to effectively integrate information from both graphs.This design enhances the model’s capacity to capture diverse relationship types and complex relational patterns.Extensive experiments conducted on benchmark datasets—including MovieLens-1M,Amazon-Electronics,and Yelp—demonstrate thatDMGNN outperforms state-of-the-art baselines,achieving improvements of up to 12.3%in Precision,9.7%in Recall,and 11.5%in F1 score.Moreover,DMGNN significantly boosts recommendation diversity by 15.2%,balancing accuracy with exploration.These results highlight the effectiveness of leveraging hierarchical multi-relational information,offering a promising solution to the challenges of data sparsity and relation heterogeneity in recommendation systems.Our work advances the theoretical understanding of multi-relational graph modeling and presents practical insights for developing more personalized,diverse,and robust recommender systems.展开更多
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.展开更多
The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes de...The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.展开更多
Cross-document relation extraction(RE),as an extension of information extraction,requires integrating information from multiple documents retrieved from open domains with a large number of irrelevant or confusing nois...Cross-document relation extraction(RE),as an extension of information extraction,requires integrating information from multiple documents retrieved from open domains with a large number of irrelevant or confusing noisy texts.Previous studies focus on the attention mechanism to construct the connection between different text features through semantic similarity.However,similarity-based methods cannot distinguish valid information from highly similar retrieved documents well.How to design an effective algorithm to implement aggregated reasoning in confusing information with similar features still remains an open issue.To address this problem,we design a novel local-toglobal causal reasoning(LGCR)network for cross-document RE,which enables efficient distinguishing,filtering and global reasoning on complex information from a causal perspective.Specifically,we propose a local causal estimation algorithm to estimate the causal effect,which is the first trial to use the causal reasoning independent of feature similarity to distinguish between confusing and valid information in cross-document RE.Furthermore,based on the causal effect,we propose a causality guided global reasoning algorithm to filter the confusing information and achieve global reasoning.Experimental results under the closed and the open settings of the large-scale dataset Cod RED demonstrate our LGCR network significantly outperforms the state-ofthe-art methods and validate the effectiveness of causal reasoning in confusing information processing.展开更多
Event relation extraction plays a crucial role in constructing an event knowledge graph.However,current models only extract trigger words as event ontology representations,and do not consider node type during informat...Event relation extraction plays a crucial role in constructing an event knowledge graph.However,current models only extract trigger words as event ontology representations,and do not consider node type during information aggregation,resulting in low accuracy in event relation extraction.To address these challenges,we propose an event relation extraction model based on heterogeneous graph attention networks and event ontology direction induction.To enhance the completeness of event information,we incorporate argument role information,in addition to trigger words,into the input text.A novel heterogeneous graph attention framework is proposed to reasonably allocate weights to trigger words,argument roles,and text information,and then perform two levels of aggregation,node-level and semantic-level,in sequence.To improve the accuracy of event direction discrimination,we construct an event ontology subgraph that includes trigger words and arguments to aggregate complete event structure information during direction induction.Finally,we evaluate our model on three datasets,TimeBank-Dense,MATRES,and HiEve,and demonstrate that our model outperforms state-of-the-art models by 1.2%,0.5%,and 0.8%,respectively,in terms of the Micro-F1 score.Our proposed model provides a promising solution for event relation extraction and can be applied in various natural language processing applications.展开更多
We exhibit the monogamy relation between two entropic non-contextuality inequalities in the scenario where compatible projectors are orthogonal. We show the monogamy relation can be exhibited by decomposing the orthog...We exhibit the monogamy relation between two entropic non-contextuality inequalities in the scenario where compatible projectors are orthogonal. We show the monogamy relation can be exhibited by decomposing the orthogonality graph into perfect induced subgraphs. Then we find two entropic non-contextuality inequalities are monogamous while the KCBS-type non-contextuality inequalities are not if the orthogonality graphs of the observable sets are two odd cycles with two shared vertices.展开更多
A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translat...A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translate problem texts into math expressions,which lack quantity relation acquisition in sophisticated scenarios.To address the problem,the proposed method leverages EDG to represent quantity relations hidden in qualia roles of math objects.Algorithms were designed for EDG generation and quantity relation extraction for solving algebra story problems.Experimental result shows that the proposedmethod achieved an average accuracy of 82.2%on quantity relation extraction compared to 74.5%of baseline method.Another prompt learning result shows a 5%increase obtained in problem solving by injecting the extracted quantity relations into the baseline neural solvers.展开更多
The concept of matching energy was proposed by Gutman and Wagner firstly in 2012. Let G be a simple graph of order n and λ1, λ2, . . . , λn be the zeros of its matching polynomial. The matching energy of a graph G ...The concept of matching energy was proposed by Gutman and Wagner firstly in 2012. Let G be a simple graph of order n and λ1, λ2, . . . , λn be the zeros of its matching polynomial. The matching energy of a graph G is defined as ME(G) = Pni=1 |λi|. By the famous Coulson’s formula, matching energies can also be calculated by an improper integral depending on a parameter. A k-claw attaching graph Gu(k) refers to the graph obtained by attaching k pendent edges to the graph G at the vertex u, where u is called the root of Gu(k). In this paper, we use some theories of mathematical analysis to obtain a new technique to compare the matching energies of two k-claw attaching graphs Gu(k) and Hv(k) with the same order, that is, limk→∞[ME(Gu(k)) − ME(Hv(k))] = ME(G − u) − ME(H − v). By the technique, we finally determine unicyclic graphs of order n with the 9th to 13th minimal matching energies for all n ≥ 58.展开更多
In the domain of knowledge graph embedding,conventional approaches typically transform entities and relations into continuous vector spaces.However,parameter efficiency becomes increasingly crucial when dealing with l...In the domain of knowledge graph embedding,conventional approaches typically transform entities and relations into continuous vector spaces.However,parameter efficiency becomes increasingly crucial when dealing with large-scale knowledge graphs that contain vast numbers of entities and relations.In particular,resource-intensive embeddings often lead to increased computational costs,and may limit scalability and adaptability in practical environ-ments,such as in low-resource settings or real-world applications.This paper explores an approach to knowledge graph representation learning that leverages small,reserved entities and relation sets for parameter-efficient embedding.We introduce a hierarchical attention network designed to refine and maximize the representational quality of embeddings by selectively focusing on these reserved sets,thereby reducing model complexity.Empirical assessments validate that our model achieves high performance on the benchmark dataset with fewer parameters and smaller embedding dimensions.The ablation studies further highlight the impact and contribution of each component in the proposed hierarchical attention structure.展开更多
文摘A constrained partial permutation strategy is proposed for matching spatial relation graph (SRG), which is used in our sketch input and recognition system Smart Sketchpad for representing the spatial relationship among the components of a graphic object. Using two kinds of matching constraints dynamically generated in the matching process, the proposed approach can prune most improper mappings between SRGs during the matching process. According to our theoretical analysis in this paper, the time complexity of our approach is O(n 2) in the best case, and O(n!) in the worst case, which occurs infrequently. The spatial complexity is always O(n) for all cases. Implemented in Smart Sketchpad, our proposed strategy is of good performance.
文摘Given the scarcity of Satellite Frequency and Orbit(SFO)resources,it holds paramount importance to establish a comprehensive knowledge graph of SFO field(SFO-KG)and employ knowledge reasoning technology to automatically mine available SFO resources.An essential aspect of constructing SFO-KG is the extraction of Chinese entity relations.Unfortunately,there is currently no publicly available Chinese SFO entity Relation Extraction(RE)dataset.Moreover,publicly available SFO text data contain numerous NA(representing for“No Answer”)relation category sentences that resemble other relation sentences and pose challenges in accurate classification,resulting in low recall and precision for the NA relation category in entity RE.Consequently,this issue adversely affects both the accuracy of constructing the knowledge graph and the efficiency of RE processes.To address these challenges,this paper proposes a method for extracting Chinese SFO text entity relations based on dynamic integrated learning.This method includes the construction of a manually annotated Chinese SFO entity RE dataset and a classifier combining features of SFO resource data.The proposed approach combines integrated learning and pre-training models,specifically utilizing Bidirectional Encoder Representation from Transformers(BERT).In addition,it incorporates one-class classification,attention mechanisms,and dynamic feedback mechanisms to improve the performance of the RE model.Experimental results show that the proposed method outperforms the traditional methods in terms of F1 value when extracting entity relations from both balanced and long-tailed datasets.
基金This project is supported by National Natural Science Foundation of China(No.59990470,No.59725514,No.59985004)and Robotics Laboratory,Chinese Academy of Sciences Foundation(No.RL200006)
文摘An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.
基金funded by the Research Project:THTETN.05/24-25,VietnamAcademy of Science and Technology.
文摘Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy clustering techniques,such as Fuzzy C-Means(FCM),face significant challenges in handling uncertainty and the dependencies between different views.To overcome these limitations,we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data,aiming to enhance clustering accuracy and robustness,termed Multi-view Picture Fuzzy Clustering(MPFC).In particular,the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels:membership degrees,neutral degrees,and refusal degrees.This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models.Meanwhile,dual-anchor graphs exploit the similarity relationships between data points and integrate information across views.This combination improves stability,scalability,and robustness when handling noisy and heterogeneous data.Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency,outperforming traditional methods.Specifically,the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets,attaining a Purity(PUR)score of 0.6440 and an Accuracy(ACC)score of 0.6213 for the 3 Sources dataset,underscoring its robustness and efficiency.The proposed approach significantly contributes to fields such as pattern recognition,multi-view relational data analysis,and large-scale clustering problems.Future work will focus on extending the method for semi-supervised multi-view clustering,aiming to enhance adaptability,scalability,and performance in real-world applications.
基金supported by the National Natural Science Foundation of China(623B2098,62021001,62371434)the Postdoctoral Fellowship Program of CPSF(GZC20252293)+1 种基金the China Postdoctoral Science Foundation–Anhui Joint Support Program(2024T017AH)Anhui Postdoctoral Scientific Research Program Foundation(2025A1015).
文摘Collecting amounts of distorted/clean image pairs in the real world is non-trivial,which severely limits the practical application of these supervised learning-based methods to real-world image super-resolution(RealSR).Previous works usually address this problem by leveraging unsupervised learning-based technologies to alleviate the dependency on paired training samples.However,these methods typically suffer from unsatisfactory texture synthesis due to the lack of supervision of clean images.To overcome this problem,we are the first to take a close look at the under-explored direction for RealSR,i.e.,few-shot real-world image super-resolution,which aims to tackle the challenging RealSR problem with few-shot distorted/clean image pairs.Under this brand-new scenario,we propose distortion relation guided transfer learning(DRTL)for the few-shot RealSR by transferring the rich restoration knowledge from auxiliary distortions(i.e.,synthetic distortions)to the target RealSR under the guidance of the distortion relation.Concretely,DRTL builds a knowledge graph to capture the distortion relation between auxiliary distortions and target distortion(i.e.,real distortions in RealSR).Based on the distortion relation,DRTL adopts a gradient reweighting strategy to guide the knowledge transfer process between auxiliary distortions and target distortions.In this way,DRTL is able to quickly learn the most relevant knowledge from the synthetic distortions for the target distortion.We instantiate DRTL with two commonly-used transfer learning paradigms,including pretraining and meta-learning pipelines,to realize a distortion relation-aware few-shot RealSR.Extensive experiments on multiple benchmarks and thorough ablation studies demonstrate the effectiveness of our DRTL.
文摘In the era of exponential growth of digital information,recommender algorithms are vital for helping users navigate vast data to find relevant items.Traditional approaches such as collaborative filtering and contentbasedmethods have limitations in capturing complex,multi-faceted relationships in large-scale,sparse datasets.Recent advances in Graph Neural Networks(GNNs)have significantly improved recommendation performance by modeling high-order connection patterns within user-item interaction networks.However,existing GNN-based models like LightGCN and NGCF focus primarily on single-type interactions and often overlook diverse semantic relationships,leading to reduced recommendation diversity and limited generalization.To address these challenges,this paper proposes a dual multi-relational graph neural network recommendation algorithm based on relational interactions.Our approach constructs two complementary graph structures:a User-Item Interaction Graph(UIIG),which explicitly models direct user behaviors such as clicks and purchases,and a Relational Association Graph(RAG),which uncovers latent associations based on user similarities and item attributes.The proposed Dual Multi-relational Graph Neural Network(DMGNN)features two parallel branches that perform multi-layer graph convolutional operations,followed by an adaptive fusion mechanism to effectively integrate information from both graphs.This design enhances the model’s capacity to capture diverse relationship types and complex relational patterns.Extensive experiments conducted on benchmark datasets—including MovieLens-1M,Amazon-Electronics,and Yelp—demonstrate thatDMGNN outperforms state-of-the-art baselines,achieving improvements of up to 12.3%in Precision,9.7%in Recall,and 11.5%in F1 score.Moreover,DMGNN significantly boosts recommendation diversity by 15.2%,balancing accuracy with exploration.These results highlight the effectiveness of leveraging hierarchical multi-relational information,offering a promising solution to the challenges of data sparsity and relation heterogeneity in recommendation systems.Our work advances the theoretical understanding of multi-relational graph modeling and presents practical insights for developing more personalized,diverse,and robust recommender systems.
文摘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 Technology Projects of Guizhou Province under Grant[2024]003National Natural Science Foundation of China(GrantNos.62166007,62066008,62066007)Guizhou Provincial Science and Technology Projects under Grant No.ZK[2023]300.
文摘The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.
基金supported in part by the National Key Research and Development Program of China(2022ZD0116405)the Strategic Priority Research Program of the Chinese Academy of Sciences(XDA27030300)the Key Research Program of the Chinese Academy of Sciences(ZDBS-SSW-JSC006)。
文摘Cross-document relation extraction(RE),as an extension of information extraction,requires integrating information from multiple documents retrieved from open domains with a large number of irrelevant or confusing noisy texts.Previous studies focus on the attention mechanism to construct the connection between different text features through semantic similarity.However,similarity-based methods cannot distinguish valid information from highly similar retrieved documents well.How to design an effective algorithm to implement aggregated reasoning in confusing information with similar features still remains an open issue.To address this problem,we design a novel local-toglobal causal reasoning(LGCR)network for cross-document RE,which enables efficient distinguishing,filtering and global reasoning on complex information from a causal perspective.Specifically,we propose a local causal estimation algorithm to estimate the causal effect,which is the first trial to use the causal reasoning independent of feature similarity to distinguish between confusing and valid information in cross-document RE.Furthermore,based on the causal effect,we propose a causality guided global reasoning algorithm to filter the confusing information and achieve global reasoning.Experimental results under the closed and the open settings of the large-scale dataset Cod RED demonstrate our LGCR network significantly outperforms the state-ofthe-art methods and validate the effectiveness of causal reasoning in confusing information processing.
基金supported by the National Natural Science Foundation of China(No.62071240)the Innovation Program for Quantum Science and Technology(No.2021ZD0302901)+1 种基金the Natural Science Foundation of Jiangsu Province(Nos.BK20220804 and BK20231142)the Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions.
文摘Event relation extraction plays a crucial role in constructing an event knowledge graph.However,current models only extract trigger words as event ontology representations,and do not consider node type during information aggregation,resulting in low accuracy in event relation extraction.To address these challenges,we propose an event relation extraction model based on heterogeneous graph attention networks and event ontology direction induction.To enhance the completeness of event information,we incorporate argument role information,in addition to trigger words,into the input text.A novel heterogeneous graph attention framework is proposed to reasonably allocate weights to trigger words,argument roles,and text information,and then perform two levels of aggregation,node-level and semantic-level,in sequence.To improve the accuracy of event direction discrimination,we construct an event ontology subgraph that includes trigger words and arguments to aggregate complete event structure information during direction induction.Finally,we evaluate our model on three datasets,TimeBank-Dense,MATRES,and HiEve,and demonstrate that our model outperforms state-of-the-art models by 1.2%,0.5%,and 0.8%,respectively,in terms of the Micro-F1 score.Our proposed model provides a promising solution for event relation extraction and can be applied in various natural language processing applications.
基金Supported by 973 Programs of China under Grant Nos.2011CBA00303 and 2013CB328700Basic Research Foundation of Tsinghua National Laboratory for Information Science and Technology(TNList)
文摘We exhibit the monogamy relation between two entropic non-contextuality inequalities in the scenario where compatible projectors are orthogonal. We show the monogamy relation can be exhibited by decomposing the orthogonality graph into perfect induced subgraphs. Then we find two entropic non-contextuality inequalities are monogamous while the KCBS-type non-contextuality inequalities are not if the orthogonality graphs of the observable sets are two odd cycles with two shared vertices.
基金supported by the National Natural Science Foundation of China (Nos.62177024,62007014)the Humanities and Social Sciences Youth Fund of the Ministry of Education (No.20YJC880024)+1 种基金China Post Doctoral Science Foundation (No.2019M652678)the Fundamental Research Funds for the Central Universities (No.CCNU20ZT019).
文摘A qualia role-based entity-dependency graph(EDG)is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese.Traditional neural solvers use end-to-end models to translate problem texts into math expressions,which lack quantity relation acquisition in sophisticated scenarios.To address the problem,the proposed method leverages EDG to represent quantity relations hidden in qualia roles of math objects.Algorithms were designed for EDG generation and quantity relation extraction for solving algebra story problems.Experimental result shows that the proposedmethod achieved an average accuracy of 82.2%on quantity relation extraction compared to 74.5%of baseline method.Another prompt learning result shows a 5%increase obtained in problem solving by injecting the extracted quantity relations into the baseline neural solvers.
基金Supported by the National Natural Science Foundation of China(Nos.12271439,11871398)the National College Students Innovation and Entrepreneurship Training Program(No.201910699173)。
文摘The concept of matching energy was proposed by Gutman and Wagner firstly in 2012. Let G be a simple graph of order n and λ1, λ2, . . . , λn be the zeros of its matching polynomial. The matching energy of a graph G is defined as ME(G) = Pni=1 |λi|. By the famous Coulson’s formula, matching energies can also be calculated by an improper integral depending on a parameter. A k-claw attaching graph Gu(k) refers to the graph obtained by attaching k pendent edges to the graph G at the vertex u, where u is called the root of Gu(k). In this paper, we use some theories of mathematical analysis to obtain a new technique to compare the matching energies of two k-claw attaching graphs Gu(k) and Hv(k) with the same order, that is, limk→∞[ME(Gu(k)) − ME(Hv(k))] = ME(G − u) − ME(H − v). By the technique, we finally determine unicyclic graphs of order n with the 9th to 13th minimal matching energies for all n ≥ 58.
基金supported by the National Science and Technology Council(NSTC),Taiwan,under Grants Numbers 112-2622-E-029-009 and 112-2221-E-029-019.
文摘In the domain of knowledge graph embedding,conventional approaches typically transform entities and relations into continuous vector spaces.However,parameter efficiency becomes increasingly crucial when dealing with large-scale knowledge graphs that contain vast numbers of entities and relations.In particular,resource-intensive embeddings often lead to increased computational costs,and may limit scalability and adaptability in practical environ-ments,such as in low-resource settings or real-world applications.This paper explores an approach to knowledge graph representation learning that leverages small,reserved entities and relation sets for parameter-efficient embedding.We introduce a hierarchical attention network designed to refine and maximize the representational quality of embeddings by selectively focusing on these reserved sets,thereby reducing model complexity.Empirical assessments validate that our model achieves high performance on the benchmark dataset with fewer parameters and smaller embedding dimensions.The ablation studies further highlight the impact and contribution of each component in the proposed hierarchical attention structure.
