首页> 外文会议>Conference on empirical methods in natural language processing >Twitter-scale New Event Detection via K-term Hashing
【24h】

Twitter-scale New Event Detection via K-term Hashing

机译:通过K项哈希处理Twitter规模的新事件检测

获取原文

摘要

First Story Detection is hard because the most accurate systems become progressively slower with each document processed. We present a novel approach to FSD, which operates in constant time/space and scales to very high volume streams. We show that when computing novelty over a large dataset of tweets, our method performs 192 times faster than a state-of-the-art baseline without sacrificing accuracy. Our method is capable of performing FSD on the full Twitter stream on a single core of modest hardware.
机译:“第一故事”检测很困难,因为随着每个文档的处理,最精确的系统会变得越来越慢。我们为FSD提供了一种新颖的方法,该方法可以在恒定的时间/空间中运行,并可以扩展到非常大的流量。我们表明,在大型推文数据集上计算新颖性时,我们的方法在不牺牲准确性的情况下,其执行速度比最新基准提高了192倍。我们的方法能够在适度硬件的单核上对完整的Twitter流执行FSD。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号