Skip to main content
SpringerLink
Log in

A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

Building on Brusco and Steinley (2008), a computationally efficient stepwise optimal heuristic is provided for maximizing the adjusted Rand index (Hubert and Arabie 1985). The proposed algorithm is different than other methods for estimating the maximum value for the adjusted Rand index (e.g., Messatfa 1992) in that it does not rely on mathematical programming; consequently, problems of much larger size can be handled. Using the proposed method, various characteristics of the adjusted Rand index are explored and presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • ALBATINEH, A.N., NIEWIADOMSKA-BUGAJ, M., and MIHALKO, D. (2006), “On Similarity Indices and Correction for Chance Agreement”, Journal of Classification, 23, 301–313.

  • BRECKENRIDGE, J.N. (1989), “Replicating Cluster Analysis: Method, Consistency, and Validity”, Multivariate Behavioral Research, 24, 147–161.

  • BRUSCO, M.J. (2004), “Clustering Binary Data in the Presence of Masking Variables”, Psychological Methods, 9, 510–523.

  • BRUSCO, M.J., and CRADIT, J.D. (2001), “A Variable-Selection Heuristic for K-means Clustering”, Psychometrika, 66, 249–270.

  • BRUSCO, M.J., and STEINLEY, D. (2008), “A Binary Integer Program to Maximize the Agreement Between Partitions”, Journal of Classification, 25, 185–193.

  • CHENG, R., and MILLIGAN, G.W. (1996), “Measuring the Influence of Individual Data Points in Cluster Analysis”, Journal of Classification, 13, 315–335.

  • COLLINS, L.M., and DENT, C.W. (1988), “Omega: A General Formulation of the Rand Index of Cluster Recovery Suitable for Non-disjoint Solutions”, Multivariate Behavioral Research, 23, 231–242.

  • DOWNTON, M., and BRENNAN, T. (1980), “Comparing Classifications: An Evaluation of Several Coefficients of Partition Agreement”, paper presented at the meeting of the Classification Society, Boulder, CO, June 1980.

  • FOWLKES, E.B., and MALLOWS, C.L. (1983), “A Method for Comparing Two Hierarchical Clusterings”, Journal of the American Statistical Association, 78, 553–569.

  • MESSATFA, H. (1992), “An Algorithm to Maximize the Agreement Between Partitions”, Journal of Classification, 9, 5–15.

  • MILLIGAN, G.W. (1996), “Clustering Validation: Results and Implications for Applied Analyses”, in Clustering and Classification, eds. P. Arabie, L.J. Hubert, and G. De Soete, River Edge, NJ: World Scientific, pp. 341–375.

  • MILLIGAN, G.W., and COOPER, M.C. (1985), “An Examination of Procedures for Determining the Number of Clusters in a Data Set”, Psychometrika, 50, 159–179.

  • MILLIGAN, G.W., and COOPER, M.C. (1986), “A Study of the Comparability of External Criteria for Hierarchical Cluster Analysis”, Multivariate Behavioral Research, 21, 441–458.

  • MILLIGAN, G.W., and COOPER, M.C. (1987), “Methodological Review: Clustering Methods”, Applied Psychological Measurement, 11, 329–354.

  • MILLIGAN, G.W., and COOPER, M.C. (1988), “A Study of Standardization of Variables in Cluster Analysis”, Journal of Classification, 5, 181–204.

  • STEINLEY, D. (2003), “Local Optima in K-means Clustering: What You Don’t Know May Hurt You”, Psychological Methods, 8, 294–304.

  • STEINLEY, D. (2004a), “Standardizing Variables in K-means Clustering”, in Classification, Clustering, and Data Mining Applications, eds. D. Banks, L. House, F.R. Mc Morris, P. Arabie, and W. Gaul, New York: Springer, pp. 53–60.

  • STEINLEY, D. (2004b), “Properties of the Hubert-Arabie Adjusted Rand Index, Psychological Methods, 9, 386–396.

  • STEINLEY, D. (2006), “Profiling Local Optima in K-means Clustering: Developing a Diagnostic Technique”, Psychological Methods, 11, 178–192.

  • STEINLEY, D., and BRUSCO, M.J. (2007), “Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques”, Journal of Classification, 24, 99–121.

Download references

Author information

Authors and Affiliations

  1. Department of Psychological Sciences, University of Missouri, 210 McAlester Hall, Columbia, MO, 65203, USA

    Douglas Steinley

  2. Columbia College, Columbia, MO, USA

    Gretchen Hendrickson

  3. Florida State University, Tallahassee, FL, USA

    Michael J. Brusco

Authors
  1. Douglas Steinley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gretchen Hendrickson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael J. Brusco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Douglas Steinley.

Additional information

This article was partially supported by National Institute of Health Grant 1-K25-A017456-04 to the first author.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Steinley, D., Hendrickson, G. & Brusco, M.J. A Note on Maximizing the Agreement Between Partitions: A Stepwise Optimal Algorithm and Some Properties. J Classif 32, 114–126 (2015). https://doi.org/10.1007/s00357-015-9169-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-015-9169-z

Keywords

Search

Navigation