A Novel Reformed Reduced Kernel Extreme Learning Machine with RELIEF-F for Classification

Algorithm 3

The process of K-means.

	Require: Training input data matrix , and the number of clusters .
	Ensure: the centroid positions .
(1)	Initialize centroids randomly;
(2)	Associate each samples with the nearest centroid by Euclidean distance;
(3)	Recalculate the position of centroids ;
(4)	Repeat step 2 and 3 until result of (14) is no change; return