AS 307

Algorithm AS 307: Bivariate location depth. he half-space depth of a point θ relative to a bivariate data set {x 1 ,⋯,x n } is given by the smallest number of data points contained in a closed half-plane of which the boundary line passes through θ. A straightforward algorithm for the half-space depth needs O(n 2 ) steps. The simplicial depth of θ relative to {x 1 ,⋯,x n } is given by the number of data triangles Δ(x i ,x j ,x k ) that contain θ; this appears to require O(n 3 ) steps. The algorithm proposed here computes both depths in O(nlogn) time, by combining geometric properties with certain sorting and updating mechanisms. Both types of depth can be used for data description, bivariate confidence regions, p-values, quality indices and control charts. Moreover, the algorithm can be extended to the computation of depth contours and bivariate sign test statistics.

References in zbMATH (referenced in 61 articles , 1 standard article )

Showing results 1 to 20 of 61.
Sorted by year (citations)

1 2 3 4 next

  1. Aloupis, Greg; Stephen, Tamon; Zasenko, Olga: Computing colourful simplicial depth and Median in (\mathbbR_2) (2022)
  2. Hamel, Andreas H.; Kostner, Daniel: Computation of quantile sets for bivariate ordered data (2022)
  3. Cascos, Ignacio; Ochoa, Maicol: Expectile depth: theory and computation for bivariate datasets (2021)
  4. Pilz, Alexander; Welzl, Emo; Wettstein, Manuel: From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (2020)
  5. De Loera, Jesús A.; Goaoc, Xavier; Meunier, Frédéric; Mustafa, Nabil H.: The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (2019)
  6. Tian, Yahui; Gel, Yulia R.: Fusing data depth with complex networks: community detection with prior information (2019)
  7. Bogićević, Milica; Merkle, Milan: Approximate calculation of Tukey’s depth and median with high-dimensional data (2018)
  8. Durocher, Stephane; Fraser, Robert; Leblanc, Alexandre; Morrison, Jason; Skala, Matthew: On combinatorial depth measures (2018)
  9. Gagolewski, Marek: Penalty-based aggregation of multidimensional data (2017)
  10. Hubert, Mia; Rousseeuw, Peter; Segaert, Pieter: Multivariate and functional classification using depth and distance (2017)
  11. Liu, Xiaohui: Fast implementation of the Tukey depth (2017)
  12. Dyckerhoff, Rainer; Mozharovskyi, Pavlo: Exact computation of the halfspace depth (2016)
  13. Serfling, Robert; Wang, Yunfei: On Liu’s simplicial depth and Randles’ interdirections (2016)
  14. Zasenko, Olga; Stephen, Tamon: Algorithms for colourful simplicial depth and medians in the plane (2016)
  15. Hubert, Mia; Rousseeuw, Peter J.; Segaert, Pieter: Multivariate functional outlier detection (2015)
  16. Liu, Xiaohui; Ren, Haiping; Wang, Guofu: Computing halfspace depth contours based on the idea of a circular sequence (2015)
  17. Xiaohui Liu; Yijun Zuo: CompPD: A MATLAB Package for Computing Projection Depth (2015) not zbMATH
  18. Li, Zhonghua; Dai, Yi; Wang, Zhaojun: Multivariate change point control chart based on data depth for phase I analysis (2014)
  19. López-Pintado, Sara; Sun, Ying; Lin, Juan K.; Genton, Marc G.: Simplicial band depth for multivariate functional data (2014)
  20. Mustafa, Nabil H.; Tiwary, Hans Raj; Werner, Daniel: A proof of the Oja depth conjecture in the plane (2014)

1 2 3 4 next