Digital Commons Network^™

One-Class-At-A-Time Removal Sequence Planning Method For Multiclass Classification Problems, Chieh-Neng Young, Chen-Wen Yen, Yi-Hua Pao, Mark L. Nagurka

Mechanical Engineering Faculty Research and Publications

Using dynamic programming, this work develops a one-class-at-a-time removal sequence planning method to decompose a multiclass classification problem into a series of two-class problems. Compared with previous decomposition methods, the approach has the following distinct features. First, under the one-class-at-a-time framework, the approach guarantees the optimality of the decomposition. Second, for a K-class problem, the number of binary classifiers required by the method is only K-1. Third, to achieve higher classification accuracy, the approach can easily be adapted to form a committee machine. A drawback of the approach is that its computational burden increases rapidly with the number of classes. …