Estimating the Support of a High-Dimensional Distribution
TL;DR: In this paper, the authors propose a method to estimate a function f that is positive on S and negative on the complement of S. 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Context-Aware Implicit Authentication of Smartphone Users Based on Multi-Sensor Behavior
Renzhong Wang,Dan Tao +1 more
TL;DR: A context-aware implicit authentication is proposed, which is a scheme to improve the robustness of authentication by introducing context awareness module and can effectively improve the reliability and practicability of implicit authentication.
Anomaly Detection Framework for Wearables Data: A Perspective Review on Data Concepts, Data Analysis Algorithms and Prospects
Jithin S. Sunny,Chinari Pawan Kumar Patro,Khushi Karnani,Sandeep C. Pingle,Feng Lin,Misa Anekoji,Lawrence D. Jones,Santosh Kesari,Shashaanka Ashili +8 more
TL;DR: The nature of the wearables-associated data and the downstream processing methods for detecting anomalies are reviewed, and supervised and un-supervised techniques as well as semi-super supervised methods that overcome the challenges of missing andun-annotated healthcare data are reviewed.
A study on the stationarity and Gaussianity of the background noise in land-seismic prospecting
TL;DR: In this article, the authors used statistical tests to assess the stationarity and Gaussianity of land seismic data, and found that the nonstationary noise always had more energy in the highfrequency band, which varied with the acquisition environments.
39
•Posted Content
Detecting Anomalous Online Reviewers: An Unsupervised Approach Using Mixture Models
TL;DR: In this article, a hierarchical unsupervised approach is proposed to detect anomalous behavior in online reviewers, in which they derive distributions for key features that define reviewer behavior and combine these distributions into a finite mixture model.
39
TimeAutoAD: Autonomous Anomaly Detection With Self-Supervised Contrastive Loss for Multivariate Time Series
TL;DR: In this paper , the authors proposed a self-supervised contrastive loss to distinguish the original time series and the generated time series in multivariate time series data, which can improve the representation learning capability and the anomaly detection performance.
39
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
•Book
The Nature of Statistical Learning Theory
Vladimir Vapnik
- 01 Jan 1995
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
46K
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
A training algorithm for optimal margin classifiers
Bernhard E. Boser,Isabelle Guyon,Vladimir Vapnik +2 more
- 01 Jul 1992
TL;DR: A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
A tutorial on support vector regression
TL;DR: This tutorial gives an overview of the basic ideas underlying Support Vector (SV) machines for function estimation, and includes a summary of currently used algorithms for training SV machines, covering both the quadratic programming part and advanced methods for dealing with large datasets.
Related Papers (5)
Vladimir Vapnik
- 01 Jan 1995
Vladimir Vapnik
- 01 Jan 1998