The DOI matches its Crossref record.
Extracting semantic relations from query logs
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Several works [1], [7], [8], [9] have observed that the probability that a query is searched v times is approximately Power law distributed, namely P (V = v) ∝ 1/v α .”
From Estimating the Total Volume of Queries to a Search Engine (2022) · cites this paper as [8]
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 16
- 10.1007/978-3-540-31865-1_2 · DOI
- R. Baeza-Yates , C. Hurtado , and M. Mendoza . Query clustering for boosting web page ranking . AWIC'04 , R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query clustering for boosting web page ranking. AWIC'04,
- 10.1007/978-3-540-30192-9_58 · DOI
- 10.1145/347090.347176 · DOI
- 10.1109/ICDEW.2006.36 · DOI
- 10.1108/14684520310489032 · DOI
- 10.1016/S0167-9236(02)00099-4 · DOI
- S.-L. Chuang and L.-F. Chien . Towards automatic generation of query taxonomy: A hierarchical query clustering approach . ICDM'02 . S.-L. Chuang and L.-F. Chien. Towards automatic generation of query taxonomy: A hierarchical query clustering approach. ICDM'02.
- 10.1145/1183614.1183768 · DOI
- 10.1145/258525.258597 · DOI
- 10.1002/asi.10071 · DOI
- 10.1145/215206.215381 · DOI
- 10.1145/1135777.1135834 · DOI
- James Surowiecki . The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business , Economies, Societies and Nations , Little and Brown , 2004 . James Surowiecki. The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business, Economies, Societies and Nations, Little and Brown, 2004.
- 10.1145/371920.371974 · DOI
- 10.1145/1008992.1009030 · DOI
Cited by
Sorted by citations
Query expansion techniques for information retrieval: a survey
Azad, H. K., & Deepak, A. (2019) · Information Processing & Management · doi:10.1016/j.ipm.2019.05.009 · Cited by 313
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
Learning about the world through long-term query logs
Richardson, M. (2008) · ACM Transactions on the Web · doi:10.1145/1409220.1409224 · Cited by 77
Estimating the Total Volume of Queries to a Search Engine
Lillo, F., & Ruggieri, S. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3054668 · Cited by 4
Metadata
- Authors
- Baeza-Yates, R., & Tiberi, A.
- Venue
- Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2007-08-12
- Pages
- 76-85
- Cited by
- 208
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Extracting semantic relations from query logs. https://app.cochat.ai/papers/10.1145/1281192.1281204
- The paper
- Baeza-Yates, R., & Tiberi, A. (2007). Extracting semantic relations from query logs. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1281192.1281204