Pages that link to "Item:Q1695422"
From MaRDI portal
The following pages link to Fast implementation of the Tukey depth (Q1695422):
Displaying 14 items.
- The random Tukey depth (Q1023863) (← links)
- Multiple-try simulated annealing algorithm for global optimization (Q1721625) (← links)
- Absolute approximation of Tukey depth: theory and experiments (Q1941220) (← links)
- Computation of quantile sets for bivariate ordered data (Q2076122) (← links)
- Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (Q2184405) (← links)
- K-sign depth: from asymptotics to efficient implementation (Q2242867) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- Integrated rank-weighted depth (Q2274931) (← links)
- Fast implementation of depth contours using topological sweep (Q2768366) (← links)
- Fast Computation of Tukey Trimmed Regions and Median in Dimension <i>p</i> > 2 (Q3391277) (← links)
- Approximating Tukey's Depth (Q4431284) (← links)
- Approximate calculation of Tukey's depth and median with high-dimensional data (Q4987798) (← links)
- (Q5501289) (← links)
- Tukey’s Depth for Object Data (Q6077569) (← links)