ACM Home Page
Please provide us with feedback. Feedback
The query-flow graph: model and applications
Full text PdfPdf (219 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: KM: statistical techniques table of contents
Pages 609-618  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Paolo Boldi  University of Milan, Milan, Italy
Francesco Bonchi  Yahoo! Research, Barcelona, Spain
Carlos Castillo  Yahoo! Research, Barcelona, Spain
Debora Donato  Yahoo! Research, Barcelona, Spain
Aristides Gionis  Yahoo! Research, Barcelona, Spain
Sebastiano Vigna  University of Milan, Milan, Italy
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 206,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458163
What is a DOI?

ABSTRACT

Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to search engine results. Mining the wealth of information available in the query logs has many important applications including query-log analysis, user profiling and personalization, advertising, query recommendation, and more.

In this paper we introduce the query-flow graph, a graph representation of the interesting knowledge about latent querying behavior. Intuitively, in the query-flow graph a directed edge from query qi to query qj means that the two queries are likely to be part of the same "search mission". Any path over the query-flow graph may be seen as a searching behavior, whose likelihood is given by the strength of the edges along the path.

The query-flow graph is an outcome of query-log mining and, at the same time, a useful tool for it. We propose a methodology that builds such a graph by mining time and textual information as well as aggregating queries from different users. Using this approach we build a real-world query-flow graph from a large-scale query log and we demonstrate its utility in concrete applications, namely, finding logical sessions, and query recommendation. We believe, however, that the usefulness of the query-flow graph goes beyond these two applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In EDBT Workshops, volume 3268 of LNCS, pages 588--596. Springer, 2004.
4
 
5
P. Boldi, V. Lonati, M. Santini, and S. Vigna. Graph fibrations, graph isomorphism, and PageRank. RAIRO Inform. Théor., 40:227--253, 2006.
 
6
 
7
8
9
 
10
K. Csalogány, D. Fogaras, B. Rácz, and T. Sarlós. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Math., 2(3):333--358, 2005.
 
11
 
12
D. He and A. Göker. Detecting session boundaries from web user logs. In Proceedings of the BCS-IRSG 22nd annual colloquium on information retrieval research, pages 57--66, Cambridge, UK, 2000.
 
13
14
15
16
 
17
18
19
 
20
W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66:622--626, 1971.
21
22
23

CITED BY  6

Collaborative Colleagues:
Paolo Boldi: colleagues
Francesco Bonchi: colleagues
Carlos Castillo: colleagues
Debora Donato: colleagues
Aristides Gionis: colleagues
Sebastiano Vigna: colleagues