IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v33y1982i1p8-17.html
   My bibliography  Save this article

Similarity measures for boolean search request formulations

Author

Listed:
  • Tadeusz Radecki

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.

Suggested Citation

  • Tadeusz Radecki, 1982. "Similarity measures for boolean search request formulations," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 33(1), pages 8-17, January.
  • Handle: RePEc:bla:jamest:v:33:y:1982:i:1:p:8-17
    DOI: 10.1002/asi.4630330104
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630330104
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.4630330104?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:33:y:1982:i:1:p:8-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.