{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:11:39Z","timestamp":1761765099022},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,11,8]],"date-time":"2008-11-08T00:00:00Z","timestamp":1226102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s11634-008-0029-0","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T13:48:24Z","timestamp":1226065704000},"page":"279-294","source":"Crossref","is-referenced-by-count":18,"title":["Transfer distance between partitions"],"prefix":"10.1007","volume":"2","author":[{"given":"Lucile","family":"Den\u0153ud","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,8]]},"reference":[{"key":"29_CR1","unstructured":"Barth\u00e9lemy J-P (1979) Propri\u00e9t\u00e9s m\u00e9triques des ensembles ordonn\u00e9s. Comparaison et agr\u00e9gation des relations binaires. PhD thesis, Universit\u00e9 de Franche-Comt\u00e9, Besan\u00e7on"},{"key":"29_CR2","unstructured":"Batagelj V, Mrvar M, Zaversnik M (1999) Partitioning approach to visualisation of large graphs. In: GD\u201999 Proceedings of the 7th international symposium on graph drawing, Lecture notes in computer science, vol 1731. Springer, Berlin, pp 90\u201397"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0022-2496(73)90003-5","volume":"10","author":"SA Boorman","year":"1973","unstructured":"Boorman SA, Olivier DC (1973) Metrics on spaces of finite trees. J Math Psychol 10: 26\u201359","journal-title":"J Math Psychol"},{"issue":"1","key":"29_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00357-006-0006-2","volume":"23","author":"I Charon","year":"2006","unstructured":"Charon I, Den\u0153ud L, Gu\u00e9noche A, Hudry O (2006) Maximum transfer distance between partitions. J Classif 23(1): 103\u2013121","journal-title":"J Classif"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4000\/msh.7403","volume":"179","author":"I Charon","year":"2007","unstructured":"Charon I, Den\u0153ud L, Hudry O (2007) Maximum de la distance de transfert \u00e0 une partition donn\u00e9e. Math\u00e9matiques et Sciences Humaines 179: 45\u201383","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0165-4896(81)90042-1","volume":"1","author":"W Day","year":"1981","unstructured":"Day W (1981) The complexity of computing metric distances between partitions. Math Soc Sci 1: 269\u2013287","journal-title":"Math Soc Sci"},{"issue":"3","key":"29_CR7","first-page":"105","volume":"2","author":"H Frayssex de","year":"1992","unstructured":"de Frayssex H, Kuntz P (1992) Pagination of large scale networks; embedding a graph in $${\\mathbb{R}^n}$$ for effective partitioning. Algorithmic Rev 2(3): 105\u2013112","journal-title":"Algorithmic Rev"},{"key":"29_CR8","unstructured":"Den\u0153ud L (2006) \u00c9tude de la distance de transfert entre partitions et recherche de zones denses dans un graphe. PhD thesis, Universit\u00e9 Paris 1, France"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.endm.2005.06.015","volume":"22","author":"A Gu\u00e9noche","year":"2005","unstructured":"Gu\u00e9noche A (2005) Comparing recent methods in graph partitioning. Electron Notes Discrete Math 22: 83\u201389","journal-title":"Electron Notes Discrete Math"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2: 193\u2013218","journal-title":"J Classif"},{"key":"29_CR11","first-page":"223","volume":"44","author":"P Jaccard","year":"1908","unstructured":"Jaccard P (1908) Nouvelle recherche sur la distribution florale. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 44: 223\u2013270","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2: 83\u201397","journal-title":"Naval Res Logist Q"},{"key":"29_CR13","first-page":"121","volume-title":"Classification and related methods of data analysis","author":"IC Lerman","year":"1988","unstructured":"Lerman IC (1988) Comparing partitions. Mathematical and statistical aspects. In: Bock HH (eds) Classification and related methods of data analysis, Elsevier, Amsterdam, pp 121\u2013132"},{"key":"29_CR14","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Annals of discrete mathematics 29, North-Holland"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda H, Ishihara T, Hashimoto A (1999) Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor Comput Sci 210: 305\u2013325","journal-title":"Theor Comput Sci"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci USA 98: 404\u2013409","journal-title":"Proc Natl Acad Sci USA"},{"key":"29_CR17","volume-title":"Combinatorial algorithms","author":"A Nijenhuis","year":"1978","unstructured":"Nijenhuis A, Wilf H (1978) Combinatorial algorithms. Academic Press, New York"},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66: 846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"29_CR19","unstructured":"R\u00e9gnier S (1965) Quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique. ICC Bull 4"},{"issue":"5","key":"29_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1080\/00029890.1964.11992270","volume":"71","author":"G-C Rota","year":"1964","unstructured":"Rota G-C (1964) The number of partitions of a set. Am Math Mon 71(5): 498\u2013504","journal-title":"Am Math Mon"},{"key":"29_CR21","volume-title":"Understanding probability: chance rules in everyday life","author":"H Tijms","year":"2004","unstructured":"Tijms H (2004) Understanding probability: chance rules in everyday life. Cambridge University Press, Cambridge"},{"key":"29_CR22","first-page":"569","volume":"78","author":"DL Wallace","year":"1983","unstructured":"Wallace DL (1983) Comment. J Am Stat Assoc 78: 569\u2013579","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"29_CR23","first-page":"97","volume":"52","author":"G Youness","year":"2004","unstructured":"Youness G, Saporta G (2004) Une m\u00e9thodologie pour la comparaison des partitions. Revue de Statistique Appliqu\u00e9e 52(1): 97\u2013120","journal-title":"Revue de Statistique Appliqu\u00e9e"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-008-0029-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-008-0029-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-008-0029-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:46:31Z","timestamp":1559414791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-008-0029-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["29"],"URL":"https:\/\/doi.org\/10.1007\/s11634-008-0029-0","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,8]]}}}