Deciding the Convex Separability of Pattern Sets
Gabor Takacs, B. Pataki · 2007
Deciding the convex separability of the classes is an interesting question in the data exploration phase of building classification systems. In this paper we propose an efficient algorithm for deciding the convex separability of two point sets in Rd. We compare our algorithm with conventional methods on 6 benchmark problems, and demonstrate that our algorithm is significantly faster.