IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v5y1989i3p273-325.html
   My bibliography  Save this article

Combinatorial data analysis: Confirmatory comparisons between sets of matrices

Author

Listed:
  • Lawrence Hubert
  • Phipps Arabie

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.

Suggested Citation

  • Lawrence Hubert & Phipps Arabie, 1989. "Combinatorial data analysis: Confirmatory comparisons between sets of matrices," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 5(3), pages 273-325, September.
  • Handle: RePEc:wly:apsmda:v:5:y:1989:i:3:p:273-325
    DOI: 10.1002/asm.3150050309
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150050309
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asm.3150050309?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Massimo Riccaboni & Alessandro Rossi & Stefano Schiavo, 2013. "Global networks of trade and bits," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 8(1), pages 33-56, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmda:v:5:y:1989:i:3:p:273-325. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-0747 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.