negative-correlation

Pairwise edge correlations in random minimum spanning trees — paper, exact data, and verification code

👩🏻‍🚀 11-Data Miining -Affinity Propagation Algorithm - This repo shows how Affinity Propagation performs unsupervised clustering by finding exemplars automatically — no need to set the number of clusters like K-Means. It uses message passing between data points and includes code, K-Means comparison and Silhouette Score evaluation

Edges of the uniform random forest of K_n are pairwise negatively correlated for every n — paper and exact verification