Term discrimination is a way to rank keywords in how useful they are for information retrieval.
This is a method similar to tf-idf but it deals with finding keywords suitable for information retrieval and ones that are not. Please refer to Vector Space Model first.
This method uses the concept of Vector Space Density that the less dense an occurrence matrix is, the better an information retrieval query will be.
An optimal index term is one that can distinguish two different documents from each other and relate two similar documents. On the other hand, a sub-optimal index term can not distinguish two different document from two similar documents.
The discrimination value is the difference in the occurrence matrix's vector-space density versus the same matrix's vector-space without the index term's density.
Let:
A
Ak
k
Q(A)
A
k
DVk=Q(A)-Q(Ak)
Given an occurrency matrix:
A
k
C
Di
C
Di
C
k
K
A higher value is better because including the keyword will result in better information retrieval.
Keywords that are sparse should be poor discriminators because they have poor recall,whereaskeywords that are frequent should be poor discriminators because they have poor precision.