利用维基百科提取短文本关键词的TextRank算法

Wengen Li, Jiabao Zhao
{"title":"利用维基百科提取短文本关键词的TextRank算法","authors":"Wengen Li, Jiabao Zhao","doi":"10.1109/ICISCE.2016.151","DOIUrl":null,"url":null,"abstract":"The characteristic of poor information of short text often makes the effect of traditional keywords extraction not as good as expected. In this paper, we propose a graph-based ranking algorithm by exploiting Wikipedia as an external knowledge base for short text keywords extraction. To overcome the shortcoming of poor information of short text, we introduce the Wikipedia to enrich the short text. We regard each entry of Wikipedia as a concept, therefore the semantic information of each word can be represented by the distribution of Wikipedia's concept. And we measure the similarity between words by constructing the concept vector. Finally we construct keywords matrix and use TextRank for keywords extraction. The comparative experiments with traditional TextRank and baseline algorithm show that our method gets better precision, recall and F-measure value. It is shown that TextRank by exploiting Wikipedia is more suitable for short text keywords extraction.","PeriodicalId":6882,"journal":{"name":"2016 3rd International Conference on Information Science and Control Engineering (ICISCE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"TextRank Algorithm by Exploiting Wikipedia for Short Text Keywords Extraction\",\"authors\":\"Wengen Li, Jiabao Zhao\",\"doi\":\"10.1109/ICISCE.2016.151\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The characteristic of poor information of short text often makes the effect of traditional keywords extraction not as good as expected. In this paper, we propose a graph-based ranking algorithm by exploiting Wikipedia as an external knowledge base for short text keywords extraction. To overcome the shortcoming of poor information of short text, we introduce the Wikipedia to enrich the short text. We regard each entry of Wikipedia as a concept, therefore the semantic information of each word can be represented by the distribution of Wikipedia's concept. And we measure the similarity between words by constructing the concept vector. Finally we construct keywords matrix and use TextRank for keywords extraction. The comparative experiments with traditional TextRank and baseline algorithm show that our method gets better precision, recall and F-measure value. It is shown that TextRank by exploiting Wikipedia is more suitable for short text keywords extraction.\",\"PeriodicalId\":6882,\"journal\":{\"name\":\"2016 3rd International Conference on Information Science and Control Engineering (ICISCE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 3rd International Conference on Information Science and Control Engineering (ICISCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISCE.2016.151\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd International Conference on Information Science and Control Engineering (ICISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCE.2016.151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

摘要

摘要短文本信息贫乏的特点,往往使得传统的关键词提取效果不如预期。在本文中,我们提出了一种基于图的排序算法,利用维基百科作为一个外部知识库来提取短文本关键词。为了克服短文本信息贫乏的缺点,我们引入了维基百科来丰富短文本。我们把维基百科的每一个词条看作一个概念,因此每个词的语义信息可以用维基百科概念的分布来表示。我们通过构造概念向量来度量词之间的相似度。最后构造关键字矩阵,并使用TextRank进行关键字提取。与传统的TextRank算法和基线算法的对比实验表明,该方法具有更好的查全率、查全率和f测量值。结果表明,利用维基百科的TextRank更适合短文本关键词提取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
TextRank Algorithm by Exploiting Wikipedia for Short Text Keywords Extraction
The characteristic of poor information of short text often makes the effect of traditional keywords extraction not as good as expected. In this paper, we propose a graph-based ranking algorithm by exploiting Wikipedia as an external knowledge base for short text keywords extraction. To overcome the shortcoming of poor information of short text, we introduce the Wikipedia to enrich the short text. We regard each entry of Wikipedia as a concept, therefore the semantic information of each word can be represented by the distribution of Wikipedia's concept. And we measure the similarity between words by constructing the concept vector. Finally we construct keywords matrix and use TextRank for keywords extraction. The comparative experiments with traditional TextRank and baseline algorithm show that our method gets better precision, recall and F-measure value. It is shown that TextRank by exploiting Wikipedia is more suitable for short text keywords extraction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Method for Color Calibration Based on Simulated Annealing Optimization Temperature Analysis in the Fused Deposition Modeling Process Classification of Hyperspectral Image Based on K-Means and Structured Sparse Coding Analysis and Prediction of Epilepsy Based on Visibility Graph Design of Control System for a Rehabilitation Device for Joints of Lower Limbs
×
引用
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