Parallel Computation of Band Depth

Ouyang, Mingxing; Xu, Hanfei; Zhurkevich, Alexander

doi:10.1109/cse.2018.00018

Search citation statements

Order By: Relevance

Paper Sections

Select...

Data Depth Of a Point Or Contour Depth Boundary1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Along with these more recent works, there are a number of papers for programs in R for computing data depth. This paper follows the approach of Ouyang, Xu, and Zhurkevich ().…”

Section: Data Depth Of a Point Or Contour Depth Boundarymentioning

confidence: 99%

Parallel computation of bivariate point data depths and display of intrinsic depth segments

DeBlois

2020

Stat

View full text Add to dashboard Cite

This paper presents a new way to compute simplicial and Tukey data depths using Open Multi‐Processing parallelization, which makes it practical to compute point depths for tens of thousands of points. The definition of point depth is the order statistic depth of a single point, here in two dimensions. Using the point depths, the regional depth characteristics of the dataset as a whole can be explored. Using this new methodology, fast parallel computation of both simplicial depth and Tukey depth for a dataset of n points has time complexity O(n2logn) with O(n) space, which is practical for n up to 100,000. Obtaining depths for a large number of points in a faster manner by parallel computation supports identifying the central region quickly, because the points of maximum depth are known. The point depth computation identifies the depths of selected spoke segments around each origin point. These spoke depths are used to create new visualizations of depth characteristics and contour depths without adding virtual points.

show abstract

“…Along with these more recent works, there are a number of papers for programs in R for computing data depth. This paper follows the approach of Ouyang, Xu, and Zhurkevich ().…”

Section: Data Depth Of a Point Or Contour Depth Boundarymentioning

confidence: 99%

Parallel computation of bivariate point data depths and display of intrinsic depth segments

DeBlois

2020

Stat

View full text Add to dashboard Cite

show abstract

Parallel Computation of Band Depth

Cited by 1 publication

References 12 publications

Parallel computation of bivariate point data depths and display of intrinsic depth segments

Parallel computation of bivariate point data depths and display of intrinsic depth segments

Contact Info

Product

Resources

About