The following pages link to (Q3954439):
Displaying 49 items.
- On the Schoenberg transformations in data analysis: theory and illustrations (Q263290) (← links)
- Learning functions and approximate Bayesian computation design: ABCD (Q296301) (← links)
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- The communicability distance in graphs (Q414715) (← links)
- A contribution to the visualisation of three-way arrays (Q458623) (← links)
- Three theorems with applications to Euclidean distance matrices (Q581508) (← links)
- Metric family portraits (Q582731) (← links)
- A contribution to the study of the metric and Euclidean structures of dissimilarities (Q676499) (← links)
- RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point (Q746340) (← links)
- On Euclidean distance matrices (Q884414) (← links)
- Minimal Euclidean representations of graphs (Q965947) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- The out-of-sample problem for classical multidimensional scaling (Q1023816) (← links)
- The best Euclidean fit to a given distance matrix in prescribed dimensions (Q1061193) (← links)
- Properties of Euclidean and non-Euclidean distance matrices (Q1061194) (← links)
- Metric and Euclidean properties of dissimilarity coefficients (Q1075719) (← links)
- On certain linear mappings between inner-product and squared-distance matrices (Q1102346) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- Some examples of the use of distances as coordinates for euclidean geometry (Q1176392) (← links)
- A genetic algorithm for circulant Euclidean distance matrices (Q1294348) (← links)
- Hadamard inverses, square roots and products of almost semidefinite matrices (Q1300864) (← links)
- Finite metric spaces of strictly negative type (Q1377510) (← links)
- Euclidean graph distance matrices of generalizations of the star graph (Q1644108) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- Structured low rank approximation (Q1874666) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- Circum-Euclidean distance matrices and faces (Q1906789) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A feasible \(k\)-means kernel trick under non-Euclidean feature space (Q2023581) (← links)
- Some note on a positive tensor and its Hadamard powers eigenvalue (Q2135095) (← links)
- From dissimilarities among species to dissimilarities among communities: a double principal coordinate analysis (Q2187667) (← links)
- On representations of graphs as two-distance sets (Q2279265) (← links)
- On unit spherical Euclidean distance matrices which differ in one entry (Q2310405) (← links)
- Seeking outlying subsets under star-contoured errors (Q2321838) (← links)
- Spline-based nonlinear biplots (Q2418396) (← links)
- A variance inequality ensuring that a pre-distance matrix is Euclidean (Q2496617) (← links)
- Structured dispersion and validity in linear inference (Q2564906) (← links)
- Block matrices and multispherical structure of distance matrices (Q2564954) (← links)
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable? (Q2565634) (← links)
- The cone of distance matrices (Q2639130) (← links)
- Approximating a symmetric matrix (Q2641074) (← links)
- On Euclidean distances and sphere representations (Q2698540) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Group Kernels for Gaussian Process Metamodels with Categorical Inputs (Q3296931) (← links)
- On the Existence of Kernel Function for Kernel-Trick of k-Means (Q3388208) (← links)
- Efficient maximin distance designs for experiments in mixtures (Q5127056) (← links)
- Irregularities in<i>X</i>(<i>Y</i>) from<i>Y</i>(<i>X</i>) in linear calibration (Q5218918) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
- Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy (Q6159081) (← links)