%0 Journal Article
%T A Data-Partitioning-Based Nearest-Neighbors-First Clustering Algorithm<br>基于数据分区的最近邻优先聚类算法
%A WANG Xin
%A WANG Hong-Guo
%A ZHANG Jian-Xi
%A GU Jian-Jun
%A <br>王鑫
%A 王洪国
%A 张建喜
%A 谷建军
%J 计算机科学
%D 2005
%I 
%X 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.
%K Data Mining
%K Clustering
%K Data partitioning
%K Nearest neighbor first<br>数据挖掘
%K 聚类
%K 数据分区
%K 最近邻优先吸收
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=145C08441B9CBEA9&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=59906B3B2830C2C5&sid=847B14427F4BF76A&eid=6235172E4DDBA109&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=8