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

Algorithm 6

The training process of R-RKELM.

	Require: Training input data matrix ; the corresponding target values with D output nodes; kernel function, k; the number of clusters, .
	Ensure: the output weights .
RELIEF-F Algorithm:
(1)	Based on RELIEF-F, the input features are processed and the output matrix can be obtained; Reformed Sample Selection Method:
(2)	Set as input data;
(3)	Return based on Algorithm 5;
(4)	=  ; Training Model:
(5)	Calculate reduced hidden matrix by (11);
(6)	Calculate output weights by (12).