Skip to content

The Partitioning Around Medoids (PAM) implementation of K-Medoids algorithm in Python.

Notifications You must be signed in to change notification settings

trimeta/kmedoids

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

K-Medoids

K-Medoids is a clustering algorithm. Partitioning Around Medoids (PAM) algorithm is one such implementation of K-Medoids

Prerequisites

  • Scipy
  • Numpy

Getting Started

from KMedoids import KMedoids

Parameters

  • n_cluster: number of clusters
  • max_iter: maximum number of iterations
  • tol: tolerance level

Example

Wiki Example

data = [[2, 6], [3, 4], [3, 8], [4, 7], [6, 2], [6, 4], [7, 3], [7, 4], [8, 5], [7, 6]]
k_medoids = KMedoids(n_cluster=2)
k_medoids.fit(data)

Visualization

About

The Partitioning Around Medoids (PAM) implementation of K-Medoids algorithm in Python.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 91.4%
  • Python 8.6%