Catatan bukti metode

Affinity Propagation

Affinity propagation, introduced by Brendan Frey and Delbert Dueck in 2007, is a clustering algorithm that identifies representative 'exemplars' among the data by exchanging messages between every pair of points until a consistent set of clusters emerges. Unlike k-means it does not require the number of clusters to be specified in advance — that number arises from the data and a 'preference' parameter — and it works directly from pairwise similarities, which need not be a metric.

Sources recorded, not reviewed

Catatan sumber

Kutipan disalin apa adanya dari catatan sumber metode. Tidak ada verifikasi tingkat klaim yang disimpulkan darinya.

Affinity Propagation Clustering

Catatan metode taksonomi · ml-model / machine-learning

Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972–976. · DOI 10.1126/science.1136800

Buka metode lengkap

Klaim yang dikurasi

Klaim tersimpan dalam buku besar bukti, masing-masing dengan penilaiannya sendiri.

Belum ada klaim yang dikurasi

Tampilan ini tidak menciptakan penilaian klaim ketika buku besar tidak memilikinya.

Metode terkait

Dihasilkan dari grafik metode dan ditampilkan sebagai relasi yang disarankan mesin — tidak ada klaim bukti yang disimpulkan.

Same method familyDBSCANmachine-suggested · Relational suggestion, not evidence.Same method familyHierarchical Clusteringmachine-suggested · Relational suggestion, not evidence.Same method familyK-Means Clusteringmachine-suggested · Relational suggestion, not evidence.Same method familySpectral Clusteringmachine-suggested · Relational suggestion, not evidence.