Effiden t Algorithms for Determining the Linear and Convex Separability of Point Sets

Abstract

Detennining the linear and the convex separabitity of the classes are interesting questions in the data exploration phase of building intelligent classifier systems. In this paper I propose novel algorithms for finding the answer to these questions efhciently. I demonstrate by experiments on real-world datasets that the  algorithms compare favorably in running time with other known methods.