Code covered by the BSD License  

Highlights from
Recognizing Far-Near Relations of Clusters by GDEM, Visualization by Line-Pearl Pattern

• Vcolabel(lb,H,C)
• Vdraw_cline(N, labels, x, y) Drawing the layout of circles connected with lines
• Vmake_position(Hm,Hmax,elg,c,...
• [A1,A2,A1h,A2h,B1,B2,B1h,B2h]...
• [dmin,dhaus,Ia,Ib,Ha,Hb]=adis... inter-cluster distances: min distance, Hausdorff distance
• [idx,netsim,dpsim,expref,pref... [idx,netsim,dpsim,expref,pref]=apclusterK(s,k)
• [idx,netsim,dpsim,expref,pref... Finds approximately k clusters using affinity propagation (BJ Frey and
• [idx,netsim,dpsim,expref]=apc... % [idx,netsim,dpsim,expref]=apclusterSparse(s,p)
• [idx,netsim,i,unconverged,dps...
• [pcfirst,eigvect,eigval,pcord... extracting PCA components from data (along dimensions)
• border_distance(Dmatrix,A1,B1... finding nearest elements between A1 & B1
• border_points(Dm,A,B,N) finding N points in group A that are nearest to B
• clusterrun(whichAP,data,K,typ... finding K clusters exactly
• data_load(sw,alabel,nrow,sima...
• ind2cluster(labels)
• plotdata_label(data,classlabe... plot the first two principle components (PC1 & PC2) of data with labels
• propag_center(data,Dmatrix, A... computing propagation distances in centeral area
• propag_intra(Dmatrix, A, star... compute distances within A along different propagation routes
• propag_through(DM, A, startpo... compute distances between points along the propagation route
• simatrix_ap(data,type,chois) data: a matrix with each column representing a variable.
• similarity_euclid(data,vararg... input: data --- observations x dimensions
• similarity_pearson(data,varar... pearson coefficients between columns
• test_regionsize.m
• tiedrank2(x, tieflag, bidirec... TIEDRANK Compute the ranks of a sample, adjusting for ties.
• valid_errorate(labels, truela... computing error rates for every clusters if true labels are given
• valid_external(index1,c2)
• ylim2(arg1, arg2)
• Main_cRelation.m
• Visual_cRelation_main.m
• View all files