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

There are various optimization strategies for approximating, through the minimization of a least-squares loss function, a given symmetric proximity matrix by a sum of matrices each subject to some collection of order constraints on its entries. We extend these approaches to include components in the approximating sum that satisfy what are called the strongly-anti-Robinson (SAR) or circular strongly-anti-Robinson (CSAR) restrictions. A matrix that is SAR or CSAR is representable by a particular graph-theoretic structure, where each matrix entry is reproducible from certain minimum path lengths in the graph. One published proximity matrix is used extensively to illustrate the types of approximation that ensue when the SAR or CSAR constraints are imposed.

[1]  W. S. Robinson.  A Method for Chronologically Ordering Archaeological Deposits , 1951, American Antiquity.

[2]  R. Dykstra.  An Algorithm for Restricted Least Squares Regression , 1983 .

[3]  Boris Mirkin,et al.  Mathematical Classification and Clustering , 1996 .

[4]  R. Shepard,et al.  The internal representation of numbers , 1975, Cognitive Psychology.

[5]  Lawrence Hubert,et al.  The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms , 1994 .

[6]  L. Hubert,et al.  Iterative projection strategies for the least-squares fitting of tree structures to proximity data , 1995 .

[7]  J. Carroll,et al.  Spatial, non-spatial and hybrid models for scaling , 1976 .

[8]  B. Mirkin.  A sequential fitting procedure for linear data analysis models , 1990 .

[9]  M. Roux,et al.  TECHNIQUES OF APPROXIMATION FOR BUILDING TWO TREE STRUCTURES , 1988 .

[10]  Frank Critchley,et al.  The partial order by inclusion of the principal classes of dissimilarity on a finite set, and some of their basic properties , 1994 .

[11]  Frank Critchley.  On exchangeability-based equivalence relations induced by strongly Robinson and, in particular, by quadripolar Robinson dissimilarity matrices , 1994 .

[12]  Robert F. Ling,et al.  Classification and Clustering. , 1979 .

[13]  Lawrence Hubert,et al.  Linear and circular unidimensional scaling for symmetric proximity matrices , 1997 .

[14]  Alain Guénoche,et al.  Trees and proximity representations , 1991, Wiley-Interscience series in discrete mathematics and optimization.