This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
A post pruning procedure is designed to deal with the overfitting problem, and two criteria that are the minimum covering rate and the minimum error rate are defined.
同时，基于最小覆盖率和最小错误率给出了一种克服过学习问题的后处理方法。
应用推荐