%0 Journal Article
%T Multiseed clustering algorithm based on max-min distance means<br>基于最大最小距离法的多中心聚类算法
%A ZHOU Juan
%A XIONG Zhong-yang
%A ZHANG Yu-fang
%A REN Fang
%A <br>周涓
%A 熊忠阳
%A 张玉芳
%A 任芳
%J 计算机应用
%D 2006
%I 
%X A novel multiseed clustering algorithm was proposed aiming at shortcomings of k-means algorithm. This algorithm could find optimal initial starting points applying iterative max-rain distance means and then combined the small clusters from given data set into final ones, for an elongated or large cluster could be considered as the union of a few small distinct hyperspherieal clusters. Experimcntal results demonstrate that the improved algorithm can automatically obtain the number of initial clusters, be effective on data set of irregular shapes and lead to better solutions than k-means algorithm.
%K clustering
%K max-min distance means
%K multiseed
%K sampling<br>聚类
%K 最大最小距离法
%K 多中心
%K 抽样
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=91E8B0BD030B11A2&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=43FECC6533E9683D&eid=83F3E1555B654B95&journal_id=1001-9081&journal_name=计算机应用&referenced_num=15&reference_num=7