Skip Navigation

The Computer Journal 1971 14(2):156-157; doi:10.1093/comjnl/14.2.156
© 1971 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 (23)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sibson, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Some observations on a paper by Lance and Williams

R. Sibson *

King's College Research Centre, King's College, Cambridge, UK

This paper presents criteria which are considered essential for any general clustering algorithm and shows that the algorithm of Lance and Williams fails to satisfy these.

Received June 1969.

* King's College Research Centre, King's College, Cambridge


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


This article has been cited by other articles:


Home page
 JOURNAL OF EDUCATIONAL AND BEHAVIORAL STATISTICSHome page
L. Hubert and F. B. Baker
Data Analysis by Single-Link and Complete-Link Hierarchical Clustering
Journal of Educational and Behavioral Statistics, January 1, 1976; 1(2): 87 - 111.
[Abstract] [PDF]

Home page
 REVIEW OF EDUCATIONAL RESEARCHHome page
F. B. Baker
Numerical Taxonomy for Educational Researchers
Review of Educational Research, January 1, 1972; 42(3): 345 - 358.
[PDF]


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.