.png){kind=icon}
返回
Constraint-based clustering selection
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-017-5643-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Constraint-based clustering
Algorithm and hyperparameter selection
Active constraint selection
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
分享收藏Coalition game for user association and bandwidth allocation in ultra-dense mmWave networks超密集毫米波网络中用户关联和带宽分配的联盟博弈
PREAI
分享收藏An extensive comparative study of cluster validity indices聚类有效性指标的广泛比较研究.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Fluorescent Nanostructures from Aromatic Diblock Copolymers via Atom Transfer Radical Polymerization
PREAI
分享收藏
查看更多内容