ACM Home Page
Please provide us with feedback. Feedback
Query suggestions using query-flow graphs
Full text PdfPdf (274 KB)
Source Web Search and Web Data Mining archive
Proceedings of the 2009 workshop on Web Search Click Data table of contents
Barcelona, Spain
Pages 56-63  
Year of Publication: 2009
ISBN:978-1-60558-434-8
Authors
Paolo Boldi  Università degli, Studi di Milano, Italy
Francesco Bonchi  Yahoo! Research Labs, Barcelona, Spain
Carlos Castillo  Yahoo! Research Labs, Barcelona, Spain
Debora Donato  Yahoo! Research Labs, Barcelona, Spain
Sebastiano Vigna  Università degli, Studi di Milano, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 34,   Downloads (12 Months): 176,   Citation Count: 0
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/1507509.1507518
What is a DOI?

ABSTRACT

The query-flow graph [Boldi et al., CIKM 2008] is an aggregated representation of the latent querying behavior contained in a query log. 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 possible search task, whose likelihood is given by the strength of the edges along the path. An edge (qi, qj) is also labelled with some information: e.g., the probability that user moves from qi to qj, or the type of the transition, for instance, the fact that qj is a specialization of qi.

In this paper we propose, and experimentally study, query recommendations based on short random walks on the query-flow graph. Our experiments show that these methods can match in precision, and often improve, recommendations based on query-click graphs, without using users' clicks. Our experiments also show that it is important to consider transition-type labels on edges for having good quality recommendations.

Finally, one feature that we had in mind while devising our methods was that of providing diverse sets of recommendations: the experimentation that we conducted provides encouraging results in this sense.


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
Antonellis, I., Garcia-Molina, H., and Chang, C.-C. Simrank++: Query rewriting through link analysis of the click graph. In Proceedings of VLDB (Dec 2008), pp. 408--421.
 
2
 
3
Baeza-yates, R., Hurtado, C., and Mendoza, M. Query recommendation using query logs in search engines. In In International Workshop on Clustering Information over the Web (ClustWeb, in conjunction with EDBT), Creete (2004), Springer, pp. 588--596.
4
 
5
Baeza-Yates, R. A., Hurtado, C. A., and Mendoza, M. Query recommendation using query logs in search engines. In EDBT Workshops (2004), vol. 3268 of LNCS, Springer, pp. 588--596.
6
 
7
Belazzougui, D., Boldi, P., Pagh, R., and Vigna, S. Theory and practise of monotone minimal perfect hashing. In ALENEX 09: Algorithm Engineering and Experimentes (2009), Lecture Notes in Computer Science, Springer--Verlag.
8
 
9
Boldi, P., Bonchi, F., Castillo, C., and Vigna, S. From "dango" to "japanese cakes": Query reformulation models and patterns. Submitted for publication, 2008.
10
 
11
12
13
 
14
15
16
17
18
19
20
 
21
22
23
24
25
 
26
27
28
29
30
31
32


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