Distance-based and RKHS-based dependence metrics in high dimension

C Zhu, X Zhang, S Yao, X Shao - The Annals of Statistics, 2020 - JSTOR
… dence tests under the high dimensional scenario. We show that … high dimension. Under the
assumption that the components within each high dimensional vector are weakly dependent, …

A new framework for distance and kernel-based metrics in high dimensions

S Chakraborty, X Zhang - Electronic Journal of Statistics, 2021 - projecteuclid.org
… In the HDLSS setting, we show that the proposed population dependence metric behaves
as an aggregation of group-wise (generalized) distance covariances. We construct an …

hdm: High-dimensional metrics

V Chernozhukov, C Hansen, M Spindler - arXiv preprint arXiv:1608.00354, 2016 - arxiv.org
High-dimensional Metrics (hdm) is introduced. It is a collection of statistical methods for
estimation and quantification of uncertainty in high-dimensional … Moreover, the dependence

On the surprising behavior of distance metrics in high dimensional space

CC Aggarwal, A Hinneburg, DA Keim - … London, UK, January 4–6, 2001 …, 2001 - Springer
… problem of meaningfulness in high dimensionality is sensitive to the … metric L (1 norm) is
consistently more preferable than the Euclidean distance metric L (2 norm) for high dimensional

High-dimensional metrics in R

V Chernozhukov, C Hansen, M Spindler - arXiv preprint arXiv:1603.01700, 2016 - arxiv.org
dependence structure of the design matrix might be taken into consideration for calculation
of the penalization parameter with X.dependent.… is highdimensional or z is high-dimensional. …

Metric functional dependencies

N Koudas, A Saha, D Srivastava… - 2009 IEEE 25th …, 2009 - ieeexplore.ieee.org
… sponding high-dimensional (… dimension, and thus it is more effective to use the algorithms
BRUTE and 2-APPROX, by treating the high dimensional vectors as points in a general metric

Distance metrics for high dimensional nearest neighborhood recovery: Compression and normalization

SL France, JD Carroll, H Xiong - Information Sciences, 2012 - Elsevier
… d,(2) C p ⩽ lim d → ∞ E Dmax d p - Dmin d p d 1 / p - 1 / 2 ⩽ ( n - 1 ) C p , where p is the
Minkowski metric, C p is an arbitrary constant dependent on the data distribution, and Dmax d p …

Learning low-dimensional metrics

B Mason, L Jain, R Nowak - Advances in neural information …, 2017 - proceedings.neurips.cc
… learning literature have failed to quantify the precise dependence on observation noise,
dimension, rank, and our features X. Consider the fact that ap ⇥ p matrix with rank d has O(dp) …

Locally adaptive metrics for clustering high dimensional data

C Domeniconi, D Gunopulos, S Ma, B Yan… - Data Mining and …, 2007 - Springer
… could be addressed by requiring the user to specify a subspace (ie, subset of dimensions) for
… An alternative solution to high dimensional settings consists in reducing the dimensionality

One dependence value difference metric

C Li, H Li - Knowledge-Based Systems, 2011 - Elsevier
… In our experiments, we tried our best to apply our ODVDM to some high-dimensional datasets
[… Thus, how to applied our ODVDM to the high-dimensional datasets is the main research …