Skip to main content
. 2015 Jul 31;9(6):627–638. doi: 10.1007/s11571-015-9350-4

Table 2.

The GRSOMO and GRSOMU algorithms

(i) Let T be the original unbalanced training set with n+m samples, where n>m. And let T=PN, where P contains only the data in the minority class with m samples and N contains only data in the majority class with n samples
(ii) IF GRSOMO is desired THEN DO steps (iii)–(v)
(iii) Use GRSOM to generate new data from P for n-m samples such that P is used as an input of the GRSOM function, i.e. GRSOM(X,tmax) where XP. Then, the function will return the n-m samples which are contained in the new grown data set X+, i.e. X+ GRSOM(X,tmax). Note that, in the case of over-sampling approach, tmaxn-m-N(t=0)
(iv) P+X+ and P++PP+. Thus, the number of samples in the minority class can be adjusted from m to m+(n-m)=n samples which equals to the number of samples in the majority class
(v) Define the balanced training set as T+P++N and GO TO ix)
(vi) IF GRSOMU is desired THEN DO steps vii) to viii)
(vii) Use GRSOM to generate new data from N for m samples in which N is used as an input of the GRSOM function, i.e. GRSOM(X) where XN. Then, the function will return the new grown data set X+ with m samples, i.e. tmaxm-N(t=0), X+ GRSOM(X, tmax)
(viii) N+X+ and T+N+P. Note that only the m samples will be generated for the majority class which equals to original number of samples in the minority class. This leads to the balanced training set T+
(ix) Return T+
(x) END