IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v44y1979i1p21-41.html
   My bibliography  Save this article

Matching models in the analysis of cross-classifications

Author

Listed:
  • Lawrence Hubert

Abstract

No abstract is available for this item.

Suggested Citation

  • Lawrence Hubert, 1979. "Matching models in the analysis of cross-classifications," Psychometrika, Springer;The Psychometric Society, vol. 44(1), pages 21-41, March.
    • Handle: RePEc:spr:psycho:v:44:y:1979:i:1:p:21-41
    DOI: 10.1007/BF02293782
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02293782
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02293782?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lawrence Hubert & Frank Baker, 1978. "Evaluating the conformity of sociometric measurements," Psychometrika, Springer;The Psychometric Society, vol. 43(1), pages 31-41, March.
    2. Lawrence J. Hubert & Frank B. Baker, 1977. "Analyzing Distinctive Features," Journal of Educational and Behavioral Statistics, , vol. 2(2), pages 79-98, June.
    3. G. W. Graves & A. B. Whinston, 1970. "An Algorithm for the Quadratic Assignment Problem," Management Science, INFORMS, vol. 16(7), pages 453-471, March.
    4. Morton Brown, 1975. "The asymptotic standard errors of some estimates of uncertainty in the two-way contingency table," Psychometrika, Springer;The Psychometric Society, vol. 40(3), pages 291-296, September.
    5. Lawrence Hubert, 1976. "A relationship between the assignment problem and some simple statistical techniques," Quality & Quantity: International Journal of Methodology, Springer, vol. 10(4), pages 341-348, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Raphael Gillett, 1985. "Allowing for infeasible pairings in the matching paradigm," Psychometrika, Springer;The Psychometric Society, vol. 50(3), pages 265-274, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frank B. Baker & Lawrence J. Hubert, 1981. "The Analysis of Social Interaction Data," Sociological Methods & Research, , vol. 9(3), pages 339-361, February.
    2. Phipps Arabie & J. Carroll, 1980. "Mapclus: A mathematical programming approach to fitting the adclus model," Psychometrika, Springer;The Psychometric Society, vol. 45(2), pages 211-235, June.
    3. Dawn Iacobucci & Stanley Wasserman, 1990. "Social networks with two sets of actors," Psychometrika, Springer;The Psychometric Society, vol. 55(4), pages 707-720, December.
    4. Ronald S. Burt, 1978. "Cohesion Versus Structural Equivalence as a Basis for Network Subgroups," Sociological Methods & Research, , vol. 7(2), pages 189-212, November.
    5. J. Sutcliffe, 1986. "Differential ordering of objects and attributes," Psychometrika, Springer;The Psychometric Society, vol. 51(2), pages 209-240, June.
    6. Lawrence Hubert, 1979. "Generalized concordance," Psychometrika, Springer;The Psychometric Society, vol. 44(2), pages 135-142, June.
    7. Alexander Barvinok & Tamon Stephen, 2003. "The Distribution of Values in the Quadratic Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 64-91, February.
    8. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    9. Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
    10. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
    11. Michael Brusco & Douglas Steinley, 2008. "A Binary Integer Program to Maximize the Agreement Between Partitions," Journal of Classification, Springer;The Classification Society, vol. 25(2), pages 185-193, November.

    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:spr:psycho:v:44:y:1979:i:1:p:21-41. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.