REFCMFS combines a robust distance loss with an exact L0 sparsity constraint on fuzzy memberships, selecting the nearest clusters for each point.
Modified global k-means algorithm for minimum sum- of-squares clustering problems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Robust and Efficient Fuzzy C-Means Clustering Constrained on Flexible Sparsity
REFCMFS combines a robust distance loss with an exact L0 sparsity constraint on fuzzy memberships, selecting the nearest clusters for each point.