Skip to main content

Comparison of Distance Indices Between Partitions

  • Conference paper
Data Science and Classification

Abstract

In this paper, we compare five classical distance indices on P n, the set of partitions on n elements. First, we recall the definition of the transfer distance between partitions and an algorithm to evaluate it. Then, we build sets P k(P) of partitions at k transfers from an initial partition P. Finally, we compare the distributions of the five index values between P and the elements of P k(P).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ARABIE, P., BOORMAN, S.A. (1973): Multidimensional Scaling of Measures of Distance between Partitions, Journal of Mathematical Psychology, 10, 148–203.

    Article  MATH  MathSciNet  Google Scholar 

  • BROWN, L., CAL, T. and DASGUPTA, A. (2002): Confidence intervals for a binomial proportion and asymptotic expansions, Ann. Statist., 160–201.

    Google Scholar 

  • CHARON, I., DENOEUD, L., GUÉNOCHE, A. and HUDRY, A. (2005): Comparing partitions by element transferts, submitted.

    Google Scholar 

  • DAY, W. (1981): The complexity of computing metric distances between partitions, Mathematical Social Sciences, 1, 269–287.

    Article  MATH  MathSciNet  Google Scholar 

  • HUBERT, L. and ARABIE, P. (1985): Comparing partitions, J. of Classification, 2, 193–218.

    Article  Google Scholar 

  • NIJENHUIS, A. and WILF, H. (1978): Combinatorial algorithms, Academic Press, New-York.

    MATH  Google Scholar 

  • RAND, W.M. (1971): Objective criteria for the evaluation of clustering methods, J. Amer. Statist. Assoc., 66, 846–850.

    Article  Google Scholar 

  • VAN LEEUWEN, J. (1990): Handbook of thoretical computer science, Vol A, Elsevier, Amsterdam.

    Google Scholar 

  • WALLACE, D.L. (1983): Comment, J. of the Am. Stat. Association, 78, 569–579.

    Article  Google Scholar 

  • YOUNESS, G. and SAPORTA, G. (2004): Une méthodologie pour la comparaison des partitions, Revue de Statistique Appliquée, 52(1), 97–120.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Denœud, L., Guénoche, A. (2006). Comparison of Distance Indices Between Partitions. In: Batagelj, V., Bock, HH., Ferligoj, A., Žiberna, A. (eds) Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-34416-0_3

Download citation

Publish with us

Policies and ethics