Resistant estimation of multivariate location using minimum spanning trees
From MaRDI portal
Publication:2746355
DOI10.1080/00949650108812080zbMath0978.62045OpenAlexW1977558151MaRDI QIDQ2746355
Mihoko V. Bennett, Thomas R. Willemain
Publication date: 4 February 2002
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949650108812080
Related Items (4)
Efficiency of the pMST and RDELA location and scatter estimators ⋮ Robust estimation of location and scatter by pruning the minimum spanning tree ⋮ On finite-sample robustness of directional location estimators ⋮ Robust location estimation under dependence
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The random minimal spanning tree in high dimensions
- Graph-theoretic measures of multivariate association and prediction
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Robust m-estimators of multivariate location and scatter
- On Rohlf's method for the detection of outliers in multivariate data
- On constructing minimum spanning trees in \(R_ 1^ k\)
- The longest edge of the random minimal spanning tree
- Generalization of the Gap Test for the Detection of Multivariate Outliers
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
- Extremes for the minimal spanning tree on normally distributed points
- Fast Very Robust Methods for the Detection of Multiple Outliers
- Identification of Outliers in Multivariate Data
- A randomized linear-time algorithm to find minimum spanning trees
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
This page was built for publication: Resistant estimation of multivariate location using minimum spanning trees
