%0 Journal Article
%T Incremental clustering algorithm based on representative points<br>一种基于代表点的增量聚类算法
%A MENG Fan-rong
%A LI Xiao-cui
%A ZHOU Yong
%A <br>孟凡荣
%A 李晓翠
%A 周　勇
%J 计算机应用研究
%D 2012
%I 
%X As the existing incremental clustering algorithms have various disadvantages such as high sensitivity to parameters, high time-space complexity, etc. This paper presented an incremental algorithm based on representative points. It first used the static clustering algorithm based on representative points to cluster the original data set. Then according the relationship between the new points and the existing representative points, the algorithm judged whether the new points should be added to the clusters containing the existing representative points or promoted as new representative points. Finally it used the static clustering algorithm again to cluster the new points. Experimental result shows that this algorithm is insensible to parameters, efficient and occupies little space.
%K representative points
%K properties of the new points
%K incremental clustering<br>代表点
%K 节点属性
%K 增量聚类
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C2AB4F886AE798C9B268FEEF00469AED&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=5D311CA918CA9A03&sid=D49D359ED50BE2CC&eid=4A5BEFCBB1C293EE&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11