Parallel support vector data description

This paper proposes an extension of Support Vector Data Description (SVDD) to provide a better data description. The extension is called Distant SVDD (DSVDD) that determines a smallest hypersphere enclosing all normal (positive) samples as seen in SVDD. In addition, DSVDD maximises the distance from centre of that hypersphere to the origin. When some abnormal (negative) samples are introduced, the DSVDD is extended to Parallel SVDD that also determines a smallest hypersphere for normal samples and at the same time determines a smallest hyperphere for abnormal samples and maximises the distance between centres of these two hyperspheres. Experimental results for classification show that the proposed extensions provide higher accuracy than the original SVDD.