亲和力传播聚类算法详解
资源内容介绍
包含内容：亲和力传播聚类算法步骤详解（有例子），亲和力传播聚类算法matlab代码（与亲和力传播聚类算法步骤详解一一对应） <link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/base.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/fancy.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89708105/raw.css" rel="stylesheet"/><div id="sidebar" style="display: none"><div id="outline"></div></div><div class="pf w0 h0" data-page-no="1" id="pf1"><div class="pc pc1 w0 h0"><img alt="" class="bi x0 y0 w1 h1" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89708105/bg1.jpg"/><div class="t m0 x1 h2 y1 ff1 fs0 fc0 sc0 ls0 ws0">%% <span class="_ _0"></span><span class="ff2">输入环节</span></div><div class="t m0 x1 h3 y2 ff1 fs0 fc1 sc0 ls0 ws0">date = [1.2,1.3,1.1,3.8,4.2];</div><div class="t m0 x1 h3 y3 ff1 fs0 fc1 sc0 ls0 ws0">X = date(:);</div><div class="t m0 x1 h2 y4 ff1 fs0 fc0 sc0 ls0 ws0">%% <span class="_ _0"></span><span class="ff2">相似度矩阵求解环节</span></div><div class="t m0 x1 h3 y5 ff1 fs0 fc1 sc0 ls0 ws0">S = squareform(pdist(X, <span class="fc2">'euclidean'</span>));</div><div class="t m0 x1 h3 y6 ff1 fs0 fc1 sc0 ls0 ws0">S = -S;</div><div class="t m0 x1 h3 y7 ff1 fs0 fc1 sc0 ls0 ws0">p = min(S(:));</div><div class="t m0 x1 h3 y8 ff1 fs0 fc1 sc0 ls0 ws0">N = size(S, 1);</div><div class="t m0 x1 h3 y9 ff1 fs0 fc1 sc0 ls0 ws0">P = diag( p * ones(N,1) );</div><div class="t m0 x1 h3 ya ff1 fs0 fc1 sc0 ls0 ws0">S = S+P;</div><div class="t m0 x1 h2 yb ff1 fs0 fc0 sc0 ls0 ws0">%% <span class="_ _0"></span><span class="ff2">参数设置环节</span></div><div class="t m0 x1 h3 yc ff1 fs0 fc1 sc0 ls0 ws0">R = zeros(N, N);</div><div class="t m0 x1 h3 yd ff1 fs0 fc1 sc0 ls0 ws0">A = zeros(N, N);</div><div class="t m0 x1 h3 ye ff1 fs0 fc1 sc0 ls0 ws0">damping = 0.5;</div><div class="t m0 x1 h3 yf ff1 fs0 fc1 sc0 ls0 ws0">max_iter = 1000; </div><div class="t m0 x1 h2 y10 ff1 fs0 fc0 sc0 ls0 ws0">%% <span class="_ _0"></span><span class="ff2">迭代环节</span></div><div class="t m0 x1 h3 y11 ff1 fs0 fc3 sc0 ls0 ws0">for<span class="fc1"> m=1:max_iter;</span></div><div class="t m0 x1 h3 y12 ff1 fs0 fc1 sc0 ls0 ws0">AS=A+S;</div><div class="t m0 x1 h3 y13 ff1 fs0 fc1 sc0 ls0 ws0">ROLD=R;</div><div class="t m0 x1 h3 y14 ff1 fs0 fc1 sc0 ls0 ws0">AOLD=A;</div><div class="t m0 x1 h3 y15 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _0"></span><span class="fc3">for<span class="fc1"> i=1:N</span></span></div><div class="t m0 x1 h3 y16 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _1"></span>ASH=AS(i,:); </div><div class="t m0 x1 h3 y17 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _2"></span><span class="fc3">for<span class="fc1"> k=1:N</span></span></div><div class="t m0 x1 h3 y18 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _3"></span>ash = ASH(~ismember(1:length(ASH), <span class="_ _4"></span>k));</div><div class="t m0 x1 h3 y19 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _3"></span>R(i,k)=S(i,k)-max(ash); </div><div class="t m0 x1 h3 y1a ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _2"></span><span class="fc3">end</span></div><div class="t m0 x1 h3 y1b ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _0"></span><span class="fc3">end</span></div><div class="t m0 x1 h3 y1c ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _0"></span><span class="fc3">for<span class="fc1"> i = 1:N</span></span></div><div class="t m0 x1 h3 y1d ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _5"></span><span class="fc3">for<span class="fc1"> k = 1:N</span></span></div><div class="t m0 x1 h3 y1e ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _6"></span>RL = R(:, k);</div><div class="t m0 x1 h3 y1f ff1 fs0 fc1 sc0 ls0 ws0"> </div><div class="t m0 x1 h3 y20 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _6"></span><span class="fc3">if<span class="fc1"> i == k</span></span></div><div class="t m0 x1 h3 y21 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RL1 = RL(~ismember(1:length(RL), <span class="_ _4"></span>k));</div><div class="t m0 x1 h3 y22 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RZ1 = RL1(RL1 > 0);</div><div class="t m0 x1 h3 y23 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RZ1S = sum(RZ1);</div><div class="t m0 x1 h3 y24 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>A(i, k) = RZ1S; </div><div class="t m0 x1 h3 y25 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _6"></span><span class="fc3">else</span></div><div class="t m0 x1 h3 y26 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RL2 = RL(~ismember(1:length(RL), [i, k]));</div><div class="t m0 x1 h3 y27 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RZ2 = RL2(RL2 > 0);</div><div class="t m0 x1 h3 y28 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>RZ2S = sum(RZ2);</div><div class="t m0 x1 h3 y29 ff1 fs0 fc1 sc0 ls0 ws0"> <span class="_ _7"></span>A(i, k) = min(0, R(k, k) + RZ2S);</div></div><div class="pi" data-data='{"ctm":[1.568627,0.000000,0.000000,1.568627,0.000000,0.000000]}'></div></div>