The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Context-aware query suggestion by mining click-through and session data
Abstract
Query suggestion plays an important role in improving the usability of search engines. Although some recently proposed methods can make meaningful query suggestions by mining query patterns from search logs, none of them are context-aware - they do not take into account the immediately preceding queries as context in query suggestion. In this paper, we propose a novel context-aware query suggestion approach which is in two steps. In the offine model-learning step, to address data sparseness, queries are summarized into concepts by clustering a click-through bipartite. Then, from session data a concept sequence suffix tree is constructed as the query suggestion model. In the online query suggestion step, a user's search context is captured by mapping the query sequence submitted by the user to a sequence of concepts. By looking up the context in the concept sequence sufix tree, our approach suggests queries to the user in a context-aware manner. We test our approach on a large-scale search log of a commercial search engine containing 1:8 billion search queries, 2:6 billion clicks, and 840 million query sessions. The experimental results clearly show that our approach outperforms two baseline methods in both coverage and quality of suggestions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
(1996) · Cited by 20,179
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Mining sequential patterns: Generalizations and performance improvements
Srikant, R., & Agrawal, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014140 · Cited by 2,711
Agglomerative clustering of a search engine query log
Beeferman, D., & Berger, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347176 · Cited by 768
A web-based kernel function for measuring the similarity of short text snippets
Sahami, M., & Heilman, T. D. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135834 · Cited by 735
Generating query substitutions
Jones, R., Rey, B., Madani, O., & Greiner, W. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135835 · Cited by 618
Query Recommendation Using Query Logs in Search Engines
Baeza-Yates, R., Hurtado, C., & Mendoza, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30192-9_58 · Cited by 537
Probabilistic query expansion using query logs
Cui, H., Wen, J.-R., Nie, J.-Y., & Ma, W.-Y. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511489 · Cited by 423
Clustering user queries of a search engine
Wen, J.-R., Nie, J.-Y., & Zhang, H.-J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.371974 · Cited by 410
Cited by
From Frequency to Meaning: Vector Space Models of Semantics
Turney, P. D., & Pantel, P. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2934 · Cited by 2,866
Sequence-Aware Recommender Systems
Quadrana, M., Cremonesi, P., & Jannach, D. (2019) · ACM Computing Surveys · doi:10.1145/3190616 · Cited by 504
A Hierarchical Recurrent Encoder-Decoder for Generative Context-Aware Query Suggestion
Sordoni, A., Bengio, Y., Vahabi, H., Lioma, C., Grue Simonsen, J., & Nie, J.-Y. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806493 · Cited by 472
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
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
Metadata
- Authors
- Cao, H., Jiang, D., Pei, J., He, Q., Liao, Z., Chen, E., & Li, H.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 875-883
- OpenAlex
- W2171743956
- Cited by
- 461
- References
- 19
- FWCI
- 23.34
- 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: Context-aware query suggestion by mining click-through and session data. https://app.cochat.ai/papers/10.1145/1401890.1401995
- The paper
- Cao, H., Jiang, D., Pei, J., He, Q., Liao, Z., Chen, E., & Li, H. (2008). Context-aware query suggestion by mining click-through and session data. Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1401890.1401995
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.