Code covered by the BSD License
-
...
Handle arguments to function
-
[idx,netsim,i,unconverged,dps...
-
ind2cluster(labels)
-
matrix_transform(M,ngiven,nma...
transform to full matrix
-
silhouette2(X, clust, distanc...
SILHOUETTE Silhouette plot for clustered data.
-
simatrix_make(data,type,nrow)
data: a matrix with each column representing a variable.
-
similarity_euclid(data,vararg...
-
similarity_pearson(data)
pearson coefficients between every two columns
-
similarity_pearsonC(data, C)
pearson coefficients between every column and the center
-
solution_evaluation(data,M,la...
-
solution_positive(refseq_exon...
load GeneFindingProblem.mat;
-
valid_errorate(labels, truela...
computing error rates for every clusters if true labels are given
-
valid_external(index1,c2)
-
valid_sumpearson(data,labels,...
within-, between-cluster and total sum of squares
-
valid_sumsqures(data,labels,k...
data: a matrix with each column representing a variable.
-
Main_adaptAP_demo.m
-
data_load.m
-
solution_findK.m
-
View all files
Adaptive Affinity Propagation clustering
by Kaijun Wang
07 Jan 2008
(Updated 26 Jul 2009)
advantage of speed & performance appears under large number of clusters & large dataset
|
Watch this File
|
| File Information |
| Description |
Affinity propagation clustering (AP) is a clustering algorithm proposed in "Brendan J. Frey and Delbert Dueck. Clustering by Passing Messages Between Data Points. Science 315, 972 (2007)". It has some advantages: speed, general applicability, and suitable for large number of clusters. AP has two limitations: it is hard to known what value of parameter ‘preference’ can yield optimal clustering solutions, and oscillations cannot be eliminated automatically if occur.
Adaptive AP improves AP in these items: adaptive adjustment of the damping factor to eliminate oscillations (called adaptive damping), adaptive escaping oscillations, and adaptive searching the space of preference parameter to find out the optimal clustering solution suitable to a data set (called adaptive preference scanning). With these adaptive techniques, adaptive AP will outperform AP algorithm in clustering quality and oscillation elimination, and it will find optimal clustering solutions by Silhouette indices. |
| 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.
|
| Comments and Ratings (6) |
| 20 Mar 2012 |
liu winni
|
|
|
| 23 May 2010 |
xi Jiang
|
|
|
| 23 Apr 2008 |
hou jinxuan
|
|
|
| 10 Jan 2008 |
Kaijun Wang
|
|
|
| 08 Jan 2008 |
udaya kumar
|
|
|
| 08 Jan 2008 |
Mark Brown
|
|
|
| Updates |
| 12 May 2008 |
Help files ReadmeEnglish.txt and ReadmeChinese.txt are updated. |
| 28 Jul 2008 |
help file is updated |
| 30 Jun 2009 |
update the license |
| 26 Jul 2009 |
Readme and Notice files are updated |
|
Contact us