Estimation of Correlation Coefficients by Ellipsoidal Trimming
From MaRDI portal
Publication:3876863
DOI10.2307/2347157zbMath0436.62062OpenAlexW2795487203MaRDI QIDQ3876863
Publication date: 1978
Published in: Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2347157
outlierstrimmingestimation of correlation coefficientsmid-truncationminimal content elliptsoidoptimal design algorithms
Optimal statistical designs (62K05) Measures of association (correlation, canonical correlation, etc.) (62H20) Monte Carlo methods (65C05) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Computing minimum-volume enclosing ellipsoids for large datasets, Exact primitives for smallest enclosing ellipses, Minimum-volume ellipsoids containing compact sets: Application to parameter bounding, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Component-Trees and Multi-value Images: A Comparative Study, Robust Winsorized Regression Using Bootstrap Approach, A comparative study on multivariate mathematical morphology, Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms, Robust identification and control based on ellipsoidal parametric uncertainty descriptions, Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier, An efficient algorithm for Elastic I‐optimal design of generalized linear models, A simulation study of the finite-sample performance of the sample scale curve as an estimator of its population counterpart, Nonparametric Ellipsoidal Approximation of Compact Sets of Random Points, A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids, Defining extremes and trimming by minimum covering sets, Removing non-optimal support points in \(D\)-optimum design algorithms., Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs, On min-max majority and deepest points, On the elimination of inessential points in the smallest enclosing ball problem, Multivariate ranking using elliptical peeling, On Combinatorial Depth Measures, The excess-mass ellipsiod, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, On greedy heuristics for computing D-efficient saturated subsets, Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs, Monotonic convergence of a general algorithm for computing optimal designs, D-optimal designs via a cocktail algorithm, Trimmed \(\tilde T^2\): A robust analog of Hotelling's \(T^2\), Construction of marginally and conditionally restricted designs using multiplicative algorithms, Kernel ellipsoidal trimming, Goodness-of-fit analysis for multivariate normality based on generalized quantiles., Minimum-volume enclosing ellipsoids and core sets
