Graph Convolutional Networks Embedding Textual Structure Information for Relation Extraction

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.

India's Major Concerns about China and the Future of China-India Relations

Since 2014, the development of the China-India relationship has followed a trend of starting high and ending low. The China-India relationship warmed up rapidly in the first two years, which nevertheless failed to bring about a substantial breakthrough in their bilateral relations, as India's strategic doubts about China and their differences of interests on numerous issues still pose difficulties.

INTEGRATED APPROACH TO GENERATION OF PRECEDENCE RELATIONS AND PRECEDENCE GRAPHS FOR ASSEMBLY SEQUENCE PLANNING

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.

Local-to-Global Causal Reasoning for Cross-Document Relation Extraction

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.

Qualia Role-Based Quantity Relation Extraction for Solving Algebra Story Problems

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.

Identifying pain-related concerns in routine follow-up clinics following oral and oropharyngeal cancer

AIM:To describe clinical characteristics of head and neck cancer(HNC)patients with pain and those wishing to discuss pain concerns during consultation.METHODS:Cross-sectional,questionnaire study using University of Washington Quality of Life,version 4(UWQOL)and the Patients Concerns Inventory(PCI)in disease-free,post-treatment HNC cohort.Significant pain on UW-QOL and indicating"Pain in head and neck"and"Pain elsewhere"on PCI.RESULTS:One hundred and seventy-seven patientscompleted UW-QOL and PCI.The prevalence of selfreported pain issues was 38%(67/177)comprising25%(44/177)with significant problems despite medications and 13%(23/177)with lesser or no problems but wishing to discuss pain.Patients aged under 65years and patients having treatment involving radiotherapy were more likely to have pain issues.Just over half,55%(24/44)of patients with significant pain did not express a need to discuss this.Those with significant pain or others wanting to discuss pain in clinic had greater problems in physical and social-emotional functioning,reported suboptimal QOL,and also had more additional PCI items to discuss in clinic compared to those without significant pain and not wishing to discuss pain.CONCLUSION:Significant HNC-related pain is prevalent in the disease-free,posttreatment cohort.Onward referral to a specialist pain team may be beneficial.The UW-QOL and PCI package is a valuable tool that may routinely screen for significant pain in outpatient clinics.

How to implement a knowledge graph completeness assessment with the guidance of user requirements

In the context of big data, many large-scale knowledge graphs have emerged to effectively organize the explosive growth of web data on the Internet. To select suitable knowledge graphs for use from many knowledge graphs, quality assessment is particularly important. As an important thing of quality assessment, completeness assessment generally refers to the ratio of the current data volume to the total data volume.When evaluating the completeness of a knowledge graph, it is often necessary to refine the completeness dimension by setting different completeness metrics to produce more complete and understandable evaluation results for the knowledge graph.However, lack of awareness of requirements is the most problematic quality issue. In the actual evaluation process, the existing completeness metrics need to consider the actual application. Therefore, to accurately recommend suitable knowledge graphs to many users, it is particularly important to develop relevant measurement metrics and formulate measurement schemes for completeness. In this paper, we will first clarify the concept of completeness, establish each metric of completeness, and finally design a measurement proposal for the completeness of knowledge graphs.

Combining Deep Learning with Knowledge Graph for Design Knowledge Acquisition in Conceptual Product Design

The acquisition of valuable design knowledge from massive fragmentary data is challenging for designers in conceptual product design.This study proposes a novel method for acquiring design knowledge by combining deep learning with knowledge graph.Specifically,the design knowledge acquisition method utilises the knowledge extraction model to extract design-related entities and relations from fragmentary data,and further constructs the knowledge graph to support design knowledge acquisition for conceptual product design.Moreover,the knowledge extraction model introduces ALBERT to solve memory limitation and communication overhead in the entity extraction module,and uses multi-granularity information to overcome segmentation errors and polysemy ambiguity in the relation extraction module.Experimental comparison verified the effectiveness and accuracy of the proposed knowledge extraction model.The case study demonstrated the feasibility of the knowledge graph construction with real fragmentary porcelain data and showed the capability to provide designers with interconnected and visualised design knowledge.

A Survey of Knowledge Graph Construction Using Machine Learning

Knowledge graph(KG)serves as a specialized semantic network that encapsulates intricate relationships among real-world entities within a structured framework.This framework facilitates a transformation in information retrieval,transitioning it from mere string matching to far more sophisticated entity matching.In this transformative process,the advancement of artificial intelligence and intelligent information services is invigorated.Meanwhile,the role ofmachine learningmethod in the construction of KG is important,and these techniques have already achieved initial success.This article embarks on a comprehensive journey through the last strides in the field of KG via machine learning.With a profound amalgamation of cutting-edge research in machine learning,this article undertakes a systematical exploration of KG construction methods in three distinct phases:entity learning,ontology learning,and knowledge reasoning.Especially,a meticulous dissection of machine learningdriven algorithms is conducted,spotlighting their contributions to critical facets such as entity extraction,relation extraction,entity linking,and link prediction.Moreover,this article also provides an analysis of the unresolved challenges and emerging trajectories that beckon within the expansive application of machine learning-fueled,large-scale KG construction.

IndRT-GCNets: Knowledge Reasoning with Independent Recurrent Temporal Graph Convolutional Representations

Due to the structural dependencies among concurrent events in the knowledge graph and the substantial amount of sequential correlation information carried by temporally adjacent events,we propose an Independent Recurrent Temporal Graph Convolution Networks(IndRT-GCNets)framework to efficiently and accurately capture event attribute information.The framework models the knowledge graph sequences to learn the evolutionary represen-tations of entities and relations within each period.Firstly,by utilizing the temporal graph convolution module in the evolutionary representation unit,the framework captures the structural dependency relationships within the knowledge graph in each period.Meanwhile,to achieve better event representation and establish effective correlations,an independent recurrent neural network is employed to implement auto-regressive modeling.Furthermore,static attributes of entities in the entity-relation events are constrained andmerged using a static graph constraint to obtain optimal entity representations.Finally,the evolution of entity and relation representations is utilized to predict events in the next subsequent step.On multiple real-world datasets such as Freebase13(FB13),Freebase 15k(FB15K),WordNet11(WN11),WordNet18(WN18),FB15K-237,WN18RR,YAGO3-10,and Nell-995,the results of multiple evaluation indicators show that our proposed IndRT-GCNets framework outperforms most existing models on knowledge reasoning tasks,which validates the effectiveness and robustness.

Knowledge enhanced graph inference network based entity-relation extraction and knowledge graph construction for industrial domain

With the escalating complexity in production scenarios, vast amounts of production information are retained within enterprises in the industrial domain. Probing questions of how to meticulously excavate value from complex document information and establish coherent information links arise. In this work, we present a framework for knowledge graph construction in the industrial domain, predicated on knowledge-enhanced document-level entity and relation extraction. This approach alleviates the shortage of annotated data in the industrial domain and models the interplay of industrial documents. To augment the accuracy of named entity recognition, domain-specific knowledge is incorporated into the initialization of the word embedding matrix within the bidirectional long short-term memory conditional random field (BiLSTM-CRF) framework. For relation extraction, this paper introduces the knowledge-enhanced graph inference (KEGI) network, a pioneering method designed for long paragraphs in the industrial domain. This method discerns intricate interactions among entities by constructing a document graph and innovatively integrates knowledge representation into both node construction and path inference through TransR. On the application stratum, BiLSTM-CRF and KEGI are utilized to craft a knowledge graph from a knowledge representation model and Chinese fault reports for a steel production line, specifically SPOnto and SPFRDoc. The F1 value for entity and relation extraction has been enhanced by 2% to 6%. The quality of the extracted knowledge graph complies with the requirements of real-world production environment applications. The results demonstrate that KEGI can profoundly delve into production reports, extracting a wealth of knowledge and patterns, thereby providing a comprehensive solution for production management.

融合Graph state LSTM与注意力机制的跨句多元关系抽取

已有的跨句多元关系抽取工作将输入文本表示为集成句内和句间依赖关系的复杂文档图,但图中包含的噪声信息会影响关系抽取的效果。针对这种情况,该文利用Graph state LSTM获得上下文信息,再分别利用词级注意力机制或位置感知的注意力机制,自动聚焦在对关系抽取起到决定性作用的关键词上,降低噪声信息的影响。并且比较了两种注意力机制对使用Graph state LSTM进行关系抽取的影响。通过在一个重要的精确医学数据集上进行实验,验证了该文所提出模型的有效性。

HYPOTENSIVE EFFECT OF OTOTHERAPY IN RELATION TO SYMPTOMATIC AND DISPOSITIONAL TYPES OF PATIENTS

Ototherapy has been widely adopted inthe treatment of systemic diseases;however,the dependence of therapeutic effect on thetyping of patients according to symptomdifferentiation has not attracted sufficientattention.Further,literature concerning theeffect of psychological factors on thetherapeutic effect and prognosis,and par-

EU’s Security Concerns in Its Economic Cooperation with China

The European Union’s security concerns within current EUChina economic relations have increased significantly,pointing toward increased competitiveness and decreased complementarity.At issue are shared technology,technology transfer,information and network security,the industrial chain,and political anxiety over China’s cooperative agreements with central and eastern European countries.China’s foreign direct investment is also a part of what Europeans fear.The political dynamics of the EU itself and changes in the strategic environment mean that EU policy adjustments are impacting the layout of Chinese investment in Europe but opportunities for future cooperation remain apparent.

融合选择注意力的小样本知识图谱补全模型

在面对实体对关系复杂或目标邻域稀疏等情况时,现有的小样本知识图谱补全模型普遍存在关系表示学习能力不足以及忽略实体对相对位置和交互作用的问题。基于此,提出一种基于选择注意力机制和交互感知的小样本知识图谱补全模型(SAIA)。首先,通过在聚合邻域信息过程中引入选择注意机制,帮助邻域编码器聚焦更重要的邻居以减少噪声邻居的不良影响;其次,在关系表示学习阶段,利用背景知识图谱中与任务关系相关的信息学习更加准确的关系表示;最后,为了挖掘知识图谱实体之间的交互信息和位置信息,设计了一个实体对公共交互率指标(CIR)来衡量实体对三阶路径内的关联程度,然后结合实体语义信息共同预测新的事实。实验结果表明该方法优于目前最先进的小样本知识图谱补全模型。与基准模型最优的结果相比,SAIA在NELL-one和Wiki-one数据集上的5-shot链接预测中,平均倒数排名(MRR)、Hits@10、Hits@5以及Hits@1等性能评价指标分别提高了0.038、0.011、0.028和0.052以及0.034、0.037、0.029和0.027,验证了所提模型的有效性和可行性。

基于异构图和语义融合的实体关系抽取

关系抽取是信息抽取中的一项重要任务,其目的是从非结构化文本中抽取出所有关系三元组。然而,如何有效地处理这一问题仍然是一个挑战,特别是对于关系重叠问题。为了有效处理重叠问题,该文提出一种基于异构图和语义融合的实体关系抽取方法:使用异构图将关系信息作为先验知识融入词表示,增强词表示的表示能力,使得模型能有效地处理单词实体重叠问题;使用语义融合模块将不同层次特征融合在一起作为关系分类模型的输入,使得模型能够有效地处理实体对重叠问题。所提方法在NYT和WebNLG数据集上取得了最好的效果,详细的实验也表明所提方法可以处理复杂的场景。

基于自适应上下文匹配网络的小样本知识图谱补全

知识图谱在构建过程中需要面对繁杂的现实世界信息,无法建模所有知识,因此需要补全。真实的知识图谱中很多类型的关系通常只有少量的训练实体样本对。因此,如何进行小样本知识图谱补全是一个十分有价值的问题。目前基于嵌入的方法一般通过注意力机制等方法聚合实体上下文信息,通过学习关系嵌入的方式来补全知识图谱,仅考虑关系层面的匹配程度,虽然能够预测未知关系,但往往准确度不高。针对小样本知识图谱补全问题,提出了一个自适应上下文匹配网络(Adaptive Context Matching Network,ACMN)。首先提出一个共性邻居感知编码器,聚合参考集实体上下文,即一跳邻居实体,获得共性邻居感知编码;接着提出一个任务相关实体编码器,挖掘任务实体上下文与共性上下文的相似度信息,区分一跳邻居对当前任务的贡献,增强实体表征;然后提出一个上下文关系编码器获得动态关系表征;最后通过加权求和综合考虑实体上下文和关系的匹配程度,完成补全。ACMN从实体上下文相似度和关系匹配程度两个方面综合评价查询三元组是否成立,能够在小样本的背景下有效提高预测准确性。在两个公共数据集上和其他8个广泛使用的算法进行比较,ACMN在不同规模的小样本情况下,取得了目前最好的补全结果。

基于关键词共现分析的国内外未来产业发展重点研究

为梳理筛选未来产业主要领域,为后续研究提供支撑,以CiteSpace等软件作为工具,通过共词关系获得国内外未来产业相关文献图谱,从宏观上得到未来产业概况,结合国外主要发达国家战略政策以及全国31个省(自治区、直辖市)规划、未来产业专项规划等政府文件,梳理未来产业国内外发展的重点和差异,为进一步筛选和研究提供基础。经研究发现,国内外对未来产业的重点关注领域大体相同,主要集中在智能、低碳和健康三大领域,人工智能是重点关注领域;未来产业呈现多学科、多技术的高度交叉和深度融合趋势,技术创新是核心驱动力,生产制造是关键,而资金投入、人才培养和平台建设则是未来产业发展的三大着力点。

融合词法句法信息的方面级情感分析模型

为解决现有方面级情感分析方法缺乏句法约束和词义信息的问题,将句法依存树和知识图谱融合起来对句子编码,提出一种词法句法相结合的图神经网络模型。利用图神经网络分别提取句法依存树中的句法信息和知识图谱中的词法信息,经过位置编码模块和掩码加权模块捕捉重要性更高的单词;将两种特征进行结合获得融合句法词法信息的文本表示,进行情感分类。在3个公开数据集上的实验结果验证了该模型的有效性。

中国专利奖视角下的颠覆性技术识别分析

为充分利用专利结构化数据和文本数据,实现准确有效的颠覆性技术识别,以中国专利奖为切入点,提出基于图神经网络的颠覆性技术识别框架。首先以获得中国专利奖的授权发明专利定义颠覆性技术,解决技术定义难的问题;接着使用Neo4j图数据库构建异质有向图,存储专利多重关系数据和方向信息,解决关系数据利用率低的问题;最后使用关系图卷积神经网络(R-GCN)模型进行训练,实现颠覆性技术识别,解决识别效果不佳的问题。研究表明以获得中国专利奖的专利技术直接定义颠覆性技术是合理且可靠的;提出的颠覆性技术识别框架能充分利用专利数据信息和专利异质有向图中空间信息,识别出绝大部分的颠覆性技术,丰富了图神经网络在颠覆性技术识别方面的研究。