Article ID Journal Published Year Pages File Type
428842 Information Processing Letters 2015 5 Pages PDF
Abstract

•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].

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the approximability of the Largest Sphere Rule Ensemble Classification problem
Authors
, ,