Partition-distance: A problem and class of perfect graphs arising in clustering

Abstract

Partitioning of a set of elements into disjoint clusters is a fundamental problem that arises in many applications. Different methods produce different partitions, so it is useful to have a measure of the similarity, or distance, between two or more partitions. In this paper we examine one distance measure used in a clustering application in computational… (More)
DOI: 10.1016/S0020-0190(01)00263-0

Topics

3 Figures and Tables

Slides referencing similar topics