{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:28Z","timestamp":1773656428555,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,4]],"date-time":"2011-03-04T00:00:00Z","timestamp":1299196800000},"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":[[2011,10]]},"DOI":"10.1007\/s11634-011-0087-6","type":"journal-article","created":{"date-parts":[[2011,3,3]],"date-time":"2011-03-03T14:13:09Z","timestamp":1299161589000},"page":"215-229","source":"Crossref","is-referenced-by-count":40,"title":["Consensus of partitions : a constructive approach"],"prefix":"10.1007","volume":"5","author":[{"given":"Alain","family":"Gu\u00e9noche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,4]]},"reference":[{"key":"87_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0165-4896(81)90041-X","volume":"1","author":"JP Barth\u00e9lemy","year":"1981","unstructured":"Barth\u00e9lemy JP, Monjardet B (1981) The median procedure in cluster analysis and social choice. Theory Math Soc Sci 1:235\u2013268","journal-title":"Theory Math Soc Sci"},{"key":"87_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1090\/dimacs\/019\/01","volume":"19","author":"JP Barth\u00e9lemy","year":"1995","unstructured":"Barth\u00e9lemy JP, Leclerc B (1995) The median procedure for partitions. DIMACS Ser Discret Math Theor Compu Sci 19: 3\u201334","journal-title":"DIMACS Ser Discret Math Theor Compu Sci"},{"key":"87_CR3","volume-title":"Contribution des m\u00e9thodes de partition centrale \u00e0 la mise en evidence exp\u00e9rimentale de cat\u00e9gories cognitives","author":"T Brenac","year":"2002","unstructured":"Brenac T (2002) Contribution des m\u00e9thodes de partition centrale \u00e0 la mise en evidence exp\u00e9rimentale de cat\u00e9gories cognitives. INRETS, Arcueil"},{"key":"87_CR4","volume-title":"Classification automatique des Donn\u00e9es","author":"G Celeux","year":"1989","unstructured":"Celeux G, Diday E, Govaert G, Lechevalier Y, Ralambondrainy H (1989) Classification automatique des Donn\u00e9es. Dunod, Paris"},{"issue":"1","key":"87_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00357-006-0006-2","volume":"23","author":"I Charon","year":"2006","unstructured":"Charon I, Denoeud L, Gu\u00e9noche A, Hudry O (2006) Maximum transfer distance between partitions. J Classif 23(1): 103\u2013121","journal-title":"J Classif"},{"key":"87_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"},{"key":"87_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s11634-008-0029-0","volume":"2","author":"L Denoeud","year":"2008","unstructured":"Denoeud L (2008) Transfer distance between partitions. Adv Data Anal Classif 2: 279\u2013294","journal-title":"Adv Data Anal Classif"},{"key":"87_CR8","unstructured":"Dubois D (1991) S\u00e9mantique et cognition\u2014Cat\u00e9gories, prototypes et typicalit\u00e9. Edition du CNRS, Paris"},{"key":"87_CR9","doi-asserted-by":"crossref","unstructured":"Filkov V, Skiena S (2003) Integrating microarray data by consensus clustering. In: Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pp 418\u2013425","DOI":"10.1109\/TAI.2003.1250220"},{"key":"87_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1989) A cutting plan algorithm for a clustering problem. Math Program 45: 59\u201396","journal-title":"Math Program"},{"key":"87_CR11","unstructured":"Gu\u00e9noche A (2010) Bootstrap clustering for graph partitioning. MARAMI proceedings (submitted)"},{"issue":"3","key":"87_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0020-0190(01)00263-0","volume":"82","author":"D Gusfield","year":"2002","unstructured":"Gusfield D (2002) Partition-distance. Inf Process Lett 82(3): 159\u2013164","journal-title":"Inf Process Lett"},{"issue":"5","key":"87_CR13","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/0031-3203(87)90081-1","volume":"20","author":"AK Jain","year":"1987","unstructured":"Jain AK, Moreau JV (1987) Bootstrap technique in cluster analysis. Pattern Recognit 20(5): 547\u2013568","journal-title":"Pattern Recognit"},{"key":"87_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M Krivanek","year":"1986","unstructured":"Krivanek M, Moravek J (1986) NP-hard problems in hierarchical-tree clustering. Acta Informatica 23: 311\u2013323","journal-title":"Acta Informatica"},{"key":"87_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0165-4896(84)90060-X","volume":"8","author":"B Leclerc","year":"1984","unstructured":"Leclerc B (1984) Efficient and binary consensus functions on transitively valued relations. Math Soc Sci 8: 45\u201361","journal-title":"Math Soc Sci"},{"key":"87_CR16","doi-asserted-by":"crossref","unstructured":"Mirkin BG (1975) On the problem of reconciling partitions. In: Quantitative Sociology. Academic Press, New York, pp 441\u2013449","DOI":"10.1016\/B978-0-12-103950-9.50021-6"},{"key":"87_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0165-4896(90)90077-K","volume":"20","author":"B Monjardet","year":"1990","unstructured":"Monjardet B (1990) Arrowian characterization of latticial federation consensus functions. Math Soc Sci 20: 51\u201371","journal-title":"Math Soc Sci"},{"key":"87_CR18","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) A fast algorithm for detecting community structure in networks. Phys Rev E Stat Nonlin Soft Matter Phys 69: 066133","journal-title":"Phys Rev E Stat Nonlin Soft Matter Phys"},{"key":"87_CR19","volume-title":"Combinatorial algorithms","author":"A Nijenhuis","year":"1978","unstructured":"Nijenhuis A, Wilf H (1978) Combinatorial algorithms. Academic Press, New York"},{"issue":"2","key":"87_CR20","first-page":"128","volume":"2","author":"JF Pinto da Costa","year":"2004","unstructured":"Pinto da Costa JF, Rao PR (2004) Central partition for a partition-distance and strong pattern graph. REVSTAT 2(2): 128\u2013143","journal-title":"REVSTAT"},{"key":"87_CR21","unstructured":"R\u00e9gnier S (1965) Sur quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique. Math\u00e9matiques et Sciences humaines 82:1983, 13\u201329 (reprint of I.C.C. bulletin 4: 1965, 175\u2013191)"},{"key":"87_CR22","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0112071","volume":"12","author":"CT Zahn","year":"1964","unstructured":"Zahn CT (1964) Approximating symmetric relations by equivalence relations. SIAM J Appl Math 12: 840\u2013847","journal-title":"SIAM J Appl Math"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-011-0087-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-011-0087-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-011-0087-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T23:52:08Z","timestamp":1560037928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-011-0087-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,4]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["87"],"URL":"https:\/\/doi.org\/10.1007\/s11634-011-0087-6","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,4]]}}}