%0 Journal Article
%T Random optimal clustering algorithm based on complex annealing method<br>复合形退火的随机聚类算法
%A ZHAO Kai
%A LI Sheng-jin
%A BAI Xue
%A ZHAO Feng
%A <br>赵　凯
%A 李声晋
%A 白　雪
%A 赵　锋
%J 计算机应用研究
%D 2013
%I 
%X In order to solve the problem that the traditional clustering algorithm is apt to fall into local optimal solution, this paper presented a novel algorithm. First it introduced the main principle of the complex method and used an improved one to K-mean optimal clustering, this paper educed a series of formulation and gave the realization process of the algorithm later. Compared to other algorithms, the results by exemplification show that this algorithm is not only correct and feasible, but highly effective and steady, and has a wide area of application.
%K complex method
%K annealing
%K random
%K K-mean clustering<br>复合形
%K 退火
%K 随机
%K K-均值聚类
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=DD8ECC43358E540DA21894901B71EDC8&yid=FF7AA908D58E97FA&vid=340AC2BF8E7AB4FD&iid=E158A972A605785F&sid=8F39F7FDA07C2566&eid=42AB3C691163F5B1&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10