.png){kind=icon}
Return
Constraint-based clustering selection
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-017-5643-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering requires the user to define a distance metric, select a clustering algorithm, and set the hyperparameters of that algorithm. Getting these right, so that a clustering is obtained that meets the users subjective criteria, can be difficult and tedious. Semi-supervised clustering methods make this easier by letting the user provide must-link or cannot-link constraints. These are then used to automatically tune the similarity measure and/or the optimization criterion. In this paper, we investigate a complementary way of using the constraints: they are used to select an unsupervised clustering method and tune its hyperparameters. It turns out that this very simple approach outperforms all existing semi-supervised methods. This implies that choosing the right algorithm and hyperparameter values is more important than modifying an individual algorithm to take constraints into account. In addition, the proposed approach allows for active constraint selection in a more effective manner than other methods.
Keywords:
Constraint-based clustering
Algorithm and hyperparameter selection
Active constraint selection
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveFluorescent Nanostructures from Aromatic Diblock Copolymers via Atom Transfer Radical Polymerization
PREAI
ShareSaveShareSave
View more