Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 57 of the 58 references it cites were found in a registry or an index.

Estimating the Support of a High-Dimensional Distribution

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.

Overview

Integrity signals

Registry

Crossref · 10.1162/089976601750264965

Cites

57 of 57 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 58 references

Research works printed but not linked: 4

  1. 10.2307/2289162 · doi:10.2307/2289162
  2. 10.2307/2286331 · doi:10.2307/2286331
  3. Shawe-Taylor J., 2000, IEEE Transactions on Information Theory. Submitted.
  4. Williamson R. C., 1998, IEEE Transactions on Information Theory (in press).

Cited by

See all 6,168

Metadata

Authors
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C.
Affiliations
  • Microsoft Research (United Kingdom) (GB)
  • Microsoft (United States) (US)
  • Royal Holloway University of London (GB)
  • Australian National University (AU)
Venue
Neural Computation
Publisher
MIT Press
Published
2001-07-01
Volume
13
Issue
7
Pages
1443-1471
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2132870739
Cited by
6,168
References
58
Citations by year
2026: 487 · 2025: 433 · 2024: 378 · 2023: 389 · 2022: 328 · 2021: 446 · 2020: 378 · 2019: 383 · 2018: 278 · 2017: 248 · 2016: 265 · 2015: 249 · 2014: 258 · 2013: 221 · 2012: 189
FWCI
59.56
Type
journal article
Language
en
Open access
closed
Locations
  • Neural Computation (publishedVersion)
  • PubMed (publishedVersion)
  • ePrints Soton (University of Southampton) (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
  • ANU Open Research (Australian National University) (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
Funders
European Commission
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
support estimation, high-dimensional distributions, kernel expansion, support vector machine, unlabeled data, regularization, quadratic programming, sequential optimization, statistical performance analysis, density estimation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Estimating the Support of a High-Dimensional Distribution. https://app.cochat.ai/papers/10.1162/089976601750264965
The paper
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the Support of a High-Dimensional Distribution. Neural Computation. https://doi.org/10.1162/089976601750264965

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.