Optimum polynomial retrieval functions based on the probability ranking principle

ABSTRACT

We show that any approach to developing optimum retrieval functions is based on two kinds of assumptions: first, a certain form of representation for documents and requests, and second, additional simplifying assumptions that predefine the type of the retrieval function. Then we describe an approach for the development of optimum polynomial retrieval functions: request-document pairs (fl, dm) are mapped onto description vectors x(fl, dm), and a polynomial function e(x) is developed such that it yields estimates of the probability of relevance P(R | x (fl, dm) with minimum square errors. We give experimental results for the application of this approach to documents with weighted indexing as well as to documents with complex representations. In contrast to other probabilistic models, our approach yields estimates of the actual probabilities, it can handle very complex representations of documents and requests, and it can be easily applied to multivalued relevance scales. On the other hand, this approach is not suited to log-linear probabilistic models and it needs large samples of relevance feedback data for its application.

REFERENCES

• 1: P. Biebricher , N. Fuhr , G. Lustig , M. Schwantner , G. Knorz, The automatic indexing system AIR/PHYS - from research to applications, Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval, p.333-342, May 1988, Grenoble, France [doi>10.1145/62437.62470]
• 2: BOLLMANN, P., JOCHUM, R., REINER, U., WEISSMANN, V., AND ZUSE, H. Planung und Durchfiihrung der Retrievaltests. In Leistungsbewertung yon Information Retrieval Verfahren (LIVE), H.-J. Schneider et al., eds. TU Berlin, Fachbereich Informatik, Computergestfitzte Informationssysteme (CIS), Institut fiir Angewandte Informatik, 1986, pp. 183-212.
• 3: BOOKSTEIN, A. Logtinear Analysis of Library Data. Research Report, OCLC, Office of Research, 1988.
• 4: BOOKSTEIN, A. Outline of a general probabilistic retrieval model. J. Doc. 39, 2 (1983), 63-72.
• 5: W. Bruce Croft, Approaches to intelligent information retrieval, Information Processing and Management: an International Journal, v.23 n.4, p.249-254, July 1987 [doi>10.1016/0306-4573(87)90016-1]
• 6: DUI)A, R. O., AND HART, P.E. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
• 7: Norbert Fuhr, Models for retrieval with probabilistic indexing, Information Processing and Management: an International Journal, v.25 n.1, p.55-72, 1989 [doi>10.1016/0306-4573(89)90091-5]
• 8: FUnR, N. A probabilistic model of dictionary based automatic indexing. In Proceedings of the Riao 85 (Recherche d'informations Assistee par Ordinateur) (Grenoble, France, March 18-20). 1985, pp. 207-216.
• 9: FUHR, N. Probabilistisches lndexing und Retrieval. Fachinformationszentrum Karlsruhe, Eggenstein-Leopoldshafen, West Germany, 1988.
• 10: Norbert Fuhr, Two models of retrieval with probabilistic indexing, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.249-257, September 1986, Palazzo dei Congressi, Pisa, Italy [doi>10.1145/253168.253221]
• 11: N. Fuhr , H. Huther, Optimum probability estimation based on expectations, Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval, p.257-273, May 1988, Grenoble, France [doi>10.1145/62437.62459]
• 12: Norbert Fuhr, Models for retrieval with probabilistic indexing, Information Processing and Management: an International Journal, v.25 n.1, p.55-72, 1989 [doi>10.1016/0306-4573(89)90091-5]
• 13: N. Fuhr , G. E. Knorz, Retrieval test evaluation of a rule based automatic indexing (AIR/PHYS), Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval, p.391-408, November 1984, King's College, Cambridge
• 14: M. Gordon, Probabilistic and genetic algorithms in document retrieval, Communications of the ACM, v.31 n.10, p.1208-1218, Oct. 1988 [doi>10.1145/63039.63044]
• 15: KEEN, E. M. Evaluation parameters. In The SMART Retrieval System--Experiments in Automatic Document Processing, G. Salton, ed. Prentice Hall, Englewood Cliffs, N.J., 1971, pp. 74-112.
• 16: KNORZ, G. Automatisches Indexieren als Erkennen abstrakter Objekte. Niemeyer, Tfibingen, West Germany, 1983.
• 17: Gerhard Knorz, A decision theory approach to optimal automatic indexing, Proceedings of the 5th annual ACM conference on Research and development in information retrieval, p.174-193, May 18-20, 1982, West Berlin, Germany
• 18: KONSTANTIN, J. Untersuchung yon nach dem Quadratmittel-Polynomansatz erstellten Ranking{unktionen. Diplomarbeit, TH Darmstadt, FB Informatik, Datenverwaltungssysteme II, Darmstadt, West Germany 1985.
• 19: LUSTlCL G. Automatische Indexierung zwischen Forschung und Anwendung. Olms, Hildesheim, West Germany 1986.
• 20: C. J. Van Rijsbergen, Information Retrieval, Butterworth-Heinemann, Newton, MA, 1979
• 21: ROBERTSON, S.E. The probability ranking principle in IR. J. Doc. 33 (1977), 294-304.
• 22: ROBERTSON, S. E., MARON, M. E., AND COOPER, W.S. Probability of relevance: A unification of two competing models for document retrieval. Inf. Tech. Res. 1 (1982), 1-21.
• 23: ROCCHIO, J.J. Relevance feedback in information retrieval. In The SMART Retrieval System~ Experiments in Automatic Document Processing, G. Salton, ed. Prentice Hall, Englewood Cliffs, N.J., 1971.
• 24: G. Salton, The SMART Retrieval System—Experiments in Automatic Document Processing, Prentice-Hall, Inc., Upper Saddle River, NJ, 1971
• 25: SCHORMANN, J. Polynomklassifikatoren fur die Zeichenerkennung. Ansatz, Adaption, Anwendung. Oldenbourg, M/inchen, West Germany, 1977.
• 26: S. K.M. Wong , Y. Y. Yao, Linear structure in information retrieval, Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval, p.219-232, May 1988, Grenoble, France [doi>10.1145/62437.62452]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.2 Approximation
          Subjects: Least squares approximation

  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods

General Terms:
Experimentation, Theory