Maximum transfer distance between partitions

Irène Charon; Lucile Denoeud; Alain Guénoche; Olivier Hudry

doi:10.1007/s00357-006-0006-2

Maximum transfer distance between partitions

Irène Charon, Lucile Denoeud, Alain Guénoche, Olivier Hudry

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at most p and q classes, for given p and q.

Original language	English
Pages (from-to)	103-121
Number of pages	19
Journal	Journal of Classification
Volume	23
Issue number	1
DOIs	https://doi.org/10.1007/s00357-006-0006-2
Publication status	Published - 1 Jun 2006

Keywords

Distance
Partitions
Transfer

Access to Document

10.1007/s00357-006-0006-2

Cite this

@article{119651d7adab430fb318328c40c0f931,

title = "Maximum transfer distance between partitions",

abstract = "In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at most p and q classes, for given p and q.",

keywords = "Distance, Partitions, Transfer",

author = "Ir{\`e}ne Charon and Lucile Denoeud and Alain Gu{\'e}noche and Olivier Hudry",

year = "2006",

month = jun,

day = "1",

doi = "10.1007/s00357-006-0006-2",

language = "English",

volume = "23",

pages = "103--121",

journal = "Journal of Classification",

issn = "0176-4268",

number = "1",

}

TY - JOUR

T1 - Maximum transfer distance between partitions

AU - Charon, Irène

AU - Denoeud, Lucile

AU - Guénoche, Alain

AU - Hudry, Olivier

PY - 2006/6/1

Y1 - 2006/6/1

N2 - In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at most p and q classes, for given p and q.

AB - In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at most p and q classes, for given p and q.

KW - Distance

KW - Partitions

KW - Transfer

U2 - 10.1007/s00357-006-0006-2

DO - 10.1007/s00357-006-0006-2

M3 - Article

AN - SCOPUS:33746266541

SN - 0176-4268

VL - 23

SP - 103

EP - 121

JO - Journal of Classification

JF - Journal of Classification

IS - 1

ER -

Maximum transfer distance between partitions

Abstract

Keywords

Access to Document

Fingerprint

Cite this