The Representation of Symmetric Proximity Data: Dimensions and Classifications
From MaRDI portal
Recommendations
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Linear and circular unidimensional scaling for symmetric proximity matrices
- scientific article; zbMATH DE number 3978172
Cited in
(14)- Correspondence analysis and optimal structural representations
- The circumplex: a slightly stronger than ordinal approach.
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Inference of a dyadic measure and its simplicial geometry from binary feature data and application to data quality
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
- Classification of asymmetric proximity data
- scientific article; zbMATH DE number 3978172 (Why is no real title available?)
- Linear and circular unidimensional scaling for symmetric proximity matrices
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- The Structural Representation of Proximity Matrices with MATLAB
- scientific article; zbMATH DE number 5057721 (Why is no real title available?)
- Adequateness and interpretability of objective functions in ordinal data analysis
- Two types of single-peaked data: correspondence analysis as an alternative to principal component analysis
This page was built for publication: The Representation of Symmetric Proximity Data: Dimensions and Classifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243001)
