tf–idf

Short description: Estimate of the importance of a word in a document

In information retrieval, tf–idf (also TF*IDF, TFIDF, TF–IDF, or Tf–idf), short for term frequency–inverse document frequency, is a measure of importance of a word to a document in a collection or corpus, adjusted for the fact that some words appear more frequently in general. It was often used as a weighting factor in searches of information retrieval, text mining, and user modeling. A survey conducted in 2015 showed that 83% of text-based recommender systems in digital libraries used tf–idf.

Variations of the tf–idf weighting scheme were often used by search engines as a central tool in scoring and ranking a document's relevance given a user query.

One of the simplest ranking functions is computed by summing the tf–idf for each query term; many more sophisticated ranking functions are variants of this simple model.

Motivations

Karen Spärck Jones (1972) conceived a statistical interpretation of term-specificity called Inverse Document Frequency (idf), which became a cornerstone of term weighting:

The specificity of a term can be quantified as an inverse function of the number of documents in which it occurs.

For example, the df (document frequency) and idf for some words in Shakespeare's 37 plays are as follows:

Word	df	idf
Romeo	1	1.57
salad	2	1.27
Falstaff	4	0.967
forest	12	0.489
battle	21	0.246
wit	34	0.037
fool	36	0.012
good	37	0
sweet	37	0

We see that "Romeo", "Falstaff", and "salad" appears in very few plays, so seeing these words, one could get a good idea as to which play it might be. In contrast, "good" and "sweet" appears in every play and are completely uninformative as to which play it is.

Definition

1. The tf–idf is the product of two statistics, term frequency and inverse document frequency. There are various ways for determining the exact values of both statistics.
2. A formula that aims to define the importance of a keyword or phrase within a document or a web page.

Variants of term frequency (tf) weight

weighting scheme	tf weight
binary	[math]\displaystyle{ {0,1} }[/math]
raw count	[math]\displaystyle{ f_{t,d} }[/math]
term frequency	[math]\displaystyle{ f_{t,d} \Bigg/ {\sum_{t' \in d}{f_{t',d}}} }[/math]
log normalization	[math]\displaystyle{ \log (1 + f_{t,d}) }[/math]
double normalization 0.5	[math]\displaystyle{ 0.5 + 0.5 \cdot \frac { f_{t,d} }{\max_{\{t' \in d\}} {f_{t',d}}} }[/math]
double normalization K	[math]\displaystyle{ K + (1 - K) \frac { f_{t,d} }{\max_{\{t' \in d\}} {f_{t',d}}} }[/math]

Term frequency

Term frequency, tf(t,d), is the relative frequency of term t within document d,

[math]\displaystyle{ \mathrm{tf}(t,d) = \frac{f_{t,d}}{{\sum_{t' \in d}{f_{t',d}}}} }[/math],

where f_t,d is the raw count of a term in a document, i.e., the number of times that term t occurs in document d. Note the denominator is simply the total number of terms in document d (counting each occurrence of the same term separately). There are various other ways to define term frequency:

• the raw count itself: tf(t,d) = f_t,d
• Boolean "frequencies": tf(t,d) = 1 if t occurs in d and 0 otherwise;
• logarithmically scaled frequency: tf(t,d) = log (1 + f_t,d);
• augmented frequency, to prevent a bias towards longer documents, e.g. raw frequency divided by the raw frequency of the most frequently occurring term in the document:

[math]\displaystyle{ \mathrm{tf}(t,d) = 0.5 + 0.5 \cdot \frac{f_{t, d}}{\max\{f_{t', d}:t' \in d\}} }[/math]

Inverse document frequency

Variants of inverse document frequency (idf) weight

weighting scheme	idf weight ([math]\displaystyle{ n_t = |\{d \in D: t \in d\}| }[/math])
unary	1
inverse document frequency	[math]\displaystyle{ \log \frac {N} {n_t} = - \log \frac {n_t} {N} }[/math]
inverse document frequency smooth	[math]\displaystyle{ \log \left( \frac {N} {1 + n_t}\right)+ 1 }[/math]
inverse document frequency max	[math]\displaystyle{ \log \left(\frac {\max_{\{t' \in d\}} n_{t'}} {1 + n_t}\right) }[/math]
probabilistic inverse document frequency	[math]\displaystyle{ \log \frac {N - n_t} {n_t} }[/math]

The inverse document frequency is a measure of how much information the word provides, i.e., if it is common or rare across all documents. It is the logarithmically scaled inverse fraction of the documents that contain the word (obtained by dividing the total number of documents by the number of documents containing the term, and then taking the logarithm of that quotient):

[math]\displaystyle{ \mathrm{idf}(t, D) = \log \frac{N}{|\{d \in D: t \in d\}|} }[/math]

with

• [math]\displaystyle{ N }[/math]: total number of documents in the corpus [math]\displaystyle{ N = {|D|} }[/math]
• [math]\displaystyle{ |\{d \in D: t \in d\}| }[/math] : number of documents where the term [math]\displaystyle{ t }[/math] appears (i.e., [math]\displaystyle{ \mathrm{tf}(t,d) \neq 0 }[/math]). If the term is not in the corpus, this will lead to a division-by-zero. It is therefore common to adjust the numerator [math]\displaystyle{ 1 + N }[/math] and denominator to [math]\displaystyle{ 1 + |\{d \in D: t \in d\}| }[/math].

Plot of different inverse document frequency functions: standard, smooth, probabilistic.

Term frequency–inverse document frequency

Variants of term frequency-inverse document frequency (tf–idf) weights

weighting scheme	tf-idf
count-idf	[math]\displaystyle{ f_{t,d} \cdot \log \frac {N} {n_t} }[/math]
double normalization-idf	[math]\displaystyle{ \left(0.5 + 0.5 \frac {f_{t,q}} {\max_t f_{t,q}}\right) \cdot \log \frac {N} {n_t} }[/math]
log normalization-idf	[math]\displaystyle{ (1 + \log f_{t,d}) \cdot \log \frac {N} {n_t} }[/math]

Then tf–idf is calculated as

[math]\displaystyle{ \mathrm{tfidf}(t,d,D) = \mathrm{tf}(t,d) \cdot \mathrm{idf}(t, D) }[/math]

A high weight in tf–idf is reached by a high term frequency (in the given document) and a low document frequency of the term in the whole collection of documents; the weights hence tend to filter out common terms. Since the ratio inside the idf's log function is always greater than or equal to 1, the value of idf (and tf–idf) is greater than or equal to 0. As a term appears in more documents, the ratio inside the logarithm approaches 1, bringing the idf and tf–idf closer to 0.

Justification of idf

Idf was introduced as "term specificity" by Karen Spärck Jones in a 1972 paper. Although it has worked well as a heuristic, its theoretical foundations have been troublesome for at least three decades afterward, with many researchers trying to find information theoretic justifications for it.

Spärck Jones's own explanation did not propose much theory, aside from a connection to Zipf's law. Attempts have been made to put idf on a probabilistic footing, by estimating the probability that a given document d contains a term t as the relative document frequency,

[math]\displaystyle{ P(t|D) = \frac{|\{d \in D: t \in d\}|}{N}, }[/math]

so that we can define idf as

[math]\displaystyle{ \begin{align} \mathrm{idf} & = -\log P(t|D) \\ & = \log \frac{1}{P(t|D)} \\ & = \log \frac{N}{|\{d \in D: t \in d\}|} \end{align} }[/math]

Namely, the inverse document frequency is the logarithm of "inverse" relative document frequency.

This probabilistic interpretation in turn takes the same form as that of self-information. However, applying such information-theoretic notions to problems in information retrieval leads to problems when trying to define the appropriate event spaces for the required probability distributions: not only documents need to be taken into account, but also queries and terms.

Link with information theory

Both term frequency and inverse document frequency can be formulated in terms of information theory; it helps to understand why their product has a meaning in terms of joint informational content of a document. A characteristic assumption about the distribution [math]\displaystyle{ p(d,t) }[/math] is that:

[math]\displaystyle{ p(d|t) = \frac{1}{|\{d \in D: t \in d\}|} }[/math]

This assumption and its implications, according to Aizawa: "represent the heuristic that tf–idf employs."

The conditional entropy of a "randomly chosen" document in the corpus [math]\displaystyle{ D }[/math], conditional to the fact it contains a specific term [math]\displaystyle{ t }[/math] (and assuming that all documents have equal probability to be chosen) is:

[math]\displaystyle{ H({\cal D}|{\cal T}=t)=-\sum_d p_{d|t}\log p_{d|t}=-\log \frac{1}{|\{d \in D: t \in d\}|}=\log \frac{|\{d \in D: t \in d\}|}{|D|} + \log |D|=-\mathrm{idf}(t)+\log |D| }[/math]

In terms of notation, [math]\displaystyle{ {\cal D} }[/math] and [math]\displaystyle{ {\cal T} }[/math] are "random variables" corresponding to respectively draw a document or a term. The mutual information can be expressed as

[math]\displaystyle{ M({\cal T};{\cal D}) = H({\cal D}) - H({\cal D}|{\cal T}) = \sum_t p_t\cdot(H({\cal D}) - H({\cal D}|W=t))=\sum_t p_t \cdot \mathrm{idf}(t) }[/math]

The last step is to expand [math]\displaystyle{ p_t }[/math], the unconditional probability to draw a term, with respect to the (random) choice of a document, to obtain:

[math]\displaystyle{ M({\cal T};{\cal D})=\sum_{t,d} p_{t|d}\cdot p_d \cdot \mathrm{idf}(t) = \sum_{t,d} \mathrm{tf}(t,d)\cdot \frac{1}{|D|}\cdot \mathrm{idf}(t) = \frac{1}{|D|} \sum_{t,d} \mathrm{tf}(t,d)\cdot \mathrm{idf}(t). }[/math]

This expression shows that summing the Tf–idf of all possible terms and documents recovers the mutual information between documents and term taking into account all the specificities of their joint distribution. Each Tf–idf hence carries the "bit of information" attached to a term x document pair.

Example of tf–idf

Suppose that we have term count tables of a corpus consisting of only two documents, as listed on the right.

Document 2

Term	Term Count
this	1
is	1
another	2
example	3

Document 1

Term	Term Count
this	1
is	1
a	2
sample	1

The calculation of tf–idf for the term "this" is performed as follows:

In its raw frequency form, tf is just the frequency of the "this" for each document. In each document, the word "this" appears once; but as the document 2 has more words, its relative frequency is smaller.

[math]\displaystyle{ \mathrm{tf}(\mathsf{''this''}, d_{1}) = \frac{1}{5} = 0.2 }[/math]

[math]\displaystyle{ \mathrm{tf}(\mathsf{''this''}, d_{2}) = \frac{1}{7} \approx 0.14 }[/math]

An idf is constant per corpus, and accounts for the ratio of documents that include the word "this". In this case, we have a corpus of two documents and all of them include the word "this".

[math]\displaystyle{ \mathrm{idf}(\mathsf{''this''}, D) = \log \left (\frac{2}{2} \right ) = 0 }[/math]

So tf–idf is zero for the word "this", which implies that the word is not very informative as it appears in all documents.

[math]\displaystyle{ \mathrm{tfidf}(\mathsf{''this''}, d_{1}, D) = 0.2 \times 0 = 0 }[/math]

[math]\displaystyle{ \mathrm{tfidf}(\mathsf{''this''}, d_{2}, D) = 0.14 \times 0 = 0 }[/math]

The word "example" is more interesting - it occurs three times, but only in the second document:

[math]\displaystyle{ \mathrm{tf}(\mathsf{''example''}, d_{1}) = \frac{0}{5} = 0 }[/math]

[math]\displaystyle{ \mathrm{tf}(\mathsf{''example''}, d_{2}) = \frac{3}{7} \approx 0.429 }[/math]

[math]\displaystyle{ \mathrm{idf}(\mathsf{''example''}, D) = \log \left (\frac{2}{1} \right ) = 0.301 }[/math]

Finally,

[math]\displaystyle{ \mathrm{tfidf}(\mathsf{''example''}, d_1, D) = \mathrm{tf}(\mathsf{''example''}, d_1) \times \mathrm{idf}(\mathsf{''example''}, D) = 0 \times 0.301 = 0 }[/math]

[math]\displaystyle{ \mathrm{tfidf}(\mathsf{''example''}, d_2, D) = \mathrm{tf}(\mathsf{''example''}, d_2) \times \mathrm{idf}(\mathsf{''example''}, D) = 0.429 \times 0.301 \approx 0.129 }[/math]

(using the base 10 logarithm).

Beyond terms

The idea behind tf–idf also applies to entities other than terms. In 1998, the concept of idf was applied to citations. The authors argued that "if a very uncommon citation is shared by two documents, this should be weighted more highly than a citation made by a large number of documents". In addition, tf–idf was applied to "visual words" with the purpose of conducting object matching in videos, and entire sentences. However, the concept of tf–idf did not prove to be more effective in all cases than a plain tf scheme (without idf). When tf–idf was applied to citations, researchers could find no improvement over a simple citation-count weight that had no idf component.

Derivatives

A number of term-weighting schemes have derived from tf–idf. One of them is TF–PDF (term frequency * proportional document frequency). TF–PDF was introduced in 2001 in the context of identifying emerging topics in the media. The PDF component measures the difference of how often a term occurs in different domains. Another derivate is TF–IDuF. In TF–IDuF, idf is not calculated based on the document corpus that is to be searched or recommended. Instead, idf is calculated on users' personal document collections. The authors report that TF–IDuF was equally effective as tf–idf but could also be applied in situations when, e.g., a user modeling system has no access to a global document corpus.

See also

• Word embedding
• Kullback–Leibler divergence
• Latent Dirichlet allocation
• Latent semantic analysis
• Mutual information
• Noun phrase
• Okapi BM25
• PageRank
• Vector space model
• Word count
• SMART Information Retrieval System

References

• Salton, G; McGill, M. J. (1986). Introduction to modern information retrieval. McGraw-Hill. ISBN 978-0-07-054484-0. https://archive.org/details/introductiontomo00salt. 
• Salton, G.; Fox, E. A.; Wu, H. (1983). "Extended Boolean information retrieval". Communications of the ACM 26 (11): 1022–1036. doi:10.1145/182.358466. 
• Salton, G.; Buckley, C. (1988). "Term-weighting approaches in automatic text retrieval". Information Processing & Management 24 (5): 513–523. doi:10.1016/0306-4573(88)90021-0. https://ecommons.cornell.edu/bitstream/1813/6721/1/87-881.pdf. 
• Wu, H. C.; Luk, R.W.P.; Wong, K.F.; Kwok, K.L. (2008). "Interpreting TF-IDF term weights as making relevance decisions". ACM Transactions on Information Systems 26 (3): 1. doi:10.1145/1361684.1361686. 

External links and suggested reading

• Gensim is a Python library for vector space modeling and includes tf–idf weighting.
• Anatomy of a search engine
• tf–idf and related definitions as used in Lucene
• TfidfTransformer in scikit-learn
• Text to Matrix Generator (TMG) MATLAB toolbox that can be used for various tasks in text mining (TM) specifically i) indexing, ii) retrieval, iii) dimensionality reduction, iv) clustering, v) classification. The indexing step offers the user the ability to apply local and global weighting methods, including tf–idf.
• Term-frequency explained Explanation of term-frequency