%0 Journal Article
%T Improved algorithm of rough K-means based on relative distance<br>基于相对距离的改进粗K-means方法
%A WANG Ming-chun
%A TANG Wan-sheng
%A JIANG Qi
%A LIU Xin
%A <br>王明春
%A 唐万生
%A 江琪
%A 刘鑫
%J 计算机应用
%D 2009
%I 
%X Two rough K-means algorithms based on absolute distance were discussed in the first place, and then the deficiencies of them were indicated. After that, the rationality of the algorithms was presented when the absolute distance was changed to relative distance, and for the reason, the improved algorithms of rough K-means based on relative distance was given. At last, the feasibility and effectiveness of this algorithm were testified by comparing with random, Iris and text data on clustering effect.
%K Rough Set (RS)
%K rough K-means algorithm
%K clustering<br>粗糙集
%K 粗K-means方法
%K 聚类
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=4456D0419562558AFF5AA8D1FABF8ED6&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=E158A972A605785F&sid=47D3259DD85FC8F7&eid=9236E752FE2887AD&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=6