IDEAS home Printed from
   My bibliography  Save this article

A Binary Integer Program to Maximize the Agreement Between Partitions


  • Michael Brusco


  • Douglas Steinley



No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jclass:v:25:y:2008:i:2:p:185-193
    DOI: 10.1007/s00357-008-9013-9

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

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

    References listed on IDEAS

    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. H. Messatfa, 1992. "An algorithm to maximize the agreement between partitions," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 5-15, January.
    3. Leo Katz & James Powell, 1953. "A proposed index of the conformity of one sociometric measurement to another," Psychometrika, Springer;The Psychometric Society, vol. 18(3), pages 249-256, September.
    4. Ahmed N. Albatineh & Magdalena Niewiadomska-Bugaj & Daniel Mihalko, 2006. "On Similarity Indices and Correction for Chance Agreement," Journal of Classification, Springer;The Classification Society, vol. 23(2), pages 301-313, September.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Isabella Morlini & Sergio Zani, 2012. "Dissimilarity and similarity measures for comparing dendrograms and their applications," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(2), pages 85-105, July.
    2. Douglas Steinley & Gretchen Hendrickson & Michael Brusco, 2015. "A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties," Journal of Classification, Springer;The Classification Society, vol. 32(1), pages 114-126, April.


    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:jclass:v:25:y:2008:i:2:p:185-193. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.