Robust support function machines for set-valued data classification

Abstract

Support function machines (SFMs) have been proposed to handle set-valued data, but they are sensitive to outliers and unstable for re-sampling due to the use of the hinge loss function. To address these problems, we propose a robust SFM model with proximity functions. We first define a family of proximity functions that are used to convert set-valued data into continuous functions in a Banach space, and then we use the margin maximization in a Banach space to construct the pinball SFMs (PinSFMs). We study some properties of the proposed model, and it is interesting to observe that the optimal measure of the proposed model has a specific representation under the total variation norm. Using the representation of the optimal measure, we convert an infinite-dimensional optimization problem into a finite-dimensional optimization problem. Unlike SFMs, we employ a sampling strategy to tackle the finite-dimensional optimization problem. We theoretically show that the sparse solution determines the sparsity of the sampling points though the sampling strategy causes uncertainty for the sampling points. In addition, we achieve kernel versions of proximity functions, and the attractive property of this kernelization is that the proposed model is convex even if indefinite kernels are employed. Experiments on a series of data sets are performed to demonstrate that the proposed model is superior to some existing models in the presence of outliers.