Probabilistic retrieval based on staged logistic regression

ABSTRACT

The goal of a probabilistic retrieval system design is to rank the elements of the search universe in descending order of their estimated probability of usefulness to the user. Previously explored methods for computing such a ranking have involved the use of statistical independence assumptions and multiple regression analysis on a learning sample. In this paper these techniques are recombined in a new way to achieve greater accuracy of probabilistic estimate without undue additional computational complexity. The novel element of the proposed design is that the regression analysis be carried out in two or more levels or stages. Such an approach allows composite or grouped retrieval clues to be analyzed in an orderly manner -- first within groups, and then between. It compensates automatically for systematic biases introduced by the statistical simplifying assumptions, and gives rise to search algorithms of reasonable computational efficiency.

REFERENCES

• 1: Bookstein, A. Probability and fuzzy set applications to information retrieval. In M. Williams (ed.), Annual Review of Information Science and Technology, 20, White Plains, NY: Knowledge Industry Publications. 1985.
• 2: Abraham Bookstein, Implications of Boolean structure for probabilistic retrieval, Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, p.11-17, June 05-07, 1985, Montreal, Quebec, Canada [doi>10.1145/253495.253505]
• 3: Abraham Bookstein , Edward O'Neill , Martin Dillon , David Stephens, Application of loglinear models to informetric phenomena, Information Processing and Management: an International Journal, v.28 n.1, p.75-88, Jan. 1992 [doi>10.1016/0306-4573(92)90094-G]
• 4: Collett, D. Modelling Binary Data. London: Chapman & Hall; 1991.
• 5: Cooper, W. S. The Inadequacy of Probability of Usefulness as a Ranking Criterion for Retrieval System Output. Xeroxed report, School of Library and Information Studies, University of California, Berkeley, CA 94720, 1973.
• 6: W. S. Cooper , M. E. Maron, Foundations of Probabilistic and Utility-Theoretic Indexing, Journal of the ACM (JACM), v.25 n.1, p.67-80, Jan. 1978 [doi>10.1145/322047.322053]
• 7: Cooper, W. S. Exploiting the maximum entropy principle to increase retrieval effectiveness. Journal of the American Society for Information Science, 34(1): 31-39; 1983.
• 8: Cooper, W. S. Probability theory as the basis of text retrieval. Proceedings of the 54th Annual Meeting of the American Society for Information Science, vol. 28. Washington, D. C: 366-369. October 1991a.
• 9: William S. Cooper, Some inconsistencies and misnomers in probabilistic information retrieval, Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval, p.57-61, October 13-16, 1991, Chicago, Illinois, United States [doi>10.1145/122860.122866]
• 10: Cooper, W. S.; Huizinga, P. The maximum entropy principle and its application to the design of probabilistic retrieval systems. Information Technology: Research and Development, 1(2): 99-112; 1982.
• 11: Edward Alan Fox, Extending the boolean and vector space models of information retrieval with p-norm queries and multiple concept types, 1983
• 12: Norbert Fuhr, Optimum polynomial retrieval functions based on the probability ranking principle, ACM Transactions on Information Systems (TOIS), v.7 n.3, p.183-204, July 1989 [doi>10.1145/65943.65944]
• 13: Norbert Fuhr , Chris Buckley, A probabilistic learning approach for document indexing, ACM Transactions on Information Systems (TOIS), v.9 n.3, p.223-248, July 1991 [doi>10.1145/125187.125189]
• 14: Norbert Fuhr , Ulrich Pfeifer, Combining model-oriented and description-oriented approaches for probabilistic indexing, Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval, p.46-56, October 13-16, 1991, Chicago, Illinois, United States [doi>10.1145/122860.122865]
• 15: Gordon, M. D.; Lenk, P. A utility theoretic examination of the probability ranking principle in information retrieval. Journal of the American Society for Information Science 42(10): 703-714; 1991.
• 16: Harman, D. User-Friendly Systems Instead of User-Friendly Front-Ends. Journal of the American Society for Information Science, 43(2): 164-174; 1992.
• 17: Harper, D. J.; Van Rijsbergen, C. J. An evaluation of feedback in document retrieval using co-occurrence data. Journal of Documentation, 34(3): 189-216; 1978.
• 18: Hosmer, D. W.; Lemeshow, S. Applied Logistic Regression. New York" Wiley; 1989.
• 19: Kantor, P. Maximum entropy and the optimal design of automated information retrieval systems. Information Technology: Research and Development, 3(2): 88-94; 1984.
• 20: Lee, J. J.; Kantor, P. A study of probabilistic information retrieval systems in the case of inconsistent expert judgement. Journal of the American Society for Information Science, 42(3), 1990.
• 21: Maron, M. E. Probabilistic Retrieval Models. In B. Dervin and M. Voigt (Eds.), Progress in Communication Sciences, Vol. V, Ablex, 1984, pp. 145-176.
• 22: M. E. Maron , J. L. Kuhns, On Relevance, Probabilistic Indexing and Information Retrieval, Journal of the ACM (JACM), v.7 n.3, p.216-244, July 1960 [doi>10.1145/321033.321035]
• 23: Robertson, S. E. The probability ranking principle in IR. Journal of Documentation: 33, 294-304; 1977.
• 24: Robertson, S. E; Bovey, J. D. Statistical problems in the application of probabilistic models to information retrieval. British Library Research and Development Department, Report No. 5739, November 1982.
• 25: Robertson, S. E.; Sparck Jones, K. Relevance weighting of search terms. Journal of the American Society for Information Science, 27(3): 129-146; 1976.
• 26: Karen Sparck Jones, Information Retrieval Experiment, Butterworth-Heinemann, Newton, MA, 1981
• 27: van Rijsbergen, C. J. A theoretical basis for the use of co-occurrence data in information retrieval. Journal of Documentation, 33(2): 106-119; 1977.
• 28: C. J. Van Rijsbergen, Information Retrieval, Butterworth-Heinemann, Newton, MA, 1979
• 29: Yu, C.T.; Buckley, C.; Lam, H.; Salton, G. A generalized term dependence model in information retrieval. Information Technology: Research and Development, 2: 129-154; 1983.
• 30: C. T. Yu , G. Salton, Precision Weighting—An Effective Automatic Indexing Method, Journal of the ACM (JACM), v.23 n.1, p.76-88, Jan. 1976 [doi>10.1145/321921.321930]

INDEX TERMS

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

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Probabilistic algorithms (including Monte Carlo)

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

General Terms:
Algorithms, Design