The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
The query-flow graph: model and applications
Abstract
Query logs record the queries and the actions of the users of engines, and as such they contain valuable information about the interests, the preferences, and the behavior of the users, as well as their implicit feedback to engine results. Mining the wealth of information available in the query logs has many important applications including query-log analysis, user profiling and personalization, advertising, query recommendation, and more.In this paper we introduce the query-flow graph, a graph representation of the interesting knowledge about latent querying behavior. 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 searching behavior, whose likelihood is given by the strength of the edges along the path.The query-flow graph is an outcome of query-log mining and, at the same time, a useful tool for it. We propose a methodology that builds such a graph by mining time and textual information as well as aggregating queries from different users. Using this approach we build a real-world query-flow graph from a large-scale query log and we demonstrate its utility in concrete applications, namely, finding logical sessions, and query recommendation. We believe, however, that the usefulness of the query-flow graph goes beyond these two applications.
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
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Characterizing browsing strategies in the World-Wide web
Catledge, L. D., & Pitkow, J. E. (1995) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(95)00043-7 · Cited by 937
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
Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539
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
Query chains: learning to rank from implicit feedback
Radlinski, F., & Joachims, T. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081899 · Cited by 476
Random walks on the click graph
Craswell, N., & Szummer, M. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277784 · Cited by 441
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
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs
Jones, R., & Klinkner, K. L. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458176 · Cited by 385
Information re-retrieval: repeat queries in Yahoo's logs
Teevan, J., Adar, E., Jones, R., & Potts, M. A. S. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277770 · Cited by 293
Cited by
A Survey on Deep Learning for Named Entity Recognition
Li, J., Sun, A., Han, J., & Li, C. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981314 · Cited by 1,567
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
Modeling dwell time to predict click-level satisfaction
Kim, Y., Hassan, A., White, R. W., & Zitouni, I. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556220 · Cited by 164
Session Based Click Features for Recency Ranking
Inagaki, Y., Sadagopan, N., Dupret, G., Dong, A., Liao, C., Chang, Y., & Zheng, Z. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7517 · Cited by 7
Metadata
- Authors
- Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., & Vigna, S.
- Venue
- Proceedings of the 17th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2008-10-26
- Pages
- 609-618
- OpenAlex
- W2117079628
- Cited by
- 298
- References
- 22
- FWCI
- 16.79
- 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: The query-flow graph: model and applications. https://app.cochat.ai/papers/10.1145/1458082.1458163
- The paper
- Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., & Vigna, S. (2008). The query-flow graph: model and applications. Proceedings of the 17th ACM conference on Information and knowledge management. https://doi.org/10.1145/1458082.1458163
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.