Maximum transfer distance between partitions

Journal of Classification

Volumn 23, Issue 1, 2006, Pages 103-121

  Charon, Irène ^a,d   Denoeud, Lucile ^a,b,d   Guénoche, Alain ^c   Hudry, Olivier ^a,b,d  

^a TELECOM PARISTECH   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^c AIX MARSEILLE UNIVERSITÉ   (France)

^d Ecole Nationale Supérieure des T and communications   (France)

Author keywords

Distance; Partitions; Transfer

Indexed keywords

EID: 33746266541     PISSN: 01764268     EISSN: 14321343     Source Type: Journal    
DOI: 10.1007/s00357-006-0006-2     Document Type: Article

References (22)

1. AHUJA, R.K., MAGNANTI, T.L., and ORLIN, J.B. (1993), Network Flows, Englewood Cliffs, New Jersey: Prentice Hall.
2. ALPERT, C.J., and KANG, A. (1995), "Recent Direction in Netlist Partitioning: A Survey", Integration: the VLSI Journal, 19, 1-2, 1-81.
3. BATAGELJ, V., MRVRAR, M., and ZAVERSNIK, M. (1999), "Partitioning Approach to Visualisation of Large Graphs", Lecture Notes in Computer Science 1731, Springer, 90-97.
4. DAY, W. (1981), "The Complexity of Computing Metric Distances Between Partitions", Mathematical Social Sciences, 1, 269-287.
5. n for Effective Partitioning", Algorithmic Review, 2(3), 105-112.
6. DENŒUD, L. and GUÉNOCHE, A. (2006), "Comparison of Distance Indices Between Partitions", IFCS 2006 Conference, Ljubljana, Slovenia, July 2006.
7. GETZ, G., LEVINE, E., and DOMANY, E. (2000), "Coupled Two-way Clustering Analysis of Gene Microarray Data", Proceedings of the National Academy of Sciences USA, 97, 22, 12079-12084.
8. GUÉNOCHE, A. (2004), "Clustering by Graph Density", Proceedings of the International Federation of the Classification Societies, Eds. D. Banks and al., Springer, 15-23.
9. GUÉNOCHE, A. (2005), "Comparison of Algorithms in Graph Partitioning", ALIO/EURO Conference on Combinatorial Optimization, Paris, France, October 2005.
10. HUBERT, L. and ARABIE, P. (1985), "Comparing Partitions", Journal of Classification, 2, 193-218.
11. KUHN, H.W. (1955), "The Hungarian Method for the Assignment Problem", Naval Research Logistics Quarterly, 2, 83-97.
12. KÜHN, H.W. (1956), "Variants on the Hungarian Method for the Assignment Problems", Naval Research Logistics Quarterly, 3, 253-258.
13. LOVASZ, L. and PLUMMER, M. (1986), Matching Theory, Annals of Discrete Mathematics, Vol 29, North Holland, Amsterdam.
14. MATSUDA, H., ISHIHARA, T., and HASHIMOTO, A. (1999), "Classifying Molecular Sequences Using a Linkage Graph with Their Pairwise Similarities", Theoretical Computer Science, 210, 305-325.
15. MOODY, J. (2001), "Identifying Dense Clusters in Large Networks", Social Networks, 23, 261-283.
16. NEWMAN, M.E.J. (2001), "The Structure of Scientific Collaboration Networks", Proceedings of the National Academy of Sciences USA, 98, 404-409.
17. RAND, W.M. (1971), "Objective Criteria for the Evaluation of Clustering Methods", Journal of the American Statistical Association, 66, 846-850.
18. RÉGNIER, S. (1965), "Quelques Aspects Mathématiques des Problèmes de Classification Automatique", I.C.C. Bulletin 4.
19. Reprint in Mathématiques et Sciences humaines, 82(1983), 13-29.
20. SEIDMAN, S.B. (1983), "Network Structure and Minimum Degree", Social Networks, 5, 269-287.
21. van DONGEN, S. (2000), Graph Clustering by Flow Simulation, PhD thesis, University of Utrecht.
22. YOUNESS, G. and SAPORTA, G. (2004), "Une Méthodologie pour la Comparaison des Partitions", Revue de Statistique Appliquée, 52(1), 97-120.