Long Text Relationship Extraction Method for Complex Productse

Huaijun Wang, Hangbo Quan, Junhuai Li, Miaomiao Chen, Jiang Xu
{"title":"Long Text Relationship Extraction Method for Complex Productse","authors":"Huaijun Wang, Hangbo Quan, Junhuai Li, Miaomiao Chen, Jiang Xu","doi":"10.1145/3603781.3603920","DOIUrl":null,"url":null,"abstract":"In the data management of complex products, relationship extraction of related texts can assist in constructing product data chains. This can realize the integration and fusion of data chains through nodes with relationships between different data chains. However, due to the complexity of complex products in terms of customer requirements, product technology, and manufacturing process, many related text data contain a large number of complex sentences, and a large amount of referential information is often lost in the relationship extraction of long text in these complex sentences, resulting in poor relationship extraction results. In this paper, we propose a long-text relationship extraction method for complex products, using a pre-trained language model to encode semantic information and obtain input text word vectors, then using a Gaussian graph generator (GGG) to construct potentially directed multi-views, learning graph features more deeply with the help of densely connected graph convolutional networks, and using dynamic time-regularized pooling operations to extract more relationship-dependent indicative words to assist the relationship. The extraction task is completed by combining the graph feature learning results with semantic information embedding representation for relationship extraction. Experiments are conducted on the DialogRE dataset, and the experimental results show that the F1 values reach 66.1% and 63.3% on the validation and test sets, respectively, and the F1 values still exceed 65% when the number of text words exceeds 400, which verifies the feasibility and effectiveness of the proposed method.","PeriodicalId":391180,"journal":{"name":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 4th International Conference on Computing, Networks and Internet of Things","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3603781.3603920","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the data management of complex products, relationship extraction of related texts can assist in constructing product data chains. This can realize the integration and fusion of data chains through nodes with relationships between different data chains. However, due to the complexity of complex products in terms of customer requirements, product technology, and manufacturing process, many related text data contain a large number of complex sentences, and a large amount of referential information is often lost in the relationship extraction of long text in these complex sentences, resulting in poor relationship extraction results. In this paper, we propose a long-text relationship extraction method for complex products, using a pre-trained language model to encode semantic information and obtain input text word vectors, then using a Gaussian graph generator (GGG) to construct potentially directed multi-views, learning graph features more deeply with the help of densely connected graph convolutional networks, and using dynamic time-regularized pooling operations to extract more relationship-dependent indicative words to assist the relationship. The extraction task is completed by combining the graph feature learning results with semantic information embedding representation for relationship extraction. Experiments are conducted on the DialogRE dataset, and the experimental results show that the F1 values reach 66.1% and 63.3% on the validation and test sets, respectively, and the F1 values still exceed 65% when the number of text words exceeds 400, which verifies the feasibility and effectiveness of the proposed method.
复杂产品的长文本关系提取方法
在复杂产品的数据管理中,相关文本的关系提取有助于构建产品数据链。这可以通过具有不同数据链之间关系的节点来实现数据链的集成和融合。然而,由于复杂产品在客户需求、产品技术、制造工艺等方面的复杂性,许多相关的文本数据中包含大量的复句,在对这些复句中的长文本进行关系提取时,往往会丢失大量的参考信息,导致关系提取效果不佳。本文提出了一种复杂产品的长文本关系提取方法,使用预训练的语言模型对语义信息进行编码,获得输入文本词向量,然后使用高斯图生成器(GGG)构建潜在有向的多视图,借助密集连接的图卷积网络更深入地学习图特征。并使用动态时间正则化池化操作提取更多关系依赖的指示词来辅助关系。将图特征学习结果与语义信息嵌入表示相结合,完成关系提取任务。在dialgre数据集上进行实验,实验结果表明,在验证集和测试集上,F1值分别达到66.1%和63.3%,当文本字数超过400时,F1值仍然超过65%,验证了所提出方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信