Related papers: $K-$means with learned metrics
Clustering is an important exploratory data analysis technique to group objects based on their similarity. The widely used $K$-means clustering method relies on some notion of distance to partition data into a fewer number of groups. In the…
We introduce the notion of timed-Gromov--Hausdorff distance for timed-metric spaces. We prove that this distance is bi-Lipschitz equivalent to the intrinsic timed-Hausdorff distance of Sakovich--Sormani, and therefore induces the same…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
In this paper, we prove that a metric measure space which has at least one open set isometric to an interval, and for which the (possibly non-unique) optimal transport map exists from any absolutely continuous measure to an arbitrary…
The purpose of the present paper is to set up a formalism inspired from non-Archimedean geometry to study K-stability. We first provide a detailed analysis of Duistermaat-Heckman measures in the context of test configurations,…
We give the solution of the Monge-Kantorovitch problem on the Wiener space for the singular Wasserstein metric which is defined with respect to the distance of the underlying Cameron-Martin space. We show, under the hypothesis that this…
We develop a new method to estimate the area, and more generally the intrinsic volumes, of a compact subset $X$ of $\mathbb{R}^d$ from a set $Y$ that is close in the Hausdorff distance. This estimator enjoys a linear rate of convergence as…
In longitudinal data analysis, observation points of repeated measurements over time often vary among subjects except in well-designed experimental studies. Additionally, measurements for each subject are typically obtained at only a few…
It is known that Iterated Function Systems generated by orientation preserving homeomorphisms of the unit interval admit a unique invariant measure on $(0,1)$. The setup for this result is the positivity of Lyapunov exponents at both fixed…
Designing efficient, effective, and consistent metric clustering algorithms is a significant challenge attracting growing attention. Traditional approaches focus on the stability of cluster centers; unfortunately, this neglects the…
A common feature of methods for analyzing samples of probability density functions is that they respect the geometry inherent to the space of densities. Once a metric is specified for this space, the Fr\'echet mean is typically used to…
We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…
The first three sections of this paper are a survey of the author's work on balanced metrics and stability notions in algebraic geometry. The last section is devoted to proving the well-known result that a geodesically convex function on a…
The paper introduces the class of O-metric spaces, a novel generalization of metric-type spaces, classifying almost all possible metric types into upward and downward O-metrics. We list some topologies arising from O-metrics and discuss…
We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric structures and a version of the Lopez-Escobar theorem. We also…
Clustering is a fundamental unsupervised learning task with applications across a wide range of domains. Popular algorithms such as $k$-means are efficient and widely used, but can be sensitive to outliers, ambiguous boundary points, and…
Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…
The Gromov-Hausdorff distance provides a metric on the set of isometry classes of compact metric spaces. Unfortunately, computing this metric directly is believed to be computationally intractable. Motivated by applications in shape…
We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…
We work within the framework of a program aimed at exploring various extended versions for theorems from a class containing Borsuk-Ulam type theorems, some fixed point theorems, the KKM lemma, Radon, Tverberg, and Helly theorems. In this…