Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition

DOI10.1016/J.CSDA.2010.03.012MaRDI QIDQ2445688zbMATH OpenOpenAlexFDO

Authors Hans-Friedrich Köhn

Publication date 14 April 2014

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.csda.2010.03.012

zbMATH Keywords

individual differencesorder constrained matrix decompositionRobinson form of a matrixthree-way datatwo-mode ultrametricunfolding

Mathematics Subject Classification ID

Recommendations

• The Representation of Symmetric Proximity Data: Dimensions and Classifications
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices
• scientific article; zbMATH DE number 3978172

Cites work

• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
• A simulated annealing heuristic for unidimensional and multidimensional (city-block) scaling of symmetric proximity matrices.
• Abundance matrices and seriation in archaeology
• An Algorithm for Restricted Least Squares Regression
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Applied multivariate statistical analysis.
• Applied Multiway Data Analysis
• Best approximation in inner product spaces
• Combinatorial data analysis. Optimization by dynamic programming
• Combinatorial individual differences scaling within the city-block metric
• ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
• Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• scientific article; zbMATH DE number 1803767 (Why is no real title available?)
• scientific article; zbMATH DE number 3885093 (Why is no real title available?)
• scientific article; zbMATH DE number 3973706 (Why is no real title available?)
• scientific article; zbMATH DE number 3766832 (Why is no real title available?)
• scientific article; zbMATH DE number 43868 (Why is no real title available?)
• scientific article; zbMATH DE number 46169 (Why is no real title available?)
• scientific article; zbMATH DE number 53860 (Why is no real title available?)
• scientific article; zbMATH DE number 3521374 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1113988 (Why is no real title available?)
• scientific article; zbMATH DE number 918093 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• Incidence matrices, interval graphs and seriation in archeology
• Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
• Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices
• Points of view analysis revisited: Fitting multidimensional structures to optimal distance components with cluster restrictions on the variables
• Robinson Cubes
• Spatial, non-spatial and hybrid models for scaling
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• The approximation of two-mode proximity matrices by sums of order-constrained matrices
• The representation of three-way proximity data by single and multiple tree structure models
• The Structural Representation of Proximity Matrices with MATLAB
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.

Describes a project that uses

Uses Software

• smacof

This page was built for publication: Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445688)