首页> 外文期刊>Neurocomputing >User session level diverse reranking of search results
【24h】

User session level diverse reranking of search results

机译:用户会话级别的搜索结果多样化排名

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

摘要

Most Web search diversity approaches can be categorized as Document Level Diversification (DocLD), Topic Level Diversification (TopicLD) or Term Level Diversification (TermLD). DocLD selects the relevant documents with minimal content overlap to each other. It does not take the coverage of query subtopics into account. TopicLD solves this by modeling query subtopics explicitly. However, the automatic mining of query subtopics is difficult. TermLD tries to cover as many query topic terms as possible, which reduces the task of finding a query's subtopics into finding a set of representative topic terms. In this paper, we propose a novel User Session Level Diversification (UserLD) approach based on the observation that a query's subtopics are implicitly reflected by the search intents in different user sessions. Our approach consists of two phases: (I) Session Graph Construction and (II) Diversity Reranking. For a given query, phase (I) builds a Session Graph which considers relevant user sessions and preliminary retrieval results as nodes and the nodes' pairwise similarities as edge weights. Phase (II) reranks the preliminary retrieval results by minimizing a Session Graph based diversity loss function. Extensive experiments on two standard datasets of NACSIS Test Collections for IR (NTCIR) demonstrate the effectiveness of our approach. The advantage of our approach lies in its ability of avoiding mining the query subtopics in advance while achieving almost the same or better performances compared with previous approaches. (C) 2016 Elsevier B.V. All rights reserved.
机译:大多数Web搜索多样性方法可以归类为文档级别多样化(DocLD),主题级别多样化(TopicLD)或术语级别多样化(TermLD)。 DocLD选择内容相互重叠最少的相关文档。它没有考虑查询子主题的范围。 TopicLD通过显式建模查询子主题来解决此问题。但是,自动挖掘查询子主题很困难。 TermLD尝试覆盖尽可能多的查询主题词,从而将查找查询的子主题的任务减少为寻找一组代表性主题词。在本文中,我们提出了一种新的用户会话级别多样化(UserLD)方法,该方法基于以下观点:查询的子主题由不同用户会话中的搜索意图隐式反映。我们的方法包括两个阶段:(I)会话图构建和(II)多样性重新排序。对于给定的查询,阶段(I)构建一个会话图,该图将相关的用户会话和初步检索结果视为节点,并将节点的成对相似性视为边缘权重。阶段(II)通过最小化基于会话图的分集丢失函数来重新排名初步检索结果。在NACSIS红外测验(NTCIR)的两个标准数据集上进行的大量实验证明了我们方法的有效性。与以前的方法相比,我们的方法的优势在于它能够避免提前挖掘查询子主题,同时实现几乎相同或更好的性能。 (C)2016 Elsevier B.V.保留所有权利。

著录项

  • 来源
    《Neurocomputing》 |2018年第24期|66-79|共14页
  • 作者单位

    Shandong Univ, Dept Comp Sci & Technol, Jinan 250101, Shandong, Peoples R China;

    Shandong Univ, Dept Comp Sci & Technol, Jinan 250101, Shandong, Peoples R China;

    Shandong Univ, Dept Comp Sci & Technol, Jinan 250101, Shandong, Peoples R China;

    Jyvaskyla Univ, Dept Comp Sci & Informat Syst, Jyvaskyla 40100, Finland;

    Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA;

    Univ Amsterdam, ISLA, NL-1098 XH Amsterdam, Netherlands;

    Nanjing Univ Informat Sci & Technol, Nanjing 210044, Jiangsu, Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Search result diversification; Search result reranking; Session graph; User session;

    机译:搜索结果多样化;搜索结果排名;会话图;用户会话;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号