The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Query suggestion using hitting time
Abstract
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such suggestions can be generated from a large scale graph of queries and other accessory information, such as the clickthrough. However, how to generate suggestions while ensuring their semantic consistency with the original query remains a challenging problem.
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
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
The long tail: why the future of business is selling less of more
(2007) · Choice Reviews Online · doi:10.5860/choice.44-2783 · Cited by 2,869
Accurately interpreting clickthrough data as implicit feedback
Joachims, T., Granka, L., Pan, B., Hembrooke, H., & Gay, G. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076063 · Cited by 1,408
Model-based feedback in the language modeling approach to information retrieval
Zhai, C., & Lafferty, J. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502654 · Cited by 787
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
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
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
Implicit user modeling for personalized search
Shen, X., Tan, B., & Zhai, C. (2005) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1099554.1099747 · Cited by 473
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
Optimizing web search using web click-through data
Xue, G.-R., Zeng, H.-J., Chen, Z., Yu, Y., Ma, W.-Y., Xi, W., & Fan, W. (2004) · Proceedings of the thirteenth ACM international conference on Information and knowledge management · doi:10.1145/1031171.1031192 · Cited by 249
An Analytical Comparison of Approaches to Personalizing PageRank
Haveliwala, T. H., Kamvar, S. D., & Jeh, G. (2003) · Cited by 208
Spelling Correction as an Iterative Process that Exploits the Collective Knowledge of Web Users.
Cucerzan, S., & Brill, E. (2004) · Cited by 207
Examining the effectiveness of real-time query expansion
White, R. W., & Marchionini, G. (2007) · Information Processing & Management · doi:10.1016/j.ipm.2006.06.005 · Cited by 159
Active exploration for learning rankings from clickthrough data
Radlinski, F., & Joachims, T. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281254 · Cited by 156
Enhanced topic distillation using text, markup tags, and hyperlinks
Chakrabarti, S., Joshi, M. M., & Tawde, V. B. (2001) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/383952.383990 · Cited by 126
Exploring distributional similarity based models for query spelling correction
Li, M., Zhang, Y., Zhu, M., & Zhou, M. (2006) · International Conference on Computational Linguistics · doi:10.3115/1220175.1220304 · Cited by 116
Entropy of search logs: how hard is search? with personalization? with backoff?
Mei, Q., & Church, K. (2008) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1341531.1341540 · Cited by 79
Self-citation
Metadata
- Authors
- Mei, Q., Zhou, D., & Church, K.
- Venue
- Proceedings of the 17th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2008-10-26
- Pages
- 469-478
- OpenAlex
- W2153190022
- Cited by
- 315
- References
- 20
- FWCI
- 20.98
- 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
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.