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

Indexing exhaustivity and the computation of similarity matrices

Author

Listed:
  • Alan F. Harding
  • Peter Willett

Abstract

Some of the automatic classification procedures used in information retrieval derive clusters of documents from an intermediate similarity matrix, the computation of which involves comparing each of the documents in the collection with all of the others. It has recently been suggested that many of these comparisons, specifically those between documents having no terms in common, may be avoided by means of the use of an inverted file to the document collection. This communication shows that the approach will effect reductions in the number of interdocument comparisons only if the documents are each indexed by a limited number of indexing terms; if exhaustive indexing is used, many document pairs will be compared several times over and the computation will be greater than when conventional approaches are used to generate the similarity matrix.

Suggested Citation

  • Alan F. Harding & Peter Willett, 1980. "Indexing exhaustivity and the computation of similarity matrices," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 31(4), pages 298-300, August.
    • Handle: RePEc:bla:jamest:v:31:y:1980:i:4:p:298-300
    DOI: 10.1002/asi.4630310411
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630310411
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.4630310411?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:31:y:1980:i:4:p:298-300. 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.