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

DOI10.1093/comjnl/13.2.156zbMath0191.18405OpenAlexW2036126869MaRDI QIDQ5585049

David M. G. Wishart, A. J. Cole

Publication date: 1970

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/13.2.156

zbMATH Keywords

computer science and automata

Related Items (4)

Clustering in Hypergraphs to Minimize Average Edge Service Time ⋮ Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach ⋮ Some applications of graph theory to clustering ⋮ A set-theoretical approach to the problem of hierarchical clustering

This page was built for publication: An improved algorithm for the Jardine-Sibson method of generating overlapping clusters