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

Open Access

1 January 1970

journal article
Published by Oxford University Press (OUP) in The Computer Journal

Vol. 13 (2) , 156-163
https://doi.org/10.1093/comjnl/13.2.156

Abstract

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.

Keywords

JARDINE SIBSON
IMPROVED ALGORITHM
PARTITION
OVERLAPPING CLUSTERS
SIBSON METHOD
GENERATING OVERLAPPING

This publication has 0 references indexed in Scilit: