The best Euclidean fit to a given distance matrix in prescribed dimensions (Q1061193): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Extreme properties of eigenvalues of a hermitian transformation and singular values of the sum and product of linear transformations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5800822 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3954439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some properties of clasical multi-dimesional scaling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inequalities: theory of majorization and its applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert'' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Extremum Property of Sums of Eigenvalues / rank | |||
Normal rank |
Latest revision as of 17:18, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The best Euclidean fit to a given distance matrix in prescribed dimensions |
scientific article |
Statements
The best Euclidean fit to a given distance matrix in prescribed dimensions (English)
0 references
1985
0 references
A distance matrix is defined to be a real symmetric matrix with zero diagonal and non-positive off-diagonal entries. An \(n\times n\) distance matrix \([d_{i_ j}]\) is said to be Euclidean if there exists an integer \(k\leq n\) and points \(x_ 1,...,x_ n\in {\mathbb{R}}^ k\) such that \(d_{i_ j}=-(1/2)\| x_ i-x_ j\|^ 2\), where \(\|.\|\) is the Euclidean norm on \({\mathbb{R}}^ k\). Given a distance matrix D and a fixed \(k<n\) the author finds the closest Euclidean distance matrix to D with respect to a wide class of norms on the space of symmetric \(n\times n\) matrices. The construction uses diagonalization. It is motivated by problems of scaling and clustering of multidimensional data.
0 references
Euclidean distance matrix
0 references
diagonalization
0 references
scaling
0 references
clustering
0 references
multidimensional data
0 references