Initialize U=[uij] matrix, U(0) At k-step: calculate the centers vectors C(k)=[cj] with U(k) Update U(k) , U(k+1) If || U(k+1) - U(k)||< then STOP otherwise return to step 2.
標簽： Initialize calculate centers vectors
上傳時間： 2013-12-29
上傳用戶：CSUSheep
StudyARM Step by Step StudyARM Step by Step
上傳時間： 2013-12-02
上傳用戶：lixinxiang
Step-upcircuit,very useful
標簽： Step-upcircuit useful very
上傳時間： 2014-01-06
上傳用戶：tuilp1a
針對第一次接觸嵌入式系統的愛好者可以step by step學習
上傳時間： 2013-12-14
上傳用戶：gundamwzc
function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent for U max_iter = 100 ％ Max. iteration min_impro =1e-5 ％ Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if F(U)>0.98 break else w_new=eye(in_n,in_n) center1=sum(center)/c a=center1(1)./center1 deta=center-center1(ones(c,1),:) w=sqrt(sum(deta.^2)).*a for j=1:in_n w_new(j,j)=w(j) end data1=data*w_new [center, U, obj_fcn] = fcm(data1, c) center=center./w(ones(c,1),:) obj_fcn=obj_fcn/sum(w.^2) end end display(i) result=zeros(1,data_n) U_=max(U) for i=1:data_n for j=1:c if U(j,i)==U_(i) result(i)=j continue end end end
標簽： data function Exponent obj_fcn
上傳時間： 2013-12-18
上傳用戶：ynzfm
for 6441A update unix get the file size and porpoarty!
標簽： porpoarty update 6441A file
上傳時間： 2013-12-20
上傳用戶：jing911003
k-step ahead predictions determined by simulation of the ％ one-step ahead neural network predictor. For NNARMAX ％ models the residuals are set to zero when calculating the ％ predictions. The predictions are compared to the observed output. ％
標簽： ahead predictions determined simulation
上傳時間： 2016-12-27
上傳用戶：busterman
FOR ADS STUDY ,ABOUT ADS APPLY AND STEP.
上傳時間： 2017-01-07
上傳用戶：417313137
step motor driver, very important c code.thanks.
標簽： important driver thanks motor
上傳時間： 2017-01-12
上傳用戶：515414293
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
