A consistent technique for filling of unimodal clusters

MaRDI QIDQ1914135zbMATH OpenFDO

Authors A. P. Kovalenko

Publication date 6 June 1996

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

classificationcluster analysisfilling techniquelinear computational complexitytraining sampleunimodal clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Review text

In cluster analysis, besides constructing a classification, we often encounter the problem of adding new observations to classes so that the filling technique remains consistent with the classification method with increase in ``training sample size and, furthermore, fewer computations are required for filling than for classification. A consistent filling technique based on the algorithm is proposed here for unimodal clustering. The method has linear computational complexity and is easily implemented on parallel computing systems with independent memories, e.g., on transputer networks.

Recommendations

• A unimodal clustering algorithm based on the \(k\)-nearest neighbors method
• The method of principal clusters
• A new approach to clustering
• Hierarchical clustering schemes
• scientific article; zbMATH DE number 3850307

Cited in

(1)

• A unimodal clustering algorithm based on the \(k\)-nearest neighbors method

This page was built for publication: A consistent technique for filling of unimodal clusters

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