关键词: 动态数据集, 密度可达, 增量聚类

Abstract: The traditional clustering algorithms are only suitable to the static datasets.As for the dynamic datasets，the clustering results will become unreliable after new data increase，and also it will certainly decrease efficiency and waste computing resources to cluster all of the data again.To overcome these problems，a new incremental clustering algorithm is presented according to the analysis of the clustering algorithm based on density and adaptive density-reachable.Theoretical analysis and experimental results demonstrate that the incremental algorithm can improve efficiency and resource utilization，and handle the dynamic datasets effectively.

Key words: dynamic dataset, density-reachable, incremental clustering