Soft clustering by convex electoral model

DOI10.1007/s00500-020-05148-4zbMath1491.62052OpenAlexW2783844568MaRDI QIDQ2156895

Yu. E. Nesterov

Publication date: 21 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-020-05148-4

zbMATH Keywords

fuzzy clusteringsoft clusteringC-meanselectoral modelspolynomial-time complexity bounds

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multivariate analysis and fuzziness (62H86)

Related Items (2)

To the special issue dedicated to the 3rd international conference ``Numerical computations: theory and algorithms -- NUMTA 2019 June 15--21, 2019, Isola Capo Rizzuto, Italy ⋮ Network manipulation algorithm based on inexact alternating minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• NP-hardness of Euclidean sum-of-squares clustering
• A survey of fuzzy clustering
• Introductory lectures on convex optimization. A basic course.
• The complexity of the generalized Lloyd - Max problem (Corresp.)
• Random Projection Trees for Vector Quantization
• Excessive Gap Technique in Nonsmooth Convex Minimization
• A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

This page was built for publication: Soft clustering by convex electoral model