Estimating the support of a high-dimensional distribution - PubMed Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2001 Jul;13(7):1443-71.
doi: 10.1162/089976601750264965.

Estimating the support of a high-dimensional distribution

B Schölkopf  1 , J C Platt, J Shawe-Taylor, A J Smola, R C Williamson
Affiliations

Estimating the support of a high-dimensional distribution

B Schölkopf et al. Neural Comput. 2001 Jul.

Abstract

Suppose you are given some data set drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S equals some a priori specified value between 0 and 1. We propose a method to approach this problem by trying to estimate a function f that is positive on S and negative on the complement. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length of the weight vector in an associated feature space. The expansion coefficients are found by solving a quadratic programming problem, which we do by carrying out sequential optimization over pairs of input patterns. We also provide a theoretical analysis of the statistical performance of our algorithm. The algorithm is a natural extension of the support vector algorithm to the case of unlabeled data.

PubMed Disclaimer

Similar articles

See all similar articles

Cited by

See all "Cited by" articles

LinkOut - more resources