Discovering tasks from search engine query logs

Author:

Lucchese Claudio1,Orlando Salvatore2,Perego Raffaele1,Silvestri Fabrizio1,Tolomei Gabriele2

Affiliation:

1. ISTI-CNR, Pisa, Italy

2. Università Ca' Foscari Venezia, Italy

Abstract

Although Web search engines still answer user queries with lists of ten blue links to webpages, people are increasingly issuing queries to accomplish their daily tasks (e.g., finding a recipe , booking a flight , reading online news , etc.). In this work, we propose a two-step methodology for discovering tasks that users try to perform through search engines. First, we identify user tasks from individual user sessions stored in search engine query logs. In our vision, a user task is a set of possibly noncontiguous queries (within a user search session), which refer to the same need. Second, we discover collective tasks by aggregating similar user tasks, possibly performed by distinct users. To discover user tasks, we propose query similarity functions based on unsupervised and supervised learning approaches. We present a set of query clustering methods that exploit these functions in order to detect user tasks. All the proposed solutions were evaluated on a manually-built ground truth, and two of them performed better than state-of-the-art approaches. To detect collective tasks, we propose four methods that cluster previously discovered user tasks, which in turn are represented by the bag-of-words extracted from their composing queries. These solutions were also evaluated on another manually-built ground truth.

Funder

European Commission

Ministero dell'Istruzione, dell'Università e della Ricerca

Seventh Framework Programme

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference53 articles.

1. Design trade-offs for search engine caching

2. Baeza-Yates R. and Ribeiro-Neto B. 1999. Modern Information Retrieval. Addison-Wesley Longman Publishing Co. Inc. Boston MA. Baeza-Yates R. and Ribeiro-Neto B. 1999. Modern Information Retrieval. Addison-Wesley Longman Publishing Co. Inc. Boston MA.

3. Agglomerative clustering of a search engine query log

4. The query-flow graph

5. Broder A. 2002. A taxonomy of Web search. SIGIR Forum 36 2 2 3--10. 10.1145/792550.792552 Broder A. 2002. A taxonomy of Web search. SIGIR Forum 36 2 2 3--10. 10.1145/792550.792552

Cited by 46 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3