相关论文: A Correlation-Based Distance
Most Machine Learning (ML) methods, from clustering to classification, rely on a distance function to describe relationships between datapoints. For complex datasets it is hard to avoid making some arbitrary choices when defining a distance…
We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-R\'enyi Maximum Correlation Coefficient. RDC is defined in terms…
The geometric median, a notion of center for multivariate distributions, has gained recent attention in robust statistics and machine learning. Although conceptually distinct from the mean (i.e., expectation), we demonstrate that both are…
Radars often use correlation of received signals with transmitted signals to identify targets. However, when a target translates at a high uniform speed, the correlation of the transmitted and received signals depends strongly on the…
Meta-analysis involves combining summary information for related but independent studies. It uses different relationship to combine position measure as well as dispersion measures. The objective of this study is to discuss a relationship…
Data cohesion, a recently introduced measure inspired by social interactions, uses distance comparisons to assess relative proximity. In this work, we provide a collection of results which can guide the development of cohesion-based methods…
High-dimensional, large-sample astrophysical databases of galaxy clusters, such as the Chandra Deep Field South COMBO-17 database, provide measurements on many variables for thousands of galaxies and a range of redshifts. Current…
It is well-understood that different algorithms, training processes, and corpora produce different word embeddings. However, less is known about the relation between different embedding spaces, i.e. how far different sets of embeddings…
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…
Distance covariance is a popular measure of dependence between random variables. It has some robustness properties, but not all. We prove that the influence function of the usual distance covariance is bounded, but that its breakdown value…
In this short note, we show that the distance function to any finite set $X\subset \mathbb{R}^n$ is a topological Morse function, regardless of whether $X$ is in general position. We also precisely characterize its topological critical…
We investigate a relationship network of humans located in a metric space where relationships are drawn according to a distance-dependent probability density. The obtained spatial graph allows us to calculate the average separation of…
The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse of the average distance, known as the (classic) closeness…
We introduce the basic techniques used for the analysis of three dimensional and two dimensional galaxy samples. We report the correlation analysis of various redshift surveys which shows that the available data are consistent with each…
We exactly calculate two-point spatial correlation functions in steady state in a broad class of conserved-mass transport processes, which are governed by chipping, diffusion and coalescence of masses. We find that the spatial correlations…
We survey some basic results on the Gromov-Prohorov distance between metric measure spaces. (We do not claim any new results.) We give several different definitions and show the equivalence of them. We also show that convergence in the…
We present the correlation function of the luminosity distances in a flat $\Lambda$CDM universe. Decomposing the luminosity distance fluctuation into the velocity, the gravitational potential, and the lensing contributions, we study their…
A novel method for correlation analysis using scale-dependent Renyi entropies is described. The method involves calculating the entropy of a data distribution as an explicit function of the scale of a d-dimensional partition of d-cubes,…