Document Type

Conference Proceeding

Publication Date

12-1-2001

Publication Title

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Abstract

The concept of location depth was introduced in statistics as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. These reguire the computation of depth regions, which form a collection of nested polygons. The center of the deepest region is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all depth contours in &Ogr;(n 2) time and space, using topological sweep of the dual arrangement of lines. Once the contours are known, the location depth of any point is computed in &Ogr;(log 2 n) time. We provide fast implementations of these algorithms to allow their use in everyday statistical practice. Copyright © 2009 ACM, Inc.

Keywords

Algorithms, Measurement, Performance, Theory

First Page

690

Last Page

699

Comments

Archived as published.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.