期刊
PATTERN RECOGNITION
卷 42, 期 5, 页码 668-675出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2008.09.013
关键词
Clustering aggregation; Evidence accumulation; Probability accumulation
资金
- Natural Science Foundation of China [60573062, 60673106, 60721003]
- Specialized Research Fund
Since a large number of clustering algorithms exist, aggregating different clustered partitions into a single consolidated one to obtain better results has become an important problem. In Fred and Jain's evidence accumulation algorithm, they construct a co-association matrix on original partition labels, and then apply minimum spanning tree to this matrix for the combined clustering. In this paper, we will propose a novel clustering aggregation scheme, probability accumulation. In this algorithm, the construction of correlation matrices takes the cluster sizes of original clusterings into consideration. An alternate improved algorithm with additional pre- and post-processing is also proposed. Experimental results on both synthetic and real data-sets show that the proposed algorithms perform better than evidence accumulation, as well as some other methods. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据