Estimation of high-density regions using one-class neighbor machines
IEEE Transactions on Pattern Analysis and Machine Intelligence2006Vol. 28(3), pp. 476–480
Citations Over TimeTop 10% of 2006 papers
Abstract
In this paper, we investigate the problem of estimating high-density regions from univariate or multivariate data samples. We estimate minimum volume sets, whose probability is specified in advance, known in the literature as density contour clusters. This problem is strongly related to One-Class Support Vector Machines (OCSVM). We propose a new method to solve this problem, the One-Class Neighbor Machine (OCNM) and we show its properties. In particular, the OCNM solution asymptotically converges to the exact minimum volume set prespecified. Finally, numerical results illustrating the advantage of the new method are shown.
Related Papers
- → Outliers in multivariate time series(2000)166 cited
- → Theory and practice of multivariate arma forecasting(1984)41 cited
- → Comparing multivariate and univariate subject-specific reference regions for blood constituents in healthy persons.(1982)19 cited
- → A multivariate approach to a specific problem of grouping maize cultivars(1990)5 cited
- → Forecasting Precious Metal Returns with Multivariate Random Forests(2017)3 cited