arrow
返回

Enhanced bisecting k-means clustering using intermediate cooperation

delete2009-11-01
delete43
PRE
AI
R
Rasha Kashef *
M
Mohamed S. Kamel
DOI:10.1016/j.patcog.2009.03.011delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Bisecting k-means (BKM) is very attractive in many applications as document-retrieval/indexing and gene expression analysis problems. However, in some scenarios when a fraction of the dataset is left behind with no other way to re-cluster it again at each level of the binary tree, a refinement is needed to re-cluster the resulting solutions. Current approaches to refine the Clustering Solutions produced by the BKM employ end-result enhancement using k-means (KM) Clustering. In this hybrid model, KM waits for the former BKM to finish its clustering and then it takes the final set of centroids as initial seeds for a better refinement. In this paper, a cooperative bisecting k-means (CBKM) clustering algorithm is presented. The CBKM concurrently combines the results of the BKM and KM at each level of the binary hierarchical tree using cooperative and merging matrices. Undertaken experimental results show that the CBKM achieves better clustering quality than that of KM, BKM, and single linkage (SL) algorithms with comparable time performance over a number of artificial, text documents, and gene expression datasets. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Bisecting clustering
Cooperative clustering
Quality measures
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

U
University of Waterloo
学者数:
2.2W
论文数: 2.3W
被引数: 3.3W
引用论文

引用论文

err分享
err收藏
Partitioning-based clustering for Web document categorization
err1999-12-01
err150
PREAI
errBoley, D; Gini, M; Gross, R; Han, EH; Hastings, K; Karypis, G; Kumar, V; Mobasher, B; Moore, J
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容