The DOI matches its Crossref record.
Mining search engine query logs for query recommendation
Abstract
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial strength search engine. In order to get a more comprehensive solution, we combine two methods together. On the one hand, we study and model search engine users' sequential search behavior, and interpret this consecutive search behavior as client-side query refinement, that should form the basis for the search engine's own query refinement process. On the other hand, we combine this method with a traditional content based similarity method to compensate for the high sparsity of real query log data, and more specifically, the shortness of most query sessions. To evaluate our method, we use one hundred day worth query logs from SINA' search engine to do off-line mining. Then we analyze three independent editors evaluations on a query test set. Based on their judgement, our method was found to be effective for finding related queries, despite its simplicity. In addition to the subjective editors' rating, we also perform tests based on actual anonymous user search sessions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation
Fan, S., Zhu, J., Han, X., Shi, C., Hu, L., Ma, B., & Li, Y. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330673 · Cited by 354
The query-flow graph: model and applications
Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., & Vigna, S. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458163 · Cited by 298
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
“from selecting queries to be suggested from those appearing frequently in query sessions [80], to use clustering to devise similar queries on the basis of cluster membership [17, 18, 22], to use click-through data information to devise query similarity [242, 68].”
MethodEvolution and impact of bias in human and machine learning algorithm interaction
Sun, W., Nasraoui, O., & Shafto, P. (2020) · PLOS ONE · doi:10.1371/journal.pone.0235502 · Cited by 116
“their browsing or purchase history) data [49–54], or even query patterns [55].”
BackgroundSelf-citation
Metadata
- Authors
- Zhang, Z., & Nasraoui, O.
- Venue
- Proceedings of the 15th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2006-05-23
- Pages
- 1039-1040
- OpenAlex
- W2144882256
- Cited by
- 209
- References
- 0
- FWCI
- 10.00
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Mining search engine query logs for query recommendation. https://app.cochat.ai/papers/10.1145/1135777.1136004
- The paper
- Zhang, Z., & Nasraoui, O. (2006). Mining search engine query logs for query recommendation. Proceedings of the 15th international conference on World Wide Web. https://doi.org/10.1145/1135777.1136004
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.