Q-OCSVM: A q-quantile estimator for high-dimensional distributions

Assaf Glazer, Michael Lindenbaum, Shaul Markovitch

Research output: Contribution to journalConference articlepeer-review

20 Scopus citations

Abstract

In this paper we introduce a novel method that can efficiently estimate a family of hierarchical dense sets in high-dimensional distributions. Our method can be regarded as a natural extension of the one-class SVM (OCSVM) algorithm that finds multiple parallel separating hyperplanes in a reproducing kernel Hilbert space. We call our method q-OCSVM, as it can be used to estimate q quantiles of a highdimensional distribution. For this purpose, we introduce a new global convex optimization program that finds all estimated sets at once and show that it can be solved efficiently. We prove the correctness of our method and present empirical results that demonstrate its superiority over existing methods.

Original languageEnglish
JournalAdvances in Neural Information Processing Systems
StatePublished - 1 Jan 2013
Externally publishedYes
Event27th Annual Conference on Neural Information Processing Systems, NIPS 2013 - Lake Tahoe, NV, United States
Duration: 5 Dec 201310 Dec 2013

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'Q-OCSVM: A q-quantile estimator for high-dimensional distributions'. Together they form a unique fingerprint.

Cite this