The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Concept based query expansion
Open accessAbstract
Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. A similarity thesaurus reflects domain knowledge about the particular collection from which it is constructed. We address the two important issues with query expansion: the selection and the weighting of additional search terms. In contrast to earlier methods, our queries are expanded by adding those terms that are most similar to the concept of the query, rather than selecting terms that are similar to the query terms. Our experiments show that this kind of query expansion results in a notable improvement in the retrieval effectiveness when measured using both recall-precision and usefulness.
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
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
Improving retrieval performance by relevance feedback
Salton, G., & Buckley, C. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199006)41:4<288::aid-asi8>3.0.co;2-h · Cited by 1,495
A theory of term importance in automatic text analysis
Salton, G., Yang, C. S., & Yu, C. T. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260106 · Cited by 389
The limitations of term co-occurrence data for query expansion in document retrieval systems
Peat, H. J., & Willett, P. (1991) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199106)42:5<378::aid-asi8>3.0.co;2-8 · Cited by 256
On modeling of information retrieval concepts in vector spaces
Wong, S. K. M., Ziarko, W., Raghavan, V. V., & Wong, P. C. N. (1987) · ACM Transactions on Database Systems · doi:10.1145/22952.22957 · Cited by 172
Word‐word associations in document retrieval systems
Lesk, M. E. (1969) · American Documentation · doi:10.1002/asi.4630200106 · Cited by 162
Experiments in automatic statistical thesaurus construction
Crouch, C. J., & Yang, B. (1992) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/133160.133180 · Cited by 154
An approach to the automatic construction of global thesauri
Crouch, C. J. (1990) · Information Processing & Management · doi:10.1016/0306-4573(90)90106-c · Cited by 131
An evaluation of query expansion by the addition of clustered terms for a document retrieval system
Minker, J., Wilson, G. A., & Zimmerman, B. H. (1972) · Information Processing & Management · doi:10.1016/0020-0271(72)90021-6 · Cited by 90
Determining the effectiveness of retrieval algorithms
Frei, H. P., & Scháuble, P. (1991) · Information Processing & Management · doi:10.1016/0306-4573(91)90046-o · Cited by 54
Self-citationThe Various Roles of Information Structures
Scháuble, P., & Knaus, D. (1993) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-50974-2_28 · Cited by 16
Query expansion: advances in research in online catalogues
Hancock‐Beaulieu, M. (1992) · Journal of Information Science · doi:10.1177/016555159201800203 · Cited by 13
Cited by
Quary Expansion Using Local and Global Document Analysis
Xu, J., & Croft, W. B. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130364 · Cited by 1,252
A Survey of Automatic Query Expansion in Information Retrieval
Carpineto, C., & Romano, G. (2012) · ACM Computing Surveys · doi:10.1145/2071389.2071390 · Cited by 1,109
Improving the effectiveness of information retrieval with local context analysis
Xu, J., & Croft, W. B. (2000) · ACM Transactions on Information Systems · doi:10.1145/333135.333138 · Cited by 533
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
A review of ontology based query expansion
Bhogal, J., Macfarlane, A., & Smith, P. (2007) · Information Processing & Management · doi:10.1016/j.ipm.2006.09.003 · Cited by 408
Metadata
- Authors
- Qiu, Y., & Frei, H.-P.
- Venue
- Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93
- Publisher
- ACM Press
- Published
- 1993
- Pages
- 160-169
- OpenAlex
- W1987996059
- Cited by
- 712
- References
- 13
- FWCI
- 7.75
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.