关键词: 聚类融合, 自适应最近邻, ANNCE算法

Abstract: The clustering ensemble algorithms can get a more superior result than the single clustering algorithms, because clustering ensemble combines clustering members which have some difference in each other. The problem of clustering ensemble algorithms has become one of the hot field in recent years. Based on the concept of adaptive nearest neighbors, this paper proposes a new clustering ensemble Adaptive Nearest Neighbors Clustering Ensemble（ANNCE） algorithm. This algorithm can automatically select a different number of nearest neighbors for each data point, according to the different density of data, and compared with the algorithm based on KNN, the ANNCE algorithm can not only solve the problem of too many parameters but also get a better result.

Key words: clustering ensemble, adaptive nearest neighbors, ANNCE algorithm