Query recommendation based on irrelevant feedback analysis

Bo Zhang, Bin Zhang, Shubo Zhang, Chao Ma
{"title":"Query recommendation based on irrelevant feedback analysis","authors":"Bo Zhang, Bin Zhang, Shubo Zhang, Chao Ma","doi":"10.1109/BMEI.2015.7401583","DOIUrl":null,"url":null,"abstract":"Similarity computation among queries is a central step of query recommendation based on click information in search log. In this step, weights of clicked URLs or clicked document terms, which may have a large influence on similarity computation results, are mostly counted based on co-occurrence. However, counting weights based on co-occurrence are unusually disturbed by irrelevant feedbacks in search log, which may decrease the precision of query similarity computation. This paper proposes a method that computes similarity among queries based on \"Query - Clicked Sequence\" model, which counts weight of clicked document term by density of documents containing this term on clicked sequence, and filters content of irrelevant documents during similarity computation. A series of experiment results show that this method can precisely count the weights of terms, and increase the precision of query similarity computation, accordingly increase the precision of query recommendation.","PeriodicalId":119361,"journal":{"name":"2015 8th International Conference on Biomedical Engineering and Informatics (BMEI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 8th International Conference on Biomedical Engineering and Informatics (BMEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BMEI.2015.7401583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Similarity computation among queries is a central step of query recommendation based on click information in search log. In this step, weights of clicked URLs or clicked document terms, which may have a large influence on similarity computation results, are mostly counted based on co-occurrence. However, counting weights based on co-occurrence are unusually disturbed by irrelevant feedbacks in search log, which may decrease the precision of query similarity computation. This paper proposes a method that computes similarity among queries based on "Query - Clicked Sequence" model, which counts weight of clicked document term by density of documents containing this term on clicked sequence, and filters content of irrelevant documents during similarity computation. A series of experiment results show that this method can precisely count the weights of terms, and increase the precision of query similarity computation, accordingly increase the precision of query recommendation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于无关反馈分析的查询推荐
查询间相似度计算是基于搜索日志中点击信息进行查询推荐的核心步骤。在这一步中,对相似度计算结果影响较大的被点击url或被点击文档词的权重,主要是基于共现来计算。然而,基于共现的权重计算通常会受到搜索日志中不相关反馈的干扰,从而降低查询相似度计算的精度。本文提出了一种基于“查询-点击序列”模型的查询间相似度计算方法,该方法通过在点击序列中包含该词的文档的密度来计算被点击的文档词的权重,并在相似度计算中过滤不相关文档的内容。一系列实验结果表明,该方法能够准确地计算出词的权重,提高了查询相似度计算的精度,从而提高了查询推荐的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ECG signal compressed sensing using the wavelet tree model Development of a quantifiable optical reader for lateral flow immunoassay A tightly secure multi-party-signature protocol in the plain model Breast mass detection with kernelized supervised hashing 3D reconstruction of human enamel Ex vivo using high frequency ultrasound
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1