On the approximability of the Largest Sphere Rule Ensemble Classification problem

• Design of an approximation algorithm.
• Proof of an inapproximability result.
• Proof of NP-completeness of WRECRF.

In this paper, we discuss the approximability of the Largest Sphere Rule Ensemble Classification problem (LSRES). This problem is closely related to the Weighted Rule Ensemble Classification Reversal problem (WRECR) [2].