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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Considering that we are extracting a high-pass filtered version of the western blots, Figure 11 confirms the findings reported in [35], [36], i.e., that original natural images show a more homogeneous behavior in the high-frequency components concerning synthetically generated ones.”
From Forensic Analysis of Synthetically Generated Western Blot Images (2022) · cites this paper as [35]
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221 · cited 2×
“However, the general problem of estimating the measure for a large class of sets, say the sets measure-able in Borel’s sense, is not solvable (for a discussion, see e.g. Vapnik, 1998).”
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Self-citationA training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992 · cited 1×
“F , i.e. a map into an inner product space F such that the inner product in the image of can be computed by evaluating some simple kernel (Boser et al., 1992; Vapnik, 1995; Sch¨olkopf et al., 1999a) k(x;y) = x) (cid:8)(y)); (2) such as the Gaussian kernel k(x;y) = e (cid:0)kx(cid:0)yk 2 =c : (3)…”
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789 · cited 1×
“a function such that most of the data will live in the region where the function is nonzero (Schölkopf et al., 1999).”
BackgroundSelf-citationFast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Self-citationMaking Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411 · cited 1×
“This scan can be accelerated by not checking patterns which are on the correct side of the hyperplane by a large margin, using the method of Joachims (1999).”
Research works printed but not linked: 4
- 10.2307/2289162 · doi:10.2307/2289162
- 10.2307/2286331 · doi:10.2307/2286331
- Shawe-Taylor J., 2000, IEEE Transactions on Information Theory. Submitted.
- Williamson R. C., 1998, IEEE Transactions on Information Theory (in press).
Cited by
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Self-citationChandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“A model to detect intrusions in telephone networks was proposed by Scott [2001] and for modeling web click data by Ihler et al.”
MethodHe, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
“Representative works in this area include the one-class SVMs [74], [104], [105], [106], [107], [108] and the autoassociator (or autoencoder) method [109], [110], [111], [112].”
MethodSupport Vector Data Description
Tax, D. M. J., & Duin, R. P. W. (2004) · Machine Learning · doi:10.1023/b:mach.0000008084.60811.49 · Cited by 3,512
“Although this is not a closed boundary around the data, it gives comparable solutions when the data is preprocessed to have unit norm (see also Schölkopf et al., 1999a).”
BackgroundMethodInfluential
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.