pyclustering.cluster.kmedoids.kmedoids Class Reference

Class represents clustering algorithm K-Medoids. More...

Public Member Functions
def	__init__ (self, data, initial_index_medoids, tolerance=0.001, ccore=True, kwargs)
	Constructor of clustering algorithm K-Medoids. More...
def	process (self)
	Performs cluster analysis in line with rules of K-Medoids algorithm. More...
def	predict (self, points)
	Calculates the closest cluster to each point. More...
def	get_clusters (self)
	Returns list of allocated clusters, each cluster contains indexes of objects in list of data. More...
def	get_medoids (self)
	Returns list of medoids of allocated clusters represented by indexes from the input data. More...
def	get_cluster_encoding (self)
	Returns clustering result representation type that indicate how clusters are encoded. More...

Detailed Description

Class represents clustering algorithm K-Medoids.

The algorithm is less sensitive to outliers tham K-Means. The principle difference between K-Medoids and K-Medians is that K-Medoids uses existed points from input data space as medoids, but median in K-Medians can be unreal object (not from input data space).

Clustering example:

from pyclustering.cluster.kmedoids import kmedoids
from pyclustering.cluster import cluster_visualizer
from pyclustering.utils import read_sample
from pyclustering.samples.definitions import FCPS_SAMPLES

# Load list of points for cluster analysis.
sample = read_sample(FCPS_SAMPLES.SAMPLE_TWO_DIAMONDS)

# Set random initial medoids.
initial_medoids = [1, 500]

# Create instance of K-Medoids algorithm.
kmedoids_instance = kmedoids(sample, initial_medoids)

# Run cluster analysis and obtain results.
kmedoids_instance.process()
clusters = kmedoids_instance.get_clusters()

# Show allocated clusters.
print(clusters)

# Display clusters.
visualizer = cluster_visualizer()
visualizer.append_clusters(clusters, sample)
visualizer.show()

Metric for calculation distance between points can be specified by parameter additional 'metric':

# create Minkowski distance metric with degree equals to '2'
metric = distance_metric(type_metric.MINKOWSKI, degree=2)

# create K-Medoids algorithm with specific distance metric
kmedoids_instance = kmedoids(sample, initial_medoids, metric=metric)

# run cluster analysis and obtain results
kmedoids_instance.process()
clusters = kmedoids_instance.get_clusters()

Distance matrix can be used instead of sequence of points to increase performance and for that purpose parameter 'data_type' should be used:

# calculate distance matrix for sample
sample = read_sample(path_to_sample)
matrix = calculate_distance_matrix(sample)

# create K-Medoids algorithm for processing distance matrix instead of points
kmedoids_instance = kmedoids(matrix, initial_medoids, data_type='distance_matrix')

# run cluster analysis and obtain results
kmedoids_instance.process()

clusters = kmedoids_instance.get_clusters()
medoids = kmedoids_instance.get_medoids()

Definition at line 41 of file kmedoids.py.

Constructor & Destructor Documentation

__init__()

def pyclustering.cluster.kmedoids.kmedoids.__init__	(		self,
			data,
			initial_index_medoids,
			tolerance = 0.001,
			ccore = True,
			kwargs
	)

Constructor of clustering algorithm K-Medoids.

Parameters

[in]	data	(list): Input data that is presented as list of points (objects), each point should be represented by list or tuple.
[in]	initial_index_medoids	(list): Indexes of intial medoids (indexes of points in input data).
[in]	tolerance	(double): Stop condition: if maximum value of distance change of medoids of clusters is less than tolerance than algorithm will stop processing.
[in]	ccore	(bool): If specified than CCORE library (C++ pyclustering library) is used for clustering instead of Python code.
[in]	**kwargs	Arbitrary keyword arguments (available arguments: 'metric', 'data_type', 'itermax').

Keyword Args:

• metric (distance_metric): Metric that is used for distance calculation between two points.
• data_type (string): Data type of input sample 'data' that is processed by the algorithm ('points', 'distance_matrix').
• itermax (uint): Maximum number of iteration for cluster analysis.

Definition at line 109 of file kmedoids.py.

Member Function Documentation

get_cluster_encoding()

def pyclustering.cluster.kmedoids.kmedoids.get_cluster_encoding

(

self

)

Returns clustering result representation type that indicate how clusters are encoded.

Returns

(type_encoding) Clustering result representation.

See also

get_clusters()

Definition at line 247 of file kmedoids.py.

get_clusters()

def pyclustering.cluster.kmedoids.kmedoids.get_clusters

(

self

)

Returns list of allocated clusters, each cluster contains indexes of objects in list of data.

See also

process()

get_medoids()

Definition at line 223 of file kmedoids.py.

Referenced by pyclustering.samples.answer_reader.get_cluster_lengths(), and pyclustering.cluster.optics.optics.process().

get_medoids()

def pyclustering.cluster.kmedoids.kmedoids.get_medoids

(

self

)

Returns list of medoids of allocated clusters represented by indexes from the input data.

See also

process()

get_clusters()

Definition at line 235 of file kmedoids.py.

predict()

def pyclustering.cluster.kmedoids.kmedoids.predict	(		self,
			points
	)

Calculates the closest cluster to each point.

Parameters

[in]

points

(array_like): Points for which closest clusters are calculated.

Returns

(list) List of closest clusters for each point. Each cluster is denoted by index. Return empty collection if 'process()' method was not called.

An example how to calculate (or predict) the closest cluster to specified points.

from pyclustering.cluster.kmedoids import kmedoids
from pyclustering.samples.definitions import SIMPLE_SAMPLES
from pyclustering.utils import read_sample

# Load list of points for cluster analysis.
sample = read_sample(SIMPLE_SAMPLES.SAMPLE_SIMPLE3)

# Initial medoids for sample 'Simple3'.
initial_medoids = [4, 12, 25, 37]

# Create instance of K-Medoids algorithm with prepared centers.
kmedoids_instance = kmedoids(sample, initial_medoids)

# Run cluster analysis.
kmedoids_instance.process()

# Calculate the closest cluster to following two points.
points = [[0.35, 0.5], [2.5, 2.0]]
closest_clusters = kmedoids_instance.predict(points)
print(closest_clusters)

Definition at line 177 of file kmedoids.py.

process()

def pyclustering.cluster.kmedoids.kmedoids.process

(

self

)

Performs cluster analysis in line with rules of K-Medoids algorithm.

Returns

(kmedoids) Returns itself (K-Medoids instance).

Remarks

Results of clustering can be obtained using corresponding get methods.

See also

get_clusters()

get_medoids()

Definition at line 143 of file kmedoids.py.

---

The documentation for this class was generated from the following file:

• pyclustering/cluster/kmedoids.py