A robust iterative refinement clustering algorithm with smoothing search space

A robust iterative refinement clustering algorithm with smoothing search space
复制标题

具有平滑搜索空间的鲁棒迭代细化聚类算法

DOI:
10.1016/j.knosys.2010.01.012
复制
发表时间:
2010-07
影响因子:
8.8
通讯作者:
Zong, Yu
Zong, Yu
中科院分区:
计算机科学1区
文献类型:
--
作者:
Xu, Gu;ong;Li, Mingchu;Jiang, He;Zhang, Yanchun;Zong, Yu

文献摘要

参考文献

相似文献

迭代细化聚类算法广泛应用于数据挖掘领域,但它们对初始化敏感。在过去的几十年中,人们提出了许多改进的初始化方法来减少初始化敏感性问题的影响。迭代细化聚类算法的本质是局部搜索方法。搜索空间中嵌入的大量局部最小点使得局部搜索问题变得困难且对初始化敏感。局部最小点的数量越少,局部搜索算法的初始化就越鲁棒。在本文中,我们提出了一种具有平滑搜索空间(TDCS3)的自顶向下聚类算法,以减少初始化的影响。 TDCS3的主要步骤是:(1)通过“填充”局部极小点,动态地将一系列平滑的搜索空间重建为层次结构; (2)在层次结构的顶层,运行现有的迭代细化聚类算法并随机初始化以生成聚类结果; (3)最终从层次结构的第二层到底层,使用从先前的聚类结果导出的初始化来运行相同的聚类算法。 3 个合成数据集和 10 个真实世界数据集的实验结果表明,TDCS3 对于寻找更好、鲁棒的聚类结果和减少初始化的影响具有显着效果。
Iterative refinement clustering algorithms are widely used in data mining area, but they are sensitive to the initialization. In the past decades, many modified initialization methods have been proposed to reduce the influence of initialization sensitivity problem. The essence of iterative refinement clustering algorithms is the local search method. The big numbers of the local minimum points which are embedded in the search space make the local search problem hard and sensitive to the initialization. The smaller number of local minimum points, the more robust of initialization for a local search algorithm is. In this paper, we propose a Top–Down Clustering algorithm with Smoothing Search Space (TDCS3) to reduce the influence of initialization. The main steps of TDCS3 are to: (1) dynamically reconstruct a series of smoothed search spaces into a hierarchical structure by ‘filling’ the local minimum points; (2) at the top level of the hierarchical structure, an existing iterative refinement clustering algorithm is run with random initialization to generate the clustering result; (3) eventually from the second level to the bottom level of the hierarchical structure, the same clustering algorithm is run with the initialization derived from the previous clustering result. Experiment results on 3 synthetic and 10 real world data sets have shown that TDCS3 has significant effects on finding better, robust clustering result and reducing the impact of initialization.
DOI: 10.1145/321958.321975
发表时间: 1976-07
期刊: Journal of the ACM (JACM)
影响因子: --
作者:
S. Sahni;T. Gonzalez
通讯作者: S. Sahni;T. Gonzalez
DOI: 10.1201/9781420090741.ch2
发表时间: 1974
期刊: --
影响因子: --
作者:
Julius T. Tou;Rafael Gonzalez
通讯作者: Julius T. Tou;Rafael Gonzalez
DOI: --
发表时间: 1998-07
期刊: --
影响因子: --
作者:
P. Bradley;U. Fayyad
通讯作者: P. Bradley;U. Fayyad
DOI: --
发表时间: 1996
期刊: --
影响因子: --
作者:
C. Merz
通讯作者: C. Merz
DOI: 10.1109/ijcnn.2004.1379917
发表时间: 2004-07
期刊: 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
影响因子: --
作者:
Ji He;Man Lan;C. Tan;S. Sung;H. Low
通讯作者: Ji He;Man Lan;C. Tan;S. Sung;H. Low