IRRA (IR-Ra) group participated in the 2009 Web track (both adhoc task and diversity task) and the Million Query track. In this year, the major concern is to examine the effectiveness of a novel, nonparametric index term weighting model, divergence from independence (DFI). The notion of independence, which is the notion behind the well-known statistical exploratory data analysis technique called the correspondence analysis (Greenacre, 1984; Jambu, 1991), can be adapted to the index term weighting problem. In this respect, it can be thought of as a qualitative description of the importance of terms for documents, in which they appear, importance in the sense of contribution to the information contents of documents relative to other terms. According to the independence notion, if the ratios of the frequencies of two different terms are the same across documents, they are independent from documents. For example, each Web page contains a pair of “html” and a pair of “body” tags, so that the ratio of frequencies of these tags is the same across all Web pages, indicating that the “html” and “body” tags are independent from Web pages. They are used by design, irrespective of the information contents of Web pages. On the other hand, some tags, such as “image”, “table”, which are also independent from Web pages, may occur less or more in some pages than the expected frequencies suggested by the independence model; so, their associated frequency ratios may not be the same for all Web pages. However, it is reasonable to expect that, if the pages are not about the tags’ usage, such as a “HTML Handbook”, frequencies of those tags should not be significantly different from their expected frequencies: they should be close to the expectation, i.e., in a parametric point of view, their observed frequencies on individual documents should be attributed to chance fluctuation. Although this tag example is helpful in exemplifying the use of independence notion, it is obvious that the tags are artificial, and so, governed by some rules completely different from the rules of a spoken language. Nonetheless, some words, like the ones in a common “stopwords list”, appear in documents, not because of their contribution to the information contents of documents, but because of the grammatical rules. On this account, such words can be modeled as if they were tags, because they are independent from documents in the same manner. Their observed frequencies in individual documents is expected to fluctuate around their frequencies expected under independence, as in the case of tags. Content bearing words are, therefore, the words whose frequencies highly diverge from the frequencies expected under independence. The results of the TREC experiments about IRRA runs show that the independence notion promises a natural basis for quantifying the categorical relationships between the terms and the documents. The TERRIER retrieval platform (Ounis et al., 2007) is used to index and search the ClueWeb09-T09B data set, a subset of about 50 million Web pages in English (TREC 2009 “Category B” data set). During indexing and searching, terms are stemmed and a particular set of stop words are eliminated.
[1]
Stephen P. Harter,et al.
A probabilistic approach to automatic keyword indexing. Part I. On the Distribution of Specialty Words in a Technical Literature
,
1975,
J. Am. Soc. Inf. Sci..
[2]
R. Clarke,et al.
Theory and Applications of Correspondence Analysis
,
1985
.
[3]
Stephen E. Robertson,et al.
Probabilistic models of indexing and searching
,
1980,
SIGIR '80.
[4]
Bekir Taner Dinçer.
Statistical principal components analysis for retrieval experiments
,
2007,
J. Assoc. Inf. Sci. Technol..
[5]
C. J. van Rijsbergen,et al.
Probabilistic models of information retrieval based on measuring the divergence from randomness
,
2002,
TOIS.
[6]
David J. Groggel,et al.
Practical Nonparametric Statistics
,
2000,
Technometrics.
[7]
Gerard Salton,et al.
Term-Weighting Approaches in Automatic Text Retrieval
,
1988,
Inf. Process. Manag..
[8]
Karen Spärck Jones.
A statistical interpretation of term specificity and its application in retrieval
,
2021,
J. Documentation.
[9]
Stephen P. Harter,et al.
A probabilistic approach to automatic keyword indexing. Part II. An algorithm for probabilistic indexing
,
1975,
J. Am. Soc. Inf. Sci..
[10]
Ian T. Jolliffe.
10. Exploratory and Multivariate Data Analysis
,
1993
.