首页> 外文期刊>電子情報通信学会技術研究報告. デ-タ工学. Data Engineering >Finding Related Events Based on Bursty Phrase Detection and Clustering
【24h】

Finding Related Events Based on Bursty Phrase Detection and Clustering

机译:根据爆发短语检测和聚类查找相关事件

获取原文
获取原文并翻译 | 示例
           

摘要

Wikipedia is known as the largest up-to-date online encyclopedia, in which articles are versioned and these edits are stored as revisions. In this paper we propose a new method to find related bursty edit events, based on detecting and clustering temporally significant phrases by their bursts over time, from revisions of articles. We discuss evaluation functions to find phrases that are semantically representative as well as temporally significant. After bursts are detected from the time series for each phrase, these phrases are clustered by their temporal similarities, using FastDTW. We evaluate how clustering quality is affected by the time resolution of FastDTW, and discuss optimum time resolution in terms of average burst duration. Experimental results show clustered phrases share similar burst patterns, which can be linked to related real-world events.
机译:维基百科被称为最大的最新在线百科全书,其中文章被版本,这些编辑被存储为修订。 在本文中,我们提出了一种新方法,以根据文章的修订,根据其突发的突发检测和群集时间显着的短语来查找相关的突发编辑事件。 我们讨论评估职能,以找到语义代表的短语以及时间显着。 从每个短语的时间序列中检测到突发后,使用FastDTW,这些短语由其时间相似性集群。 我们评估集群质量如何受到FastDTW的时间分辨率的影响,并在平均突发持续时间方面讨论最佳时间分辨率。 实验结果显示聚集的短语共享类似的突发模式,可以与相关的真实活动相关联。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号