No BSD License  

Highlights from
Clustering by Passing Messages

4.0

4.0 | 1 rating Rate this file 15 Downloads (last 30 days) File Size: 4.04 KB File ID: #15498
image thumbnail

Clustering by Passing Messages

by

 

04 Jul 2007 (Updated )

Automated clustering through messaging

| Watch this File

File Information
Description

As recently published in Science (see reference)

Simple and effective means of clustering any data for which a similarity matrix can be constructed. Does not require similarity matrix meet the standards for a metric. The algorithm applies in cases where the similarity matrix is not symmetric (the distance from point i to j can be different from j to i). And it does not require triangular equalities (e.g. the hypoteneus can be less than the sum of the other sides)

usage is very simple (given an m x m similarity matrix)

ex = affprop(s)

returns ex, a m x 1 vector of indices, such that ex(i) is the exemplar for the ith point.

see affyprop_demo for a complete example with simple 2d data. See reference for more complex examples including face matching.

MATLAB release MATLAB 7.4 (R2007a)
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (1)
09 Jul 2007 Michael Bass  

Contact us