Intent based clustering of search engine query log

Ashok Veilumuthu, Parthasarathy Ramachandran
{"title":"Intent based clustering of search engine query log","authors":"Ashok Veilumuthu, Parthasarathy Ramachandran","doi":"10.1109/COASE.2009.5234156","DOIUrl":null,"url":null,"abstract":"The keyword based search technique suffers from the problem of synonymic and polysemic queries. Current approaches address only the problem of synonymic queries in which different queries might have the same information requirement. But the problem of polysemic queries, i.e., same query having different intentions, still remains unaddressed. In this paper, we propose the notion of intent clusters, the members of which will have the same intention. We develop a clustering algorithm that uses the user session information in query logs in addition to query URL entries to identify cluster of queries having the same intention. The proposed approach has been studied through case examples from the actual log data from AOL, and the clustering algorithm is shown to be successful in discerning the user intentions.","PeriodicalId":386046,"journal":{"name":"2009 IEEE International Conference on Automation Science and Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2009.5234156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The keyword based search technique suffers from the problem of synonymic and polysemic queries. Current approaches address only the problem of synonymic queries in which different queries might have the same information requirement. But the problem of polysemic queries, i.e., same query having different intentions, still remains unaddressed. In this paper, we propose the notion of intent clusters, the members of which will have the same intention. We develop a clustering algorithm that uses the user session information in query logs in addition to query URL entries to identify cluster of queries having the same intention. The proposed approach has been studied through case examples from the actual log data from AOL, and the clustering algorithm is shown to be successful in discerning the user intentions.
基于意图的搜索引擎查询日志聚类
基于关键字的搜索技术存在同义词和多义词查询的问题。目前的方法只解决同义词查询的问题,在同义词查询中,不同的查询可能具有相同的信息需求。但是,多义查询的问题,即相同的查询有不同的意图,仍然没有得到解决。在本文中,我们提出了意图聚类的概念,意图聚类中的成员具有相同的意图。我们开发了一种聚类算法,除了使用查询URL条目外,还使用查询日志中的用户会话信息来识别具有相同意图的查询集群。通过AOL实际日志数据的实例研究了该方法,结果表明该聚类算法在识别用户意图方面是成功的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信