首页> 外文会议>International conference on web-age information management >Event Related Document Retrieval Based on Bipartite Graph
【24h】

Event Related Document Retrieval Based on Bipartite Graph

机译:基于二部图的事件相关文档检索

获取原文

摘要

Given a short event name, event retrieval is a process of retrieving event related documents from a document collection. The existing approaches employ the-state-of-art retrieval models to retrieve relevant documents, however, these methods only regard the input query as several keywords instead of an event, thus the special aspects of the event are not considered in the models. Aiming at this problem, we first propose a novel bipartite graph model to describe an event, where one bipartition represents event type and the other represents the event specific information. Each edge between two bipartitions issues co-occurrence relationship. Then we model an event with a unigram language model estimated through the corresponding bipartite graph. Based on KL-divergence retrieval framework, event model is integrated into the query model for more accurate query representation. Experiments on publicly available TREC datasets show that our method can improve the precision@N metric of event retrieval.
机译:给定简短的事件名称,事件检索是从文档集合中检索与事件相关的文档的过程。现有方法采用最新的检索模型来检索相关文档,但是,这些方法仅将输入查询视为几个关键字而不是事件,因此在模型中未考虑事件的特殊方面。针对这个问题,我们首先提出了一种新颖的二分图模型来描述一个事件,其中一个二分法代表事件类型,另一个二分法代表事件特定信息。两个两部分之间的每个边都发出同现关系。然后,我们使用通过对应的二部图估计的会标语言模型对事件建模。基于KL散度检索框架,事件模型被集成到查询模型中,以实现更准确的查询表示。对公开可用的TREC数据集的实验表明,我们的方法可以提高事件检索的precision @ N指标。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号