Skip Navigation

The Computer Journal 1968 11(1):57-62; doi:10.1093/comjnl/11.1.57
© 1968 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 (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Shepherd, M. J.
Right arrow Articles by Willmott, A. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Cluster analysis on the Atlas computer

M. J. Shepherd1 * and A. J. Willmott2 §

1 Department of Mathematics, Computation Division, The University of Manchester Institute of Science and Technology, P.O. Box 88, Sackville Street, Manchester, UK, 2 Department of Computation, The University of York, Heslington, UK

This paper discusses the programming implementation of Sneath's Single Link Taxometric Analysis for the Atlas 1 computer and the modification of this method which the authors have developed to overcome any chaining that occurs between otherwise well separated clusters. Two distinct algorithms are presented for Single Link Analysis.

First received June 1967.

* Department of Mathematics, Computation Division, The University of Manchester Institute of Science and Technology, P.O. Box 88, Sackville Street, Manchester, 1.

§ Department of Computation, The University of York, Heslington, York.


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.