Study on the Emergency Management System considering Victims’ Self-Rescue Abilities

Algorithm 2

K-medoids cluster algorithm.

	Input:: the number of clusters, : a data set containing objects
	Output: A set of clusters.
	Algorithm:
(i)	Randomly select as the medoids for n data points.
(ii)	Find the closest medoids by calculating the distance between data points and medoids and map data objects to that.
(iii)	For each medoids m and each data point associated with m, do the following:
	Swap and to compute the total cost of the configuration
	Select the medoids with the lowest cost of the configuration.
(iv)	If there is no change in the assignments, repeat steps 2 and 3 alternatively.