Quick-and-clean extraction of linked data entities from microblogs

Oluwaseyi Feyisetan, E. Simperl, Ramine Tinati, Markus Luczak-Rösch, N. Shadbolt
{"title":"Quick-and-clean extraction of linked data entities from microblogs","authors":"Oluwaseyi Feyisetan, E. Simperl, Ramine Tinati, Markus Luczak-Rösch, N. Shadbolt","doi":"10.1145/2660517.2660527","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of finding Named Entities in very large micropost datasets. We propose methods to generate a sample of representative microposts by discovering tweets that are likely to refer to new entities. Our approach is able to significantly speed-up the semantic analysis process by discarding retweets, tweets without pre-identifiable entities, as well similar and redundant tweets, while retaining information content.\n We apply the approach on a corpus of 1:4 billion microposts, using the IE services of AlchemyAPI, Calais, and Zemanta to identify more than 700,000 unique entities. For the evaluation we compare runtime and number of entities extracted based on the full and the downscaled version of a micropost set. We are able to demonstrate that for datasets of more than 10 million tweets we can achieve a reduction in size of more than 80% while maintaining up to 60% coverage on unique entities cumulatively discovered by the three IE tools.\n We publish the resulting Twitter metadata as Linked Data using SIOC and an extension of the NERD core ontology.","PeriodicalId":344435,"journal":{"name":"Joint Conference on Lexical and Computational Semantics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Joint Conference on Lexical and Computational Semantics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2660517.2660527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we address the problem of finding Named Entities in very large micropost datasets. We propose methods to generate a sample of representative microposts by discovering tweets that are likely to refer to new entities. Our approach is able to significantly speed-up the semantic analysis process by discarding retweets, tweets without pre-identifiable entities, as well similar and redundant tweets, while retaining information content. We apply the approach on a corpus of 1:4 billion microposts, using the IE services of AlchemyAPI, Calais, and Zemanta to identify more than 700,000 unique entities. For the evaluation we compare runtime and number of entities extracted based on the full and the downscaled version of a micropost set. We are able to demonstrate that for datasets of more than 10 million tweets we can achieve a reduction in size of more than 80% while maintaining up to 60% coverage on unique entities cumulatively discovered by the three IE tools. We publish the resulting Twitter metadata as Linked Data using SIOC and an extension of the NERD core ontology.
快速干净地从微博中提取链接数据实体
在本文中,我们解决了在非常大的微帖子数据集中查找命名实体的问题。我们提出了通过发现可能引用新实体的推文来生成代表性微博样本的方法。我们的方法能够通过丢弃转发,没有预先识别实体的推文,以及相似和冗余的推文,同时保留信息内容,从而显着加快语义分析过程。我们使用AlchemyAPI、Calais和Zemanta的IE服务,将该方法应用于14亿微博的语料库,以识别超过70万个独特的实体。为了评估,我们比较了基于微博集的完整版本和缩小版本提取的实体的运行时间和数量。我们能够证明,对于超过1000万条推文的数据集,我们可以将大小减少80%以上,同时在三个IE工具累积发现的唯一实体上保持高达60%的覆盖率。我们使用SIOC和NERD核心本体的扩展将生成的Twitter元数据发布为关联数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信