Hierarchical confidence-based active clustering
暂无分享,去创建一个
In this paper, we address the problem of semi-supervised hierarchical clustering by using an active clustering solution with cluster-level constraints. This active learning approach is based on a concept of merge confidence in agglomerative clustering. The proposed method was compared with an un-supervised algorithm (average-link) and a semi-supervised algorithm based on pairwise constraints. The results show that our algorithm tends to be better than the pairwise constrained algorithm and can achieve a significant improvement when compared to the unsupervised algorithm.
[1] Reynaldo Gil-García,et al. Dynamic hierarchical algorithms for document clustering , 2010, Pattern Recognit. Lett..
[2] Dan Klein,et al. From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering , 2002, ICML.
[3] Bernadette Bouchon-Meunier,et al. Boosting Clustering by Active Constraint Selection , 2010, ECAI.