Skip Navigation

The Computer Journal 1975 18(2):164-168; doi:10.1093/comjnl/18.2.164
© 1975 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rohlf, F. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A new approach to the computation of the Jardine-Sibson Bk clusters

F. J. Rohlf *

Department of Ecology and Evolution, State University of New York at Sony Brook, Stony Brook, New York, USA

A new approach to the computation of Jardine and Sibson's (1968a) (fine) k-cluster method Bk is described. The algorithm makes use of the fact that the set of dissimilarities which are invariant under the Bk clustering transformation can be represented as an abstract graph. The proposed algorithms for computing this graph obtains both the (weak) k-ultrametric dissimilarity matrix and the k-clusters simultaneously.

Received March 1972. revised March 1974.

* Department of Ecology and Evolution, State University of New York at Sony Brook, Stony Brook, New York 11794, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.