scientific article; zbMATH DE number 3969923

From MaRDI portal
Publication:3736743





This small monograph provides a descriptive account of the algorithms for clustering and nearest neighbour analysis. Starting from the simple algorithms like the single and complete linkage it extends to contiguity constrained clustering and interaction data. Application of these algorithms to pattern recognition and information storage and retrieval has been indicated. A special feature is the specification of the complexity of computation in terms of the number of steps involved. The relative merits of the algorithms are also touched upon. The monograph is addressed to the computationally oriented worker and succeeds in providing a rapid survey of the recent developments in the algorithms.




Cited in
(29)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736743)