K-Medoids

This is an implementation of K-Medoids clustering algorithm. It takes as input a distance matrix.

Example

import numpy as np
from sklearn.datasets.samples_generator import make_blobs
from sklearn.metrics.pairwise import pairwise_distances
from kmedoids import KMedoids

# generate random points
X, _ = make_blobs(n_samples=100, centers=3)

# compute distance matrix
dist = pairwise_distances(X, metric='euclidean')

# k-medoids algorithm
km = KMedoids(distance_matrix=dist, n_clusters=3)
km.run(max_iterations=10, tolerance=0.001)

print(km.clusters)