Construction of class regions by a randomized algorithm: a randomized subclass method
作者：
Highlights：
•
摘要
A randomized algorithm is proposed for solving the problem of finding hyper-rectangles, sufficiently approximating the true region in each class. This method yields a suboptimal solution, but is more efficient than previous methods. The performance is analysed based on a criterion of PAC (Probably Approximately Correct) learning. Experimental results show that the proposed method can solve large problems which were not able to be solved previously.
论文关键词：Subclass method,Randomized algorithmDiscrimination,Hyper-rectangles,PAC learning,Computational learning theory
论文评审过程：Received 23 September 1994, Revised 5 July 1995, Accepted 18 August 1995, Available online 7 June 2001.
论文官网地址：https://doi.org/10.1016/0031-3203(95)00107-7
