Alternating multiconlitron: A novel framework for piecewise linear classification

• Alternating multiconlitron is a novel framework for piecewise linear classification.
• It is based on the concept of maximal convexly separable subset (MCSS).
• It can be constructed by support alternating multiconlitron algorithm (SAMA).
• It generally has a much simpler structure than multiconlitron.
• Experiments verify effectiveness and competitiveness of the proposed method.

Multiconlitron is a general framework for designing piecewise linear classifiers, but it may contain a relatively large number of conlitrons and linear functions. Based on the concept of maximal convexly separable subset (MCSS), we propose alternating multiconlitron as a novel framework for piecewise linear classification. Using the support alternating multiconlitron algorithm, an alternating multiconlitron can be constructed as a series of conlitrons alternately from a subset of one class to the MCSS of the other class. Experimental results show that in practice an alternating multiconlitron generally has a much simpler structure than a corresponding multiconlitron, performing very fast in testing phase with similar or better accuracies.