ON A PROBABILISTIC APPROACH TO DETERMINING THE SIMILARITY BETWEEN BOOLEAN SEARCH REQUEST FORMULATIONS

• Published in: Journal of documentation Vol. 38; no. 1; pp. 14 - 28
• Main Author: RADECKI, TADEUSZ
• Format: Journal Article
• Language: English
• Published: London MCB UP Ltd 01.01.1982; Aslib, etc
• Subjects: Boolean strategies; Clustering; File organization; Information storage and retrieval; Information work; Searching; Subject indexing; Technical services
• ISSN: 0022-0418; 1758-7379
• DOI: 10.1108/eb026719

A new and promising approach to document clustering consists of utilizing previously formed clusters of queries to cluster documents. To employ this approach in practice a similarity measure for queries must be available. This requirement does not cause any problem in the case of information retrieval systems in which both the search request formulations and document representations are sets of weighted or unweighted index terms. However, in most operational retrieval systems search request formulations are Boolean combinations of index terms. Research into similarity measures for search request formulations of this type has already been undertaken by the author and reported elsewhere. The present paper provides further results of investigations in this area. The novelty of the approach discussed is the incorporation within the methodology described earlier of a weighting mechanism to indicate the relative importance of particular attributes of a given Boolean search request formulation. A modification suggested is based on the standard probabilistic approach to information retrieval.