- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
蚁群聚类程序
% Ant Colony Optimization for the Clustering
clc;
clear;
N =44;% N = number_of_test_sample;
n =3;% n = number_of_attribute_of_test_sample;
% K = number_of_cluster;
K = 3;
% R = number_of_ants;
R = 10;
% t_max = MaxIterations;
t_max = 1000;
% X = test_sample_matrix;
xdata=xlsread(2011.xls);
X=zscore(xdata);
% INITIALIZATION
c = 10^-2;% pheromone trails
tau = ones(N,K) * c;
%tau = [
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
% 0. 0. 0.;
%];
q = 0.9;% probability threshold q
rho = 0.1;% evaporation rate
best_solution_function_value = inf;% fitness function
t = 1;
while ((t = t_max))
% SEND R ANTS EACH WITH EMPTY SOLUTION STRING,S
% =============================
solution_string = zeros(R,N+1);% solution string : every ant construction solution and fitness function
% COMPUTE R SOLUTION
for i = 1 : R
% solution_string(1,1:N) = randint(1,N,[1,K]);
r = rand(1,N); %construct solution Si using pheromone trail
for g = 1 : N
if r(g) q
tau_max = max(tau(g,:));
Cluster_number = find(tau(g,:)==tau_max);
solution_string(i,g) = Cluster_number(1); %%%%%%%%%%%%% 1--i
else
sum_p = sum(tau(g,:));
p = tau(g,:) / sum_p;
for u = 2 : K
p(u) = p(u) + p(u-1);
end
rr = rand;
%Cluster_number = K;
for s = 1 : K
if (rr = p(s))
Cluster_number = s;
solution_string(i,g) = Cluster_number; % 1--i
break;
end
end
end
end
% compute weights(weight) of all test samples and cluster
% centers(cluster_center)
weight = zeros(N,K);
for h = 1:N
Cluster_index = solution_string(i,h); %%%%%%%%%%%%% 1--i
weight(h,Cluster_index) = 1;
end
cluster_center = zeros(K,n);
for j = 1:K
for v = 1:n
文档评论(0)