Geometrical and computational aspects of Spectral Support Estimation for novelty detection

Authors:
Alessandro Rudi;Francesca Odone;Ernesto De Vito
Affiliations:
-;-;-
Venue:
Pattern Recognition Letters
Year:
2014

Citing 9
Cited 0

Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
A Database for Handwritten Text Recognition Research

IEEE Transactions on Pattern Analysis and Machine Intelligence
Novelty detection: a review—part 1: statistical approaches

Signal Processing
Estimating the Support of a High-Dimensional Distribution

Neural Computation
Kernel PCA for novelty detection

Pattern Recognition
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples

The Journal of Machine Learning Research
Spectral algorithms for supervised learning

Neural Computation
Anomaly detection: A survey

ACM Computing Surveys (CSUR)
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

SIAM Review

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this paper we discuss the Spectral Support Estimation algorithm (De Vito et al., 2010) by analyzing its geometrical and computational properties. The estimator is non-parametric and the model selection depends on three parameters whose role is clarified by simulations on a two-dimensional space. The performance of the algorithm for novelty detection is tested and compared with its main competitors on a collection of real benchmark datasets of different sizes and types.