A Four-Feature Keyword Extraction Algorithm Based on Word Length Priority ratio

Hui Kang, Lingfeng Lu, H. Su
{"title":"A Four-Feature Keyword Extraction Algorithm Based on Word Length Priority ratio","authors":"Hui Kang, Lingfeng Lu, H. Su","doi":"10.1109/TrustCom50675.2020.00203","DOIUrl":null,"url":null,"abstract":"With the rapid development of Internet technology and the advent of the information age, it has become a research hotspot to obtain key information from numerous data. Due to the diversity and irregularity of network data, it is difficult for people to find the literature they want, especially knowledge scholars working in the frontier field of science and technology, who have higher requirements on the accuracy and efficiency of literature keyword extraction than ordinary people. The feature values selected by the current keyword extraction algorithm are usually limited to word frequency and word length, which is incomplete and affects the accuracy of the algorithm. Given this phenomenon, this paper, by comparing with TF-IDF and KEA algorithm, define the concept of word length priority ratio, and applies this concept to the calculation of word length-weight, proposes a four-feature keyword extraction algorithm (WPR-TOC algorithm) based on word frequency, word length, word position and the degree of association between words. Through experiments, compared with the KEA algorithm, KEA++ algorithm, and four features extraction algorithm, the precision of the WPR-TOC algorithm is improved by 40%, 30%, and 10% respectively, and the recall rate is also increased by 40%, 30%, and 10% respectively.","PeriodicalId":221956,"journal":{"name":"2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom50675.2020.00203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of Internet technology and the advent of the information age, it has become a research hotspot to obtain key information from numerous data. Due to the diversity and irregularity of network data, it is difficult for people to find the literature they want, especially knowledge scholars working in the frontier field of science and technology, who have higher requirements on the accuracy and efficiency of literature keyword extraction than ordinary people. The feature values selected by the current keyword extraction algorithm are usually limited to word frequency and word length, which is incomplete and affects the accuracy of the algorithm. Given this phenomenon, this paper, by comparing with TF-IDF and KEA algorithm, define the concept of word length priority ratio, and applies this concept to the calculation of word length-weight, proposes a four-feature keyword extraction algorithm (WPR-TOC algorithm) based on word frequency, word length, word position and the degree of association between words. Through experiments, compared with the KEA algorithm, KEA++ algorithm, and four features extraction algorithm, the precision of the WPR-TOC algorithm is improved by 40%, 30%, and 10% respectively, and the recall rate is also increased by 40%, 30%, and 10% respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于字长优先比的四特征关键词提取算法
随着互联网技术的飞速发展和信息时代的到来,如何从海量数据中获取关键信息已成为研究热点。由于网络数据的多样性和不规则性,人们很难找到自己想要的文献,特别是在科技前沿领域工作的知识学者,他们对文献关键词提取的准确性和效率的要求比普通人更高。目前的关键词提取算法所选择的特征值通常仅限于词频和词长,这是不完整的,影响了算法的准确性。针对这一现象,本文通过与TF-IDF和KEA算法的比较,定义了词长优先比的概念,并将这一概念应用到词长权重的计算中,提出了一种基于词频、词长、词位置和词间关联度的四特征关键词提取算法(WPR-TOC算法)。通过实验,与KEA算法、kea++算法和四种特征提取算法相比,WPR-TOC算法的准确率分别提高了40%、30%和10%,召回率也分别提高了40%、30%和10%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Stitching and Alignment of Mouse Carcass EM Images One Covert Channel to Rule Them All: A Practical Approach to Data Exfiltration in the Cloud MAUSPAD: Mouse-based Authentication Using Segmentation-based, Progress-Adjusted DTW Finding Geometric Medians with Location Privacy Multi-Input Functional Encryption: Efficient Applications from Symmetric Primitives
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1