Query subtopic mining for search result diversification

M. Z. Ullah, Masaki Aono
{"title":"Query subtopic mining for search result diversification","authors":"M. Z. Ullah, Masaki Aono","doi":"10.1109/ICAICTA.2014.7005960","DOIUrl":null,"url":null,"abstract":"Web search queries are usually short, ambiguous, and contain multiple aspects or subtopics. Different users may have different search intents (or information needs) when submitting the same query. The task of identifying the subtopics underlying a query has received much attention in recent years. In this paper, we propose a method that exploits query reformulations provided by three major Web search engines (WSEs) as a means to uncover different query subtopics. In this regard, we estimate the importance of the subtopics by introducing multiple query-dependent and query-independent features, and rank the subtopics by balancing relevancy and novelty. Our experiment with the NTCIR-10 INTENT-2 English Subtopic Mining test collection shows that our method outperforms all participants' methods in NTCIR-10 INTENT-2 task in terms of D#-nDCG@10.","PeriodicalId":173600,"journal":{"name":"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICTA.2014.7005960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Web search queries are usually short, ambiguous, and contain multiple aspects or subtopics. Different users may have different search intents (or information needs) when submitting the same query. The task of identifying the subtopics underlying a query has received much attention in recent years. In this paper, we propose a method that exploits query reformulations provided by three major Web search engines (WSEs) as a means to uncover different query subtopics. In this regard, we estimate the importance of the subtopics by introducing multiple query-dependent and query-independent features, and rank the subtopics by balancing relevancy and novelty. Our experiment with the NTCIR-10 INTENT-2 English Subtopic Mining test collection shows that our method outperforms all participants' methods in NTCIR-10 INTENT-2 task in terms of D#-nDCG@10.
查询子主题挖掘,实现搜索结果多样化
Web搜索查询通常简短、不明确,并且包含多个方面或子主题。在提交相同的查询时,不同的用户可能有不同的搜索意图(或信息需求)。近年来,识别查询背后的子主题的任务受到了很多关注。在本文中,我们提出了一种利用三个主要Web搜索引擎(wse)提供的查询重新表述作为发现不同查询子主题的方法。在这方面,我们通过引入多个查询相关和查询无关的特征来估计子主题的重要性,并通过平衡相关性和新颖性来对子主题进行排名。我们对ntcirr -10 INTENT-2英语子主题挖掘测试集的实验表明,我们的方法在d# -nDCG@10方面优于所有参与者在ntcirr -10 INTENT-2任务中的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信