ISCAS OpenIR
用户查询意图切分的研究
Alternative Titlestudy on segmentation of user's query intents
江雪; 孙乐
2013
Source计算机学报
ISSN0254-4164
Volume36Issue:3Pages:664-670
English Abstract用户查询意图是指用户在构建查询时,希望搜索引擎能够返回的信息.如果搜索引擎可以判断用户当前查询与之前输入的查询是否属于同一查询意图,那么可以为用户提供更适当的查询建议、查询扩展或者个性化检索服务等.该文提出了基于点击相似度切分用户查询意图,在决策树模型和CRF模型上都取得了一定的提升.利用用户点击信息可以提高查询意图切分的效果,引入用户点击信息后,基于决策树的方法,F值提高1%,基于CRF模型的F值提高1.4%.
Indexed TypeCNKI ; WANFANG ; CSCD
AbstractQuery intent denotes the specific information that user wants to look for when he submit a query to a search engine. If search engine can judge whether the intent of current query is same as that of previous query, they would refine current query and offer users more accurate results and services, such as query suggestion, query expansion or personalized information retrieval. This paper proposed click data-based similarity, and this similarity is effective with decision tree model and CRF model. Usersclick data is helpful for this task, with usersclick data, F-measure is improved by 1% and 1. 4%for decision tree-based method and CRF-based method respectively.
Keyword信息检索 查询日志 查询意图切分
Department中国科学院软件研究所;
SubjectComputer Science (Provided By Thomson Reuters)
Sponsorship国家自然科学基金(60736044,90920010)|重大科技专项经费(2010ZX01037-001-002)资助
Language中文
CSCD IDCSCD:4787419
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/15537
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
江雪,孙乐. 用户查询意图切分的研究[J]. 计算机学报,2013,36(3):664-670.
APA 江雪,&孙乐.(2013).用户查询意图切分的研究.计算机学报,36(3),664-670.
MLA 江雪,et al."用户查询意图切分的研究".计算机学报 36.3(2013):664-670.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[江雪]'s Articles
[孙乐]'s Articles
Baidu academic
Similar articles in Baidu academic
[江雪]'s Articles
[孙乐]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[江雪]'s Articles
[孙乐]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.