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

Algorithm 5

The process of Reformed Sample Selection Method.

	Require: Training input data matrix , and the threshold of CDS .
	Ensure: the filtered memory .
(1)	random set as the initial centroids;
(2)	Associate each samples with the nearest centroid by Euclidean distance;
(3)	Recalculate the position of centroids ;
(4)	Repeat step 2 and 3 and calculate based on (14);
(5)	Get with labels until value of is no change;
(6)	Sort by class;
(7)	Set the threshold of CDS as ;
(8)	Set the initial filter memory ;
(9)	fordo
(10)	Calculate the average value of correlation (AC) between and ;
(11)	ifthen
(12)	;
(13)	else
(14)	=  .
(15)	end if
(16)	end for
(17)	return