The DOI matches its Crossref record.
On Relevance, Probabilistic Indexing and Information Retrieval
Open accessAbstract
This paper reports on a novel technique for literature indexing and searching in a mechanized library system. The notion of relevance is taken as the key concept in the theory of information retrieval and a comparative concept of relevance is explicated in terms of the theory of probability. The resulting technique called “Probabilistic Indexing,” allows a computing machine, given a request for information, to make a statistical inference and derive a number (called the “relevance number”) for each document, which is a measure of the probability that the document will satisfy the given request. The result of a search is an ordered list of those documents which satisfy the request ranked according to their probable relevance. The paper goes on to show that whereas in a conventional library system the cross-referencing (“see” and “see also”) is based solely on the “semantical closeness” between index terms, statistical measures of closeness between index terms can be defined and computed. Thus, given an arbitrary request consisting of one (or many) index term(s), a machine can elaborate on it to increase the probability of selecting relevant documents that would not otherwise have been selected. Finally, the paper suggests an interpretation of the whole library problem as one where the request is considered as a clue on the basis of which the library system makes a concatenated statistical inference in order to provide as an output an ordered list of those documents which most probably satisfy the information needs of the user.
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
Text as Data: The Promise and Pitfalls of Automatic Content Analysis Methods for Political Texts
Grimmer, J., & Stewart, B. M. (2013) · Political Analysis · doi:10.1093/pan/mps028 · Cited by 3,297
The probabilistic relevance framework: BM25 and beyond
Robertson, S., & Zaragoza, H. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000019 · Cited by 3,374
Naive (Bayes) at forty: The independence assumption in information retrieval
Lewis, D. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026666 · Cited by 2,104
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
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
Dumais, S. T. (2004) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440380105 · Cited by 1,107
THE PROBABILITY RANKING PRINCIPLE IN IR
ROBERTSON, S. E. (1977) · Journal of Documentation · doi:10.1108/eb026647 · Cited by 1,103
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
A probabilistic model of information retrieval: development and comparative experiments
Sparck Jones, K., Walker, S., & Robertson, S. E. (2000) · Information Processing & Management · doi:10.1016/s0306-4573(00)00015-7 · Cited by 942
RELEVANCE: A review of and a framework for the thinking on the notion in information science
Saracevic, T. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260604 · Cited by 863
Interpreting TF-IDF term weights as making relevance decisions
Wu, H. C., Luk, R. W. P., Wong, K. F., & Kwok, K. L. (2008) · ACM Transactions on Information Systems · doi:10.1145/1361684.1361686 · Cited by 821
Speculations Concerning the First Ultraintelligent Machine
Good, I. J. (1966) · Advances in Computers · doi:10.1016/s0065-2458(08)60418-0 · Cited by 703
Developments in Automatic Text Retrieval
Salton, G. (1991) · Science · doi:10.1126/science.253.5023.974 · Cited by 619
Automatic Indexing: An Experimental Inquiry
Maron, M. E. (1961) · Journal of the ACM · doi:10.1145/321075.321084 · Cited by 570
Self-citationLearning to Detect and Classify Malicious Executables in the Wild
Kolter, J. Z., & Maloof, M. A. (2006) · doi:10.5555/1248547.1248646 · Cited by 562
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
Minimum redundancy feature selection from microarray gene expression data
Ding, C., & Peng, H. (2004) · Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003 · doi:10.1109/csb.2003.1227396 · Cited by 506
Learning to detect malicious executables in the wild
Kolter, J. Z., & Maloof, M. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014105 · Cited by 475
A hidden Markov model information retrieval system
Miller, D. R. H., Leek, T., & Schwartz, R. M. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312680 · Cited by 469
Using Language Models for Information Retrieval
Hiemstra, D. (2001) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.570441 · Cited by 448
A survey on the use of relevance feedback for information access systems
RUTHVEN, I., & LALMAS, M. (2003) · The Knowledge Engineering Review · doi:10.1017/s0269888903000638 · Cited by 401
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
Adapting Feature Selection Algorithms for the Classification of Chinese Texts
Liu, X., Wang, S., Lu, S., Yin, Z., Li, X., Yin, L., Tian, J., & Zheng, W. (2023) · Systems · doi:10.3390/systems11090483 · Cited by 336
Probabilistic Models in Information Retrieval
Fuhr, N. (1992) · The Computer Journal · doi:10.1093/comjnl/35.3.243 · Cited by 315
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
A probabilistic model of information retrieval: development and comparative experiments
Sparck Jones, K., Walker, S., & Robertson, S. E. (2000) · Information Processing & Management · doi:10.1016/s0306-4573(00)00016-9 · Cited by 277
Chen, H. (1995) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199504)46:3<194::aid-asi4>3.0.co;2-s · Cited by 273
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
Discrete Bayesian Network Classifiers: A Survey
Bielza, C., & Larrañaga, P. (2014) · ACM Computing Surveys · doi:10.1145/2576868 · Cited by 248
Dense Text Retrieval Based on Pretrained Language Models: A Survey
Zhao, W. X., Liu, J., Ren, R., & Wen, J.-R. (2024) · ACM Transactions on Information Systems · doi:10.1145/3637870 · Cited by 211
“Unlike sparse retrievers (e.g., BM25), dense retrievers no longer rely on exact term matching for text retrieval, but instead learn semantic matching for capturing the text relevance.”
BackgroundInfluentialRelation-Based Counterfactual Explanations for Bayesian Network Classifiers
Albini, E., Rago, A., Baroni, P., & Toni, F. (2020) · Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/63 · Cited by 39
Deception as a Semantic Attack
Thompson, P. (2006) · Chapman & Hall/CRC Computer & Information Science Series · doi:10.1201/9781420011012.ch2.2 · Cited by 8
Metadata
- Authors
- Maron, M. E., & Kuhns, J. L.
- Venue
- Journal of the ACM
- Published
- 1960-07
- Volume
- 7
- Issue
- 3
- Pages
- 216-244
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2082729696
- Cited by
- 907
- References
- 0
- FWCI
- 58.72
- Type
- journal article
- 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.