An analysis of vector space models based on computational geometry

  • Authors:
  • Z. W. Wang;S. K. M. Wong;Y. Y. Yao

  • Affiliations:
  • Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2

  • Venue:
  • SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper analyzes the properties, structures and limitations of vector-based models for information retrieval from the computational geometry point of view. It is shown that both the pseudo-cosine and the standard vector space models can be viewed as special cases of a generalized linear model. More importantly, both the necessary and sufficient conditions have been identified, under which ranking functions such as the inner-product, cosine, pseudo-cosine, Dice, covariance and product-moment correlation measures can be used to rank the documents. The structure of the solution region for acceptable ranking is analyzed and an algorithm for finding all the solution vectors is suggested.