On the Complexity of Ordinal Clustering

• Autores: Rahúl Shah, Martín Farach-Colton
• Localización: Journal of classification, ISSN 0176-4268, Vol. 23, Nº 1, 2006, págs. 79-102
• Idioma: inglés
• DOI: 10.1007/s00357-006-0005-3
• Texto completo no disponible (Saber más ...)
• Resumen

  • Given a set of pairwise distances on a set of n points, constructing an edgeweighted tree whose leaves are these n points such that the tree distances would mimic the original distances under some criteria is a fundamental problem. One such criterion is to preserve the ordinal relation between the pairwise distances. The ordinal relation can be of the form of total order on the distances or it can be some partial order specified on the pairwise distances. We show that the problem of finding a weighted tree, if it exists, which would preserve the total order on pairwise distances is NP-hard. We also show the NP-hardness of the problem of finding a weighted tree which would preserve a particular kind of partial order called a triangle order, one of the most fundamental partial orders considered in computational biology.