Similarity and stability analysis of the two partitioning type clustering algorithms

Fazli Can and Esen A. Ozkarahan

Journal of the American Society for Information Science, 1985, vol. 36, issue 1, 3-14

Abstract: The similarity and stability analysis of the two partitioning type clustering algorithms, which appeared in this journal recently, are presented with respect to two different metrics. This article also includes other aspects of the algorithms, such as the number and size of the clusters generated, the similarity between the members of a cluster and the corresponding centroid, and other relevant details. In the experiments, a document collection consisting of the titles, abstracts, and keywords of 167 ACM TODS publications was used.

Date: 1985
References: Add references at CitEc
Citations:

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

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:36:y:1985:i:1:p:3-14

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 ().