Partition-distance: A problem and class of perfect graphs arising in clustering
Partition-distance: A problem and class of perfect graphs arising in clustering
复制标题
DOI：
10.1016/s0020-0190(01)00263-0
复制
发表时间：
2002-05-16
影响因子：
0.5
通讯作者：
Gusfield, D
中科院分区：
文献类型：
--
作者：
Gusfield, D
将一组元素划分成不相交的簇是许多应用中出现的一个基本问题。不同的方法会产生不同的分区，因此对两个或多个分区之间的相似性或距离进行度量是很有用的。在这篇文章中，我们考察了在计算遗传学的聚类应用中使用的一种距离度量。我们展示了如何有效地计算距离，以及如何定义一类新的完美图。(C)2002 Elsevier Science B.V.保留所有权利。
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 genetics. We show how to efficiently compute the distance, and how this defines a new class of perfect graphs. (C) 2002 Elsevier Science B.V. All rights reserved.