Data pre-classification and the separation law for closed bounded convex sets
In this article, we give a new pre-classification paradigm in data classification, which is based on the separation law for convex sets by sets. The geometric formulation of the separation law gives many possibilities to pre-classify the elements of two data sets, which may have a nonempty intersection by three types of data. The algebraic formulation of the separation law can be used to formulate a nonsmooth optimization problem in order to determine an optimal pre-classification.
separation law data classification convex analysis