Mahalanobis-based one-class classification

Machine learning techniques have become very popular in the past decade for detecting nonlinear relations in large volumes of data. In particular, one-class classification algorithms have gained the interest of the researchers when the available samples in the training set refer to a unique/single c...

Full description

Saved in:
Bibliographic Details
Main Authors: Nader, Patric, Honeine, Paul, Beauseroy, Pierre
Format: Conference Proceeding
Language:English
Subjects:
Covariance matrices
Eigenvalues and eigenfunctions
Kernel
Kernel methods
Mahalanobis distance
Matrix decomposition
one-class classification
Pipelines
Support vector machines
Training
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Machine learning techniques have become very popular in the past decade for detecting nonlinear relations in large volumes of data. In particular, one-class classification algorithms have gained the interest of the researchers when the available samples in the training set refer to a unique/single class. In this paper, we propose a simple one-class classification approach based on the Mahalanobis distance. We make use of the advantages of kernel whitening and KPCA in order to compute the Mahalanobis distance in the feature space, by projecting the data into the subspace spanned by the most relevant eigenvectors of the covariance matrix. We also propose a sparse formulation of this approach. The tests are conducted on simulated data as well as on real data.
ISSN:1551-2541
2378-928X
DOI:10.1109/MLSP.2014.6958934