IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v9y1992i1p5-15.html
   My bibliography  Save this article

An algorithm to maximize the agreement between partitions

Author

Listed:
  • H. Messatfa

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jclass:v:9:y:1992:i:1:p:5-15
    DOI: 10.1007/BF02618465
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02618465
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02618465?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. 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.
    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. José E. Chacón, 2021. "Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 257-263, July.
    2. 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.
    3. 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.
    4. Sung-Ho Kim & Geonyoup Noh, 2013. "Model Similarity and Rank-Order Based Classification of Bayesian Networks," Journal of Classification, Springer;The Classification Society, vol. 30(3), pages 428-452, October.
    5. José E. Chacón & Ana I. Rastrojo, 2023. "Minimum adjusted Rand index for two clusterings of a given size," 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. 17(1), pages 125-133, March.

    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. repec:jss:jstsof:14:i12 is not listed on IDEAS
    2. Stanley Wasserman, 1987. "Conformity of two sociometric relations," Psychometrika, Springer;The Psychometric Society, vol. 52(1), pages 3-18, March.
    3. Hornik, Kurt, 2005. "A CLUE for CLUster Ensembles," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 14(i12).
    4. 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:jclass:v:9:y:1992:i:1:p:5-15. 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.