Article Output ranking methodology for document-clustering-based Boolean retrieval systems Share on Author: Tadeusz Radecki Technical University of Wroclaw, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland and Department of Computer Science, Louisiana State University, Baton Rouge, Louisiana Technical University of Wroclaw, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland and Department of Computer Science, Louisiana State University, Baton Rouge, LouisianaView Profile Authors Info & Claims SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrievalJune 1985 Pages 70–76https://doi.org/10.1145/253495.253511Online:05 June 1985Publication History 2citation318DownloadsMetricsTotal Citations2Total Downloads318Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Abstract The aim of this article is to propose a means of determining the similarity between search request formulations, which are Boolean combinations of descriptors. The similarity measures introduced can be used to cluster Boolean search request formulations. The search request formulation clusters can in turn be utilized in methods for clustering document representations. The initiation of the work on the methodology for determining similarity measures for Boolean search request formulations has been encouraged by hitherto performed experimental research into information retrieval systems with search request formulations in the form of sets of certain descriptors, i.e., in the same form as document representations. These experiments have shown a preponderance of those methods for clustering document representations that use previously formed clusters of search request formulations. We can expect that by using the proposed methodology for determining the similarity between Boolean combinations of descriptors, we might obtain similar results for the case of Boolean search request formulations. The introductory part of the article provides the background for undertaking the research reported. The underlying notions are then presented, and the proposed measures of similarity between Boolean search request formulations are justified and illustrated by examples. In addition, some experimental results concerning the suggested similarity measures are given.

Abstract Up to the present a number of theoretical approaches has been developed in order to improve the effectiveness and/or efficiency of information retrieval. However, most of the information retrieval methods based on these approaches have never passed the stage of purely theoretical investigation, and experimentation, if carried out at all, has been very limited in scale. A closer examination of current theoretical developments and the present practice of information retrieval reveals that a combination of the existing theory of probabilistic retrieval into a practical methodology based on Boolean searches would be very promising. Such an extension of the probabilistic approach to information retrieval is outlined.