Rank-IDF: A Statistical and Network Based Feature Words Selection in Big Data Text Analysis

S. Long, Li Yan
{"title":"Rank-IDF: A Statistical and Network Based Feature Words Selection in Big Data Text Analysis","authors":"S. Long, Li Yan","doi":"10.1145/3395260.3395291","DOIUrl":null,"url":null,"abstract":"As big data for text has been one of the core data types in the era of artificial intelligence, feature words selection technique become increasingly important in big data text analysis. The traditional statistical TF-IDF feature words selection algorithm lacks the semantic information extraction ability of text, while the network model Textrank applies the sentence semantic features to feature calculation between words. Network model such as Textrank is very suitable for text feature selection, but it does not take influencing factors of the relationship between documents into consideration, so common words appearing frequently in feature words selected result. Based on the analysis of both feature words selection method, this paper raises a combination of statistical and network model integrated the advantages of Textrank and TF-IDF, and proposes a text feature selection method based on Rank-IDF. The Rank-IDF algorithm has better feature selection and common word filtering effects.","PeriodicalId":103490,"journal":{"name":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 5th International Conference on Mathematics and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3395260.3395291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

As big data for text has been one of the core data types in the era of artificial intelligence, feature words selection technique become increasingly important in big data text analysis. The traditional statistical TF-IDF feature words selection algorithm lacks the semantic information extraction ability of text, while the network model Textrank applies the sentence semantic features to feature calculation between words. Network model such as Textrank is very suitable for text feature selection, but it does not take influencing factors of the relationship between documents into consideration, so common words appearing frequently in feature words selected result. Based on the analysis of both feature words selection method, this paper raises a combination of statistical and network model integrated the advantages of Textrank and TF-IDF, and proposes a text feature selection method based on Rank-IDF. The Rank-IDF algorithm has better feature selection and common word filtering effects.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Rank-IDF:基于统计和网络的大数据文本分析特征词选择
文本大数据已经成为人工智能时代的核心数据类型之一,特征词选择技术在大数据文本分析中变得越来越重要。传统的统计TF-IDF特征词选择算法缺乏文本的语义信息提取能力,而网络模型Textrank将句子语义特征应用于词间特征计算。Textrank等网络模型非常适合于文本特征选择,但它没有考虑文档之间关系的影响因素,因此选择的结果是特征词中出现频率较高的常用词。本文在分析两种特征词选择方法的基础上,结合Textrank和TF-IDF的优点,提出了一种统计与网络相结合的模型,提出了一种基于Rank-IDF的文本特征选择方法。Rank-IDF算法具有较好的特征选择和常用词过滤效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Application of Temperature Prediction Model Based on LSTNet in Telecommunication Room Research of particle drilling emergency decision system based on logical reasoning rule Key Technology of Artificial Intelligence in Hull Form Intelligent Optimization Research on Chinese Intent Recognition Based on BERT pre-trained model Manifold Learning for Financial Market Visualization
×
引用
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