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

An evaluation of the applicability of ranking algorithms to improve the effectiveness of full‐text retrieval. II. On the effectiveness of ranking algorithms on full‐text retrieval

Author

Listed:
  • Jung Soon Ro

Abstract

In Part I of this study [2], it was found that full‐text retrieval resulted in significantly higher recall and lower precision, compared with that of paragraphs, abstracts, and controlled vocabularies. In the present article (Part II of the study), document‐term‐weighting algorithms proposed in past research for automatic extractive indexing were examined as a means to improve the low precision of full‐text retrieval. As a laboratory experiment, the precision of full‐text retrieval enhanced by 29 algorithms was examined at the lowest, middle, and highest levels of recall, and compared with that of full‐text retrieval without algorithms and to paragraph retrieval. The over‐all effectiveness of seven representative algorithms was displayed and investigated in recall and precision graphs. Twenty‐nine algorithms significantly improved the low precision of full‐text retrieval, and 22 of 29 algorithms achieved higher precision than that of paragraph searching at the same level of recall, although these results were not statistically significant. However, there was no significant difference between algorithms, although the precision of the 29 algorithms varied considerably. The relative performance of algorithms seemed to depend on the search strategy employed and on the level of recall at which precision was measured. © 1988 John Wiley & Sons, Inc.

Suggested Citation

  • Jung Soon Ro, 1988. "An evaluation of the applicability of ranking algorithms to improve the effectiveness of full‐text retrieval. II. On the effectiveness of ranking algorithms on full‐text retrieval," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 39(3), pages 147-160, May.
  • Handle: RePEc:bla:jamest:v:39:y:1988:i:3:p:147-160
    DOI: 10.1002/(SICI)1097-4571(198805)39:33.0.CO;2-O
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(198805)39:33.0.CO;2-O
    Download Restriction: no

    File URL: https://libkey.io/10.1002/(SICI)1097-4571(198805)39:33.0.CO;2-O?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:39:y:1988:i:3:p:147-160. 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.