Comparing Two Algorithms for Document Retrieval using Citation Links
This investigation compared the retrieval effectiveness of a one‐pass algorithm which employs a simple similarity calculation to that of the more complex multi‐pass Schiminovich algorithm. By means of lists of proposed relevant citations from users, searches on the AIP SPIN data base were conducted,...
Saved in:
| Published in: | Journal of the American Society for Information Science Vol. 28; no. 4; pp. 192 - 195 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, N.Y
American Documentation Institute
01.07.1977
Wiley Periodicals Inc |
| Subjects: | |
| ISSN: | 0002-8231, 1097-4571 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This investigation compared the retrieval effectiveness of a one‐pass algorithm which employs a simple similarity calculation to that of the more complex multi‐pass Schiminovich algorithm. By means of lists of proposed relevant citations from users, searches on the AIP SPIN data base were conducted, resulting in two ordered lists of documents for each request. Recall/precision plots, based on user evaluations, illustrated that the average performance of the Schiminovich algorithm is marginally worse than that of the similarity algorithm. Thus, a relatively inexpensive procedure is sufficient to provide quite satisfactory document retrieval performance from citation data alone. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Statistics/Data Report-1 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0002-8231 1097-4571 |
| DOI: | 10.1002/asi.1977.28.4.192 |