首页> 外文期刊>Audio, Speech, and Language Processing, IEEE Transactions on >Mutually Reinforced Manifold-Ranking Based Relevance Propagation Model for Query-Focused Multi-Document Summarization
【24h】

Mutually Reinforced Manifold-Ranking Based Relevance Propagation Model for Query-Focused Multi-Document Summarization

机译:基于互增强歧管排序的相关性传播模型,用于查询集中的多文档摘要

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

摘要

Manifold-ranking has been recently exploited for query-focused summarization. It propagates query relevance from the given query to the document sentences by making use of both the relationships among the sentences and the relationships between the given query and the sentences. The sentences in a document set can be grouped into several topic themes with each theme represented by a cluster of highly related sentences. However, it is a well-recognized fact that a document set often covers a number of such topic themes. In this paper, we present a novel model to enhance manifold-ranking based relevance propagation via mutual reinforcement between sentences and theme clusters. Based on the proposed model, we develop two new sentence ranking algorithms, namely the reinforcement after relevance propagation (RARP) algorithm and the reinforcement during relevance propagation (RDRP) algorithm. The convergence issues of the two algorithms are examined. When evaluated on the DUC2005-2007 datasets and TAC2008 dataset, the performance of the two proposed algorithms is comparable with that of the top three systems. The results also demonstrate that the RDRP algorithm is more effective than the RARP algorithm.
机译:流形排序最近已用于针对查询的摘要。它通过利用句子之间的关系以及给定查询和句子之间的关系,将查询相关性从给定查询传播到文档句子。文档集中的句子可以分为几个主题主题,每个主题由一组高度相关的句子表示。但是,众所周知的事实是,文档集通常涵盖许多此类主题主题。在本文中,我们提出了一个新颖的模型,通过句子和主题簇之间的相互加强来增强基于流形排序的相关性传播。基于提出的模型,我们开发了两种新的句子排序算法,即关联传播后增强(RARP)算法和关联传播后增强(RDRP)算法。研究了两种算法的收敛性问题。在DUC2005-2007数据集和TAC2008数据集上进行评估时,这两种算法的性能与前三名系统的性能相当。结果还表明,RDRP算法比RARP算法更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号