Combinatorial data analysis: Confirmatory comparisons between sets of matrices
- 1 September 1989
- journal article
- Published by Wiley in Applied Stochastic Models and Data Analysis
- Vol. 5 (3) , 273-325
- https://doi.org/10.1002/asm.3150050309
Abstract
The task of assessing the similarity of pattern between the entries of two square matrices has been discussed extensively over the last decade, as a unifying strategy for approaching a variety of seemingly disparate statistical problems. As typically defined, the comparison depends on a measure of matrix correspondence, usually a normalized cross‐product measure of some form, that is evaluated for relative size by the use of a reference distribution constructed through an equally likely permutation hypothesis defined at the level of the objects corresponding to the rows and columns of the two matrices. The extreme generality provided by this very simple framework subsumes a variety of different statistical problems, ranging from the study of spatial autocorrelation for variables observed over a set of geographic locations, to the topics of analysis of variance, the measurement of rank correlation, and confirmation techniques concerned with various conjectures of combinatorial structure that might be posited for an empirically determined measure of relationship between pairs of a given set of objects. The comparison strategies extant always assume that both matrices are fixed, and in those cases where one of the matrices codifies a given theoretical structure to be evaluated according to a second, this assumption can lead to substantial arbitrariness in how matrix similarity might be indexed, and thus, in how the comparison is implemented. As developed in this paper, exactly the same principles appropriate for use in the fixed comparison context can be extended to include matrices constructed through optimally weighted linear combinations of other sets of matrices. This generalization provides one mechanism for developing comparison strategies that allow assessment against very broad classes of matrices, which in turn serve to represent very general conjectures of possible combinatorial structure. This paper reviews some of these extensions in detail, with a particular emphasis on categorical and ordered categorical variables and whether they may reflect an empirically generated measure of object relationship.Keywords
This publication has 45 references indexed in Scilit:
- Hierarchical trees can be perfectly scaled in one dimensionJournal of Classification, 1988
- Additive clustering and qualitative factor analysis methods for similarity matricesJournal of Classification, 1987
- A Least Squares Algorithm for Fitting Additive Trees to Proximity DataPsychometrika, 1983
- Quantitative matrix comparisons in ecological and evolutionary investigationsJournal of Theoretical Biology, 1982
- Analysis of variance procedures based on a proximity measure between subjects.Psychological Bulletin, 1982
- Completely nonmetric multidimensional scalingJournal of Mathematical Psychology, 1978
- The comparison and fitting of given classification schemesJournal of Mathematical Psychology, 1977
- Tests for Patterns in Geographic VariationGeographical Analysis, 1975
- Nonmetric Multidimensional Scaling: A Numerical MethodPsychometrika, 1964
- The Similarity of Connected ObservationsAmerican Sociological Review, 1963