Code covered by the BSD License
-
SystemEvolution_energy(labels...
Energy computations for System Evolution to Estimate the Number of Clusters
-
SystemEvolution_findk(inter,i...
(2) collecting partition and merge energies gained
-
[A1,A2,B1,B2,A3,B3]=cluster_m...
Two-cluster model and twin-clusters
-
[A2,B2]=findnear(Dist,A1,na,B...
finding nearest elements between two groups A1 and B1
-
[Ra,na]=border_points(Dm,A1,B...
finding out nearest points between two groups A1 and B1
-
[S,T,singl,simter,kmin]=close...
finding such a border region of a cluster that is nearest another cluster
-
[ft,fd]=plotindice(ind,N1,N2,...
-
[inter,intra]=energy_euclid(D...
computing energies (average walking distance) within each group A1,B1,...
-
[inter,intra]=energy_pearson(...
computing energies (average walking distance) within each group A1,B1,...
-
[pcfirst,eigvect,eigval,pcord...
extracting PCA components from data (along dimensions)
-
daisy(x,vtype,metric)
DAISY returns a matrix containing all the pairwise dissimilarities
-
data_load(id,sw,nk,N2,type)
-
energy_compute(Dist,A1,A2,B1,...
-
energydiff_allclusters(Dist,l...
finding energies for all clusters
-
ind2cluster(labels)
-
nearest(z,xi);
NEAREST: return the vector zj in z that is nearest to xi
-
pam(x,kclus,vtype,stdize,metr...
PAM returns a list representing a clustering of the data into kclus
-
pam_running(data,N,Ns,type,st...
calculating dis-similarity/distance matrix of a data set
-
plot_evolution_route(data,lab...
-
plotdata_bylabels(data,classl...
plotting data in first two principle components (pc) or dimensions
-
regionF_find(Dmatrix,A1,B1,di...
-
remove_closest(Dm,Ra,Rb)
-
remove_outlier(Dmatrix,A1,nA)
-
show2dim_byclass(davec,clas,i...
showing 2-dimensional data in X-Y space
-
showClass_up(data, labels, hi...
-
similarity_euclid(data)
-
similarity_pearson(data)
pearson coefficients between every two columns
-
standarz(data)
-
valid_errorate(labels,truelab...
computing error rates for every clusters if true labels are given
-
valid_external(index1,c2)
-
walk_distance(Dmatrix,A,k,ch)
-
walk_route(DM, A1, startpoint...
-
xlim(arg1, arg2)
-
MainSystemEvolution.m
-
datasort_bylabel.m
-
View all files
Estimating the number of clusters via System Evolution
by Kaijun Wang
07 Jul 2009
estimate number of clusters for far clusters, small-larger clusters, slightly overlapping clusters
|
Watch this File
|
| File Information |
| Description |
(SE) is developed to estimate the number of clusters (NC) for PAM clustering algorithm. By inspecting whether it is stable that two potential clusters are separated or merged, SE focuses on the separability of two closest clusters among k potential clusters (called twin-clusters) when a data set is divided to k clusters.
SE judges the separability of far clusters, clusters with small clusters near larger clusters or slightly overlapping between clusters. |
| Required Products |
Statistics Toolbox
|
| MATLAB release |
MATLAB 7.2 (R2006a)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
|
Contact us at files@mathworks.com