Skip Navigation

The Computer Journal 1970 13(2):156-163; doi:10.1093/comjnl/13.2.156
© 1970 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 (20)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cole, A. J.
Right arrow Articles by Wishart, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An improved algorithm for the Jardine-Sibson method of generating overlapping clusters

A. J. Cole * and D. Wishart *

Computing Laboratory, University of St. Andrews, St. Andrews, Fife, UK

An improved algorithm for generating k-partition overlapping clusters is discussed. Jardine and Sibson (1968) proposed the basic algorithm and suggested that it was likely that an improved algorithm could be found. In addition an attempt is made to automate the subsequent process of cluster recognition.

Received July 1969.

* Computing Laboratory, University of St. Andrews, St. Andrews, Fife


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
 Neural Comput.Home page
D. J. Navarro and T. L. Griffiths
Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach
Neural Comput., November 1, 2008; 20(11): 2597 - 2628.
[Abstract] [Full Text] [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.