Metric space

About: Metric space is a research topic. Over the lifetime, 18483 publications have been published within this topic receiving 351979 citations.

Some methods for classification and analysis of multivariate observations

Abstract: The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give partitions which are reasonably efficient in the sense of within-class variance. That is, if p is the probability mass function for the population, S = {S1, S2, * *, Sk} is a partition of EN, and ui, i = 1, 2, * , k, is the conditional mean of p over the set Si, then W2(S) = ff=ISi f z u42 dp(z) tends to be low for the partitions S generated by the method. We say 'tends to be low,' primarily because of intuitive considerations, corroborated to some extent by mathematical analysis and practical computational experience. Also, the k-means procedure is easily programmed and is computationally economical, so that it is feasible to process very large samples on a digital computer. Possible applications include methods for similarity grouping, nonlinear prediction, approximating multivariate distributions, and nonparametric tests for independence among several variables. In addition to suggesting practical classification methods, the study of k-means has proved to be theoretically interesting. The k-means concept represents a generalization of the ordinary sample mean, and one is naturally led to study the pertinent asymptotic behavior, the object being to establish some sort of law of large numbers for the k-means. This problem is sufficiently interesting, in fact, for us to devote a good portion of this paper to it. The k-means are defined in section 2.1, and the main results which have been obtained on the asymptotic behavior are given there. The rest of section 2 is devoted to the proofs of these results. Section 3 describes several specific possible applications, and reports some preliminary results from computer experiments conducted to explore the possibilities inherent in the k-means idea. The extension to general metric spaces is indicated briefly in section 4. The original point of departure for the work described here was a series of problems in optimal classification (MacQueen [9]) which represented special

Convergence of Probability Measures

Abstract: Weak Convergence in Metric Spaces. The Space C. The Space D. Dependent Variables. Other Modes of Convergence. Appendix. Some Notes on the Problems. Bibliographical Notes. Bibliography. Index.

Metric Spaces of Non-Positive Curvature

Abstract: This book describes the global properties of simply-connected spaces that are non-positively curved in the sense of A. D. Alexandrov, and the structure of groups which act on such spaces by isometries. The theory of these objects is developed in a manner accessible to anyone familiar with the rudiments of topology and group theory: non-trivial theorems are proved by concatenating elementary geometric arguments, and many examples are given. Part I is an introduction to the geometry of geodesic spaces. In Part II the basic theory of spaces with upper curvature bounds is developed. More specialized topics, such as complexes of groups, are covered in Part III. The book is divided into three parts, each part is divided into chapters and the chapters have various subheadings. The chapters in Part III are longer and for ease of reference are divided into numbered sections.

PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space

Abstract: Few prior works study deep learning on point sets. PointNet by Qi et al. is a pioneer in this direction. However, by design PointNet does not capture local structures induced by the metric space points live in, limiting its ability to recognize fine-grained patterns and generalizability to complex scenes. In this work, we introduce a hierarchical neural network that applies PointNet recursively on a nested partitioning of the input point set. By exploiting metric space distances, our network is able to learn local features with increasing contextual scales. With further observation that point sets are usually sampled with varying densities, which results in greatly decreased performance for networks trained on uniform densities, we propose novel set learning layers to adaptively combine features from multiple scales. Experiments show that our network called PointNet++ is able to learn deep point set features efficiently and robustly. In particular, results significantly better than state-of-the-art have been obtained on challenging benchmarks of 3D point clouds.

Gradient Flows: In Metric Spaces and in the Space of Probability Measures

Abstract: Notation.- Notation.- Gradient Flow in Metric Spaces.- Curves and Gradients in Metric Spaces.- Existence of Curves of Maximal Slope and their Variational Approximation.- Proofs of the Convergence Theorems.- Uniqueness, Generation of Contraction Semigroups, Error Estimates.- Gradient Flow in the Space of Probability Measures.- Preliminary Results on Measure Theory.- The Optimal Transportation Problem.- The Wasserstein Distance and its Behaviour along Geodesics.- Absolutely Continuous Curves in p(X) and the Continuity Equation.- Convex Functionals in p(X).- Metric Slope and Subdifferential Calculus in (X).- Gradient Flows and Curves of Maximal Slope in p(X).