KERNEL WHITENING FOR ONE-CLASS CLASSIFICATION
Authors:
- 1 May 2003
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 17 (03) , 333-347
Abstract
In one-class classification one tries to describe a class of target data and to distinguish it from all other possible outlier objects. Obvious applications are areas where outliers are very diverse or very difficult or expensive to measure, such as in machine diagnostics or in medical applications. In order to have a good distinction between the target objects and the outliers, good representation of the data is essential. The performance of many one-class classifiers critically depends on the scaling of the data and is often harmed by data distributions in (nonlinear) subspaces. This paper presents a simple preprocessing method which actively tries to map the data to a spherical symmetric cluster and is almost insensitive to data distributed in subspaces. It uses techniques from Kernel PCA to rescale the data in a kernel feature space to unit variance. This transformed data can now be described very well by the Support Vector Data Description, which basically fits a hypersphere around the data. The paper presents the methods and some preliminary experimental results.Keywords
This publication has 5 references indexed in Scilit:
- Nonlinear Component Analysis as a Kernel Eigenvalue ProblemNeural Computation, 1998
- Outliers in statistical pattern recognition and an application to automatic chromosome classificationPattern Recognition Letters, 1997
- Network constraints and multi-objective optimization for one-class classificationNeural Networks, 1996
- Neural Networks for Pattern Recognition1995
- Novelty detection and neural network validationIEE Proceedings - Vision, Image, and Signal Processing, 1994