ABSTRACT. In this paper we present the maximum simplicial depth estimator and compare it to the ordinary least square estimator in examples from 2D and 3D shape analysis focusing on bivariate and multivariate allometrical problems from zoology and biological anthropology. We compare two types of estimators derived under different subsets of parametric space on the basis of the linear regression model, θ = (θ1, θ2) T ∈ R2 and θ = (θ1, θ2, θ3)T ∈ R3, where θ3 = 0. We also discuss monotonically decreasing linear regression models in special situations. In applications where outliers in x- or y-axis direction occur in the data and residuals from ordinary least-square linear regression model are not normally distributed, we recommend the use of ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
AbstractA general depth measure, based on the use of one-dimensional linear continuous projections, ...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...
In this paper we present the maximum simplicial depth estimator and compare it to the ordinary least...
In this paper we present the maximum simplicial depth estimator and compare it to the ordinary least...
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial r...
AbstractGlobal depth, tangent depth and simplicial depths for classical and orthogonal regression ar...
AbstractA general approach for developing distribution free tests for general linear models based on...
diverse methods for analyzing size-free shape differences tend to be guided by computational expedie...
Classical multivariate statistics measures the outlyingness of a point by its Mahalanobis distance f...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
The extension of simplicial depth to robust regression, the so-called simplicial regression depth, ...
We simplify simplicial depth for regression and autoregressive growth processes in two directions. ...
As statistical data sets grow larger and larger, the availability of fast and efficient algorithms b...
We investigate the behaviour of simplicial depth under the perturbation (1−ε)F+ε δ z , where F is a ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
AbstractA general depth measure, based on the use of one-dimensional linear continuous projections, ...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...
In this paper we present the maximum simplicial depth estimator and compare it to the ordinary least...
In this paper we present the maximum simplicial depth estimator and compare it to the ordinary least...
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial r...
AbstractGlobal depth, tangent depth and simplicial depths for classical and orthogonal regression ar...
AbstractA general approach for developing distribution free tests for general linear models based on...
diverse methods for analyzing size-free shape differences tend to be guided by computational expedie...
Classical multivariate statistics measures the outlyingness of a point by its Mahalanobis distance f...
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyp...
The extension of simplicial depth to robust regression, the so-called simplicial regression depth, ...
We simplify simplicial depth for regression and autoregressive growth processes in two directions. ...
As statistical data sets grow larger and larger, the availability of fast and efficient algorithms b...
We investigate the behaviour of simplicial depth under the perturbation (1−ε)F+ε δ z , where F is a ...
Let S be a data set of n points in R d, and ˆµ be a point in R d which “best ” describes S. Since th...
AbstractA general depth measure, based on the use of one-dimensional linear continuous projections, ...
Simplicial depth is a way to measure how deep a point is among a set of points. Efficient algorithms...