scientific article
From MaRDI portal
Publication:3954439
zbMath0492.51017MaRDI QIDQ3954439
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General theory of distance geometry (51K05) Euclidean geometries (general) and generalizations (51M05) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
Related Items (49)
Structured low rank approximation ⋮ Some note on a positive tensor and its Hadamard powers eigenvalue ⋮ Learning functions and approximate Bayesian computation design: ABCD ⋮ Connections between the real positive semidefinite and distance matrix completion problems ⋮ Euclidean graph distance matrices of generalizations of the star graph ⋮ The cone of distance matrices ⋮ On certain linear mappings between inner-product and squared-distance matrices ⋮ Approximating a symmetric matrix ⋮ Circum-Euclidean distance matrices and faces ⋮ Finite metric spaces of strictly negative type ⋮ A cyclic projection algorithm via duality ⋮ On Euclidean distance matrices ⋮ Spline-based nonlinear biplots ⋮ From dissimilarities among species to dissimilarities among communities: a double principal coordinate analysis ⋮ Hyperspherical embedding of graphs and networks in communicability spaces ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ The communicability distance in graphs ⋮ Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy ⋮ On Euclidean distances and sphere representations ⋮ Efficient maximin distance designs for experiments in mixtures ⋮ A contribution to the visualisation of three-way arrays ⋮ Some examples of the use of distances as coordinates for euclidean geometry ⋮ Group Kernels for Gaussian Process Metamodels with Categorical Inputs ⋮ A contribution to the study of the metric and Euclidean structures of dissimilarities ⋮ On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Minimal Euclidean representations of graphs ⋮ On the nonnegative rank of Euclidean distance matrices ⋮ A variance inequality ensuring that a pre-distance matrix is Euclidean ⋮ A feasible \(k\)-means kernel trick under non-Euclidean feature space ⋮ Three theorems with applications to Euclidean distance matrices ⋮ Metric family portraits ⋮ On representations of graphs as two-distance sets ⋮ Euclidean Distance Matrices and Applications ⋮ RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point ⋮ Irregularities inX(Y) fromY(X) in linear calibration ⋮ On the Existence of Kernel Function for Kernel-Trick of k-Means ⋮ The out-of-sample problem for classical multidimensional scaling ⋮ On unit spherical Euclidean distance matrices which differ in one entry ⋮ Seeking outlying subsets under star-contoured errors ⋮ Structured dispersion and validity in linear inference ⋮ Block matrices and multispherical structure of distance matrices ⋮ Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable? ⋮ A genetic algorithm for circulant Euclidean distance matrices ⋮ Hadamard inverses, square roots and products of almost semidefinite matrices ⋮ The best Euclidean fit to a given distance matrix in prescribed dimensions ⋮ Properties of Euclidean and non-Euclidean distance matrices ⋮ On the Schoenberg transformations in data analysis: theory and illustrations ⋮ Metric and Euclidean properties of dissimilarity coefficients
This page was built for publication:
