Clustering by Passing Messages
Nessuna licenza
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.
Cita come
Michael Boedigheimer (2024). Clustering by Passing Messages (https://www.mathworks.com/matlabcentral/fileexchange/15498-clustering-by-passing-messages), MATLAB Central File Exchange. Recuperato .
Compatibilità della release di MATLAB
Compatibilità della piattaforma
Windows macOS LinuxCategorie
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox > Cluster Analysis and Anomaly Detection >
Tag
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Scopri Live Editor
Crea script con codice, output e testo formattato in un unico documento eseguibile.
affinity_propagation/
Versione | Pubblicato | Note della release | |
---|---|---|---|
1.0.0.0 | Improved Demo |