K-Data Depth Based Clustering Algorithm

Baidari, Ishwar; Patil, C. Y.

doi:10.1007/978-981-13-1132-1_2

Cited by 1 publication

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the same vein of data exploration, we can visualise multivariate distributions through one dimensional curves based on depth values [Liu et al, 1999]. In the past decade this depth-based inference framework has expanded to include solutions to clustering [Jörnsten, 2004, Baidari andPatil, 2019], classification [Jörnsten, 2004, Lange et al, 2014, outlier detection [Chen et al, 2009, Cárdenas-Montes, 2014, process monitoring [Liu, 1995], change-point problems [Chenouri et al, 2019] and discriminant analysis [Chakraborti and Graham, 2019]. In summary, depth functions facilitate a framework for robust, nonparametric inference in R d .…”

Section: Data Depthmentioning

confidence: 99%

Differentially private depth functions and their associated medians

Ramsay,

Chenouri

2021

Preprint

View full text Add to dashboard Cite

In this paper, we investigate the differentially private estimation of data depth functions and their associated medians. We start with several methods for privatizing depth values at a fixed point, and show that for some depth functions, when the depth is computed at an out of sample point, privacy can be gained for free when n → ∞. We also present a method for privately estimating the vector of sample depth values, and show that privacy is not gained for free asymptotically. We also introduce estimation methods for depth-based medians for both depth functions with low global sensitivity and depth functions with only highly probably, low local sensitivity. We provide a general Theorem (Lemma 1) which can be used to prove consistency of an estimator produced by the exponential mechanism, provided the asymptotic cost function is uniquely minimized and is sufficiently smooth. We introduce a general algorithm to privately estimate minimizers of a cost function which has low local sensitivity, but high global sensitivity. This algorithm combines propose-test-release with the exponential mechanism. An application of this algorithm to generate consistent estimates of the projection depth-based median is presented. For these private depth-based medians, we show that it is possible for privacy to be free when n → ∞.

show abstract