Conditional minimum volume ellipsoid with application to multiclass discrimination

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditional Minimum Volume Ellipsoid with Applications to Subset Selection for MVE Estimator and Multiclass Discrimination

In this paper, we present a new formulation for constructing an ellipsoid which generalizes the computation of the minimum volume covering ellipsoid, based on the CVaR minimization technique proposed by Rockafellar and Uryasev (2002). The proposed ellipsoid construction is formulated as a convex optimization and an interior point algorithm for the solution can be developed. In addition, the opt...

متن کامل

The Minimum Volume Ellipsoid Metric

We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ellipsoid (MVE) covering its neighborhood which characterizes the correlations and variances of its neighborhood variables. Algebraically, the algorithm maximizes the determinant of the local covariance matrix which amount...

متن کامل

On the Minimum Volume Covering Ellipsoid of Ellipsoids

We study the problem of computing a (1+ )-approximation to the minimum volume covering ellipsoid of a given set S of the convex hull of m full-dimensional ellipsoids in Rn. We extend the first-order algorithm of Kumar and Yıldırım that computes an approximation to the minimum volume covering ellipsoid of a finite set of points in Rn, which, in turn, is a modification of Khachiyan’s algorithm. F...

متن کامل

On the Minimum Volume Covering Ellipsoid of Ellipsoids

Let S denote the convex hull of m full-dimensional ellipsoids in Rn. Given > 0 and δ > 0, we study the problems of computing a (1 + )-approximation to the minimum volume covering ellipsoid of S and a (1 + δ)n-rounding of S. We extend the first-order algorithm of Kumar and Yıldırım that computes an approximation to the minimum volume covering ellipsoid of a finite set of points in Rn, which, in ...

متن کامل

Location adjustment for the minimum volume ellipsoid estimator

Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties is the Minimum Volume Ellipsoid Estimator (MVE). Computing the exact MVE is often not feasible, so one usually resorts to an approximate algorithm. In the regression setup, algorithms for positive-breakdown estimators...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Optimization and Applications

سال: 2007

ISSN: 0926-6003,1573-2894

DOI: 10.1007/s10589-007-9097-x