Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices

DOI10.1007/BF02294859MaRDI QIDQ2248666zbMATHFDO

Authors Lawrence Hubert, Phipps Arabie, Jacqueline Meulman

Publication date 27 June 2014

Published in Psychometrika (Search for Journal in Brave)

zbMATH Keywords

graphical representationcircular strongly-anti-Robinsonleast-squares matrix approximationstrongly-anti-Robinson

Mathematics Subject Classification ID

Applications of statistics to psychology (62P15)

Recommendations

• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices
• The Representation of Symmetric Proximity Data: Dimensions and Classifications
• The Structural Representation of Proximity Matrices with MATLAB
• Correspondence analysis and optimal structural representations

Cites work

• scientific article; zbMATH DE number 4213811 (Why is no real title available?)
• scientific article; zbMATH DE number 53860 (Why is no real title available?)
• scientific article; zbMATH DE number 802809 (Why is no real title available?)
• scientific article; zbMATH DE number 802814 (Why is no real title available?)
• A sequential fitting procedure for linear data analysis models
• An Algorithm for Restricted Least Squares Regression
• Iterative projection strategies for the least‐squares fitting of tree structures to proximity data
• Linear and circular unidimensional scaling for symmetric proximity matrices
• Mathematical classification and clustering
• Spatial, non-spatial and hybrid models for scaling
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms

Cited in

(14)

• Combinatorial optimisation and hierarchical classifications
• A Simple and Optimal Algorithm for Strict Circular Seriation
• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• Lower (Anti-)Robinson Rank Representations for Symmetric Proximity Matrices
• An Optimal Algorithm for Strict Circular Seriation
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition
• The seriation problem in the presence of a double Fiedler value
• The Structural Representation of Proximity Matrices with MATLAB
• Structural classification analysis of three-way dissimilarity data
• Modules in Robinson Spaces
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis

This page was built for publication: Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices

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