Expectile depth: Theory and computation for bivariate datasets

نویسندگان

چکیده

Abstract Expectiles are the solution to an asymmetric least squares minimization problem for univariate data. They resemble quantiles, and just like them, expectiles indexed by a level ? in unit interval. In present paper, we introduce discuss main properties of (multivariate) expectile regions, nested family sets, whose instance with 0 ? 1 ? 2 is built up all points projections lie between levels ? projected dataset. Such interpreted as degree centrality point respect multivariate distribution therefore serves depth function. We propose here algorithms determining extreme bivariate regions well computing plane. also study convergence sample population ones uniform consistency depth. Finally, some real data examples which Bivariate Expectile Plot (BExPlot) introduced.

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

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

منابع مشابه

Algorithms for bivariate zonoid depth

Zonoid depth is a new notion of data depth proposed by Dy-ckerhoff et al [DKM96]. We give efficient algorithms for solving several zonoid depth problems for 2-dimensional (bi-variate) data. Data depth measures how deep or central a given point 0 in 1 3 2 is relative to a given data cloud or a probability distribution in 1 4 2. Some examples of data depth are halfspace, simplicial, convex hull p...

متن کامل

Algorithms for Bivariate Majority Depth

The majority depth of a point with respect to a point set is the number of major sides it is in. An algorithm for majority depth in R is given in this paper, and it is the first algorithm to compute the majority depth. This algorithm runs in O((n+m) log n) time with Brodal and Jacob’s data structure, and in O ( (n + m) log n log log n ) time in the word RAM model.

متن کامل

Exact computation of bivariate projection depth and the Stahel-Donoho estimator

The idea of data depth provides a new and promising methodology for multivariate nonparametric analysis. Nevertheless, the computation of data depth and the depth function has remained as a very challenging problem which has hindered the methodology from becoming more prevailing in practice. The same is true for the powerful Stahel–Donoho (S–D) estimator. Here, we present an exact algorithm for...

متن کامل

Theory of Bivariate Ace

Recently, L. Breiman and l.R. Friedman introduced a non-parametric method for estimating transformations in regression data, the so called ACE-algorithm. This method promises to become one of the most powerful tools in data analysis, if some pitfalls are avoided. We point out some unexpected features in ACE as well as some curiosities in its mathematics which relate to tomography and projection...

متن کامل

Expectile Matrix Factorization for Skewed Data Analysis

Matrix factorization is a popular approach to solving matrix estimation problems based on partial observations. Existing matrix factorization is based on least squares and aims to yield a low-rank matrix to interpret the conditional sample means given the observations. However, in many real applications with skewed and extreme data, least squares cannot explain their central tendency or tail di...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2021

ISSN: ['0047-259X', '1095-7243']

DOI: https://doi.org/10.1016/j.jmva.2021.104757