esda.silhouette_alist

esda.silhouette_alist(data, labels, alist, indices=None, metric=<function euclidean_distances at 0x7f277d999c10>)[source]

Compute the silhouette for each edge in an adjacency graph. Given the alist containing focal id, neighbor id, and label_focal, and label_neighbor, this computes:

d(i,label_neighbor) - d(i,label_focal) / (max(d(i,label_neighbor), d(i,label_focal)))