Convex hull trimming, Advanced Statistics

Convex hull trimming: A procedure which can be applied to the set of bivariate data to permit robust estimation of the Pearson's product moment correlation coef?cient. The points de?ning convex hull of the observations, are removed before the correlation coef?cient is calculated. The main attraction of this method or technique is that it eliminates the isolated outliers without disturbing the general shape of bivariate distribution.

Posted Date: 7/27/2012 1:02:08 AM | Location : United States







Related Discussions:- Convex hull trimming, Assignment Help, Ask Question on Convex hull trimming, Get Answer, Expert's Help, Convex hull trimming Discussions

Write discussion on Convex hull trimming
Your posts are moderated
Related Questions
Change point problems : Problems with chronologically ordered data collected over the period during which there is known to have been a change in the underlying data generation cou

Quincunx  is the device used by Galton to illustrate his lectures, which is shown in the Figure. It had a glass face and a funnel at its top. The shot was passed through funnel an

MAREG is the software package for the analysis of the marginal regression models. The package permits the application of generalized estimating equations and the maximum likelihoo

The interplay of the genes and environment on, for instance, the risk of disease. The term represents the step away from the argument as to whether the nature or nurture is the pre

The Null Hypothesis - H0:  There is no heteroscedasticity i.e. β 1 = 0 The Alternative Hypothesis - H1:  There is heteroscedasticity i.e. β 1 0 Reject H0 if |t | > t = 1.96

Mixture experiment is an experiment in which the two or more ingredients are blended together to form an end product. The measurements are taken on the several blends of the ingre

Cellular proliferation models : Models are used to describe the growth of the  cell populations. One of the example is the deterministic model   where N(t) is the number of cel

This is extension of the EM algorithm which typically converges more slowly than EM in terms of the iterations but can be much faster in the whole computer time. The general idea o

The Expectation/Conditional Maximization Either algorithm which is the generalization of ECM algorithm attained by replacing some of the CM-steps of ECM which maximize the constrai

Normal approximation : Normal distributions which approximate other distributions; such as, a normal distribution with the mean np and variance np(1 - p) which acts as an approxima