A note on the use of nearest neighbors for implementing single linkage document classifications

Peter Willett

Journal of the American Society for Information Science, 1984, vol. 35, issue 3, 149-152

Abstract: Best match search algorithms provide an efficient means of identifying the sets of nearest neighbors for each of the documents in a collection. These sets contain much of the important similarity data contained in a full interdocument similarity matrix and may be used for the generation of hierarchic document classifications, such as those arising from the use of the single linkage clustering method. Cluster based retrieval experiments based upon such classifications are shown to give results that are comparable in effectiveness with those obtained using the full similarity matrix.

Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630350303

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:35:y:1984:i:3:p:149-152

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().