期刊
COMPUTATIONAL STATISTICS & DATA ANALYSIS
卷 98, 期 -, 页码 19-30出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.csda.2015.12.011
关键词
Tukey depth; Exact algorithm; Projection; Combinatorial algorithm; Orthogonal complement
For computing the exact value of the halfspace depth of a point w.r.t. a data cloud of n points in arbitrary dimension, a theoretical framework is suggested. Based on this framework a whole class of algorithms can be derived. In all of these algorithms the depth is calculated as the minimum over a finite number of depth values w.r.t. proper projections of the data cloud. Three variants of this class are studied in more detail. All of these algorithms are capable of dealing with data that are not in general position and even with data that contain ties. As is shown by simulations, all proposed algorithms prove to be very efficient. (C) 2015 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据