Interpreting TF-IDF term weights as making relevance decisions
Abstract
A novel probabilistic retrieval model is presented. It forms a basis to interpret the TF-IDF term weights as making relevance decisions. It simulates the local relevance decision-making for every location of a document, and combines all of these “local” relevance decisions as the “document-wide” relevance decision for the document. The significance of interpreting TF-IDF in this way is the potential to: (1) establish a unifying perspective about information retrieval as relevance decision-making; and (2) develop advanced TF-IDF-related term weights for future elaborate retrieval models. Our novel retrieval model is simplified to a basic ranking formula that directly corresponds to the TF-IDF term weights. In general, we show that the term-frequency factor of the ranking formula can be rendered into different term-frequency factors of existing retrieval systems. In the basic ranking formula, the remaining quantity - log p (r¯| t ∈ d ) is interpreted as the probability of randomly picking a nonrelevant usage (denoted by r¯) of term t . Mathematically, we show that this quantity can be approximated by the inverse document-frequency (IDF). Empirically, we show that this quantity is related to IDF, using four reference TREC ad hoc retrieval data collections.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The TF-IDF language model is an information retrieval theory that dates back to the mid 1970s.
“The TF-IDF language model, which is used by many AI/ML-based text predicting systems, is actually an information retrieval theory that dates back to the mid 1970s 1,2,3 .”
From Automated Knowledge Organization AI ML based Subject Indexing System for Libraries (2023) · cites this paper as [3]
Cited by
Sorted by citations
Fuzzy bag-of-words model for document representation
Zhao, R., & Mao, K. (2018) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2017.2690222 · Cited by 252 · see citing works
Zhang, Y., Wells, C., Wang, S., & Rohe, K. (2018) · New Media & Society · doi:10.1177/1461444817744390 · Cited by 155 · see citing works
Automatic Multiple Choice Question Generation From Text: A Survey
CH, D. R., & Saha, S. K. (2020) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2018.2889100 · Cited by 144 · see citing works
Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security
Fischer, F., Bottinger, K., Xiao, H., Stransky, C., Acar, Y., Backes, M., & Fahl, S. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.31 · Cited by 280 · see citing works
Online grooming detection: A comprehensive survey of child exploitation in chat logs
Borj, P. R., Raja, K., & Bours, P. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.110039 · Cited by 38 · see citing works
Automated Knowledge Organization AI ML based Subject Indexing System for Libraries
Ahmed, M., Mukhopadhyay, M., & Mukhopadhyay, P. (2023) · DESIDOC Journal of Library & Information Technology · doi:10.14429/djlit.43.01.18619 · Cited by 20 · see citing works
- Authors
- Wu, H. C., Luk, R. W. P., Wong, K. F., & Kwok, K. L.
- Affiliations
- The Hong Kong Polytechnic University, Kowloon, Hong Kong
- Hong Kong Polytechnic University (HK)
- Chinese University of Hong Kong (HK)
- Queens College, CUNY (US)
- Venue
- ACM Transactions on Information Systems
- Published
- 2008-06
- Volume
- 26
- Issue
- 3
- Pages
- 1-37
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W1965667542
- Cited by
- 821
- References
- 0
- Citations by year
- 2026: 23 · 2025: 34 · 2024: 44 · 2023: 53 · 2022: 64 · 2021: 85 · 2020: 83 · 2019: 67 · 2018: 68 · 2017: 61 · 2016: 51 · 2015: 40 · 2014: 44 · 2013: 36 · 2012: 41
- FWCI
- 27.03
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM Transactions on Information Systems (publishedVersion)
- PolyU Institutional Research Archive (Hong Kong Polytechnic University) (submittedVersion)
- Funders
- Research Grants Council, University Grants Committee, Hong Kong (PolyU 5226/05E)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Text Analysis Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Keywords
- TF-IDF, probabilistic retrieval models, document ranking, inverse document frequency, ad hoc retrieval
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