Loading…
Convex fuzzy k-medoids clustering
K-medoids clustering is among the most popular methods for cluster analysis despite its use requiring several assumptions about the nature of the latent clusters. In this paper, we introduce the Convex Fuzzy k-Medoids (CFKM) model, which not only relaxes the assumption that objects must be assigned...
Saved in:
Published in: | Fuzzy sets and systems 2020-06, Vol.389, p.66-92 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | K-medoids clustering is among the most popular methods for cluster analysis despite its use requiring several assumptions about the nature of the latent clusters. In this paper, we introduce the Convex Fuzzy k-Medoids (CFKM) model, which not only relaxes the assumption that objects must be assigned entirely to one and only one medoid, but also that medoids must be assigned entirely to one and only one cluster. The resulting model is convex, thus its resolution is completely robust to initialization. To illustrate the usefulness of the CFKM model, we compare it with two fuzzy k-medoids clustering models: the Fuzzy k-Medoids (FKM) and the Fuzzy Clustering with Multi-Medoids (FMMdd), both solved approximately by heuristics because of their hard computational complexity. Our experiments with both synthetic and real-world data as well as a user survey reveal that the model is not only more robust to the choice hyperparameters of the fuzzy clustering task, but also that it can uniquely discover important aspects of data inherently fuzzy in nature. |
---|---|
ISSN: | 0165-0114 1872-6801 |
DOI: | 10.1016/j.fss.2020.01.001 |