A Data-Partitioning-Based Nearest-Neighbors-First Clustering Algorithm
基于数据分区的最近邻优先聚类算法

Clustering is an important research direction in the field of Data Mining.This paper analyses the Nearest Neighbors Absorbed First (NNAF) clustering algorithm.This algorithm can cluster quickly with noisy. However, clustering quality will degrade when the cluster density and distance between clusters are not even.In this paper,a Nea- rest-Neighbors-First clustering algorithm based on data partitioning is proposed.The new algorithm improves the quali- ty of clustering.