ACM Home Page
Please provide us with feedback. Feedback
Extracting semantic relations from query logs
Full text MovMov (14:06),  PdfPdf (1.33 MB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Jose, California, USA
SESSION: Research track papers table of contents
Pages: 76 - 85  
Year of Publication: 2007
ISBN:978-1-59593-609-7
Authors
Ricardo Baeza-Yates  Yahoo! Research
Alessandro Tiberi  Univ. of Rome
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 67,   Downloads (12 Months): 573,   Citation Count: 23
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/1281192.1281204
What is a DOI?

ABSTRACT

In this paper we study a large query log of more than twenty million queries with the goal of extracting the semantic relations that are implicitly captured in the actions of users submitting queries and clicking answers. Previous query log analyses were mostly done with just the queries and not the actions that followed after them. We first propose a novel way to represent queries in a vector space based on a graph derived from the query-click bipartite graph. We then analyze the graph produced by our query log, showing that it is less sparse than previous results suggested, and that almost all the measures of these graphs follow power laws, shedding some light on the searching user behavior as well as on the distribution of topics that people want in the Web. The representation we introduce allows to infer interesting semantic relationships between queries. Second, we provide an experimental analysis on the quality of these relations, showing that most of them are relevant. Finally we sketch an application that detects multitopical URLs.


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
R. Baeza-Yates. Applications of web query mining. ECIR'05.
 
2
R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query clustering for boosting web page ranking. AWIC'04,
 
3
R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query recommendation using query logs in a search engine. EDBT Workshops, 2004.
4
 
5
 
6
S.-L. Chuang and L.-F. Chien. Automatic query taxonomy generation for information retrieval applications. Online Information Review 27(4), 2003.
 
7
 
8
9
 
10
G. Dupret and M. Mendoza. Automatic Query Recommendation using Click-Through Data. IFIP PPAI'06.
11
 
12
 
13
14
15
 
16
17
18

CITED BY  23

Collaborative Colleagues:
Ricardo Baeza-Yates: colleagues
Alessandro Tiberi: colleagues