Fig. 1
From: Emotion recognition and school violence detection from children speech
Example of consequential eliminating process in LFA table. Figure 1 shows a process of CEP algorithm. Suppose Ai is the maximum accuracy value in a. For the first layer, the classifier Ci with the maximum accuracy is chosen. The testing sample is then classified by classifier Ci with feature set Fseti between label 2 and label n. Suppose the result of the first layer is n. It is believed that the testing sample does not belong to label 2. Then, lines with label 2 are eliminated from the original LFA table as shown in b. For the second layer, the above processes are repeated again with the new LFA table shown in c and another label is eliminated from the new LFA table. The rest may be deduced by analogy. After n − 2 layers of classification, there will be only one line left in the LFA table. This last classifier gives the final predicted label of the testing sample