%0 Journal Article
%T A Novel Rough-based Leader Clustering Algorithm<br>一种新的基于粗糙集的leader聚类算法
%A ZHANG Qiong
%A ZHANG Ying
%A BAI Qing-Yuan
%A XIE Li-Cong
%A XIE Huo-Sheng
%A <br>张琼
%A 张莹
%A 白清源
%A 谢丽聪
%A 谢伙生
%J 计算机科学
%D 2008
%I 
%X Objects are partitioned into clusters with crisp boundaries in the conventional algorithms. However,clusters do not necessarily have crisp boundaries. Rough set is represented with lower-bound and upper-bound,and is good for the case. At present,there have been some typical algorithms,such as the rough-based k-means clustering algorithm and the rough-based leader clustering algorithm. In this paper,a novel rough-based leader clustering algorithm is proposed,since there are some disadvantages in the RFA algo...
%K Clustering
%K Rough set
%K K-means algorithm
%K Leader algorithm<br>聚类
%K 粗糙集
%K k-means算法
%K leader算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=C5659C381F74EF5424EDF96F345DCD68&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=38B194292C032A66&sid=6425DAE0271BB751&eid=E114CF9BB47B65BE&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=7