%0 Journal Article
%T k-medoids clustering algorithm based on CF tree<br>一种基于CF树的k-medoids聚类算法*
%A CAO Dan-yang
%A YANG Bing-ru
%A LI Guang-yuan
%A LIU Ying-hua
%A <br>曹丹阳
%A 杨炳儒
%A 李广原
%A 刘英华
%J 计算机应用研究
%D 2011
%I 
%X k-medoids algorithm has better robustness when the dataset exist noise and outlier points.However,computational cost of k-medoids algorithm is higher on big datasets.CF tree is a common structure in Birch algorithm,and it has better sca-lability on the clustering of big datasets.But CF tree has poor clustering results on the non-spherical data.Therefore,this paper presented a k-medoids algorithm based on CF tree on the basis of the two algorithms.First,the improved algorithm constructed CF tree by the data ...
%K clustering
%K k-medoids
%K CF-tree
%K micro-cluster<br>聚类
%K k-中心点
%K CF树
%K 微簇
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=49438F68A18A4524B3850EAADC43B617&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=9CF7A0430CBB2DFD&sid=0E16B5A9B67AFC49&eid=2E633E1945399CA7&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=12